An exact algorithm for solving a capacitated location-routing problem

In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construct delivery routes from the selected depot or depots to the remaining sites at least system cost. The objective function is the sum of depot operating costs, vehicle acquisition costs and routing costs. This paper considers one such problem in which a weight is assigned to each site and where sites are to be visited by vehicles having a given capacity. The solution must be such that the sum of the weights of sites visited on any given route does not exceed the capacity of the visiting vehicle. The formulation of an integer linear program for this problem involves degree constraints, generalized subtour elimination constraints, and chain barring constraints. An exact algorithm, using initial relaxation of most of the problem constraints, is presented which is capable of solving problems with up to twenty sites within a reasonable number of iterations.     

Integration of equipment planning and project scheduling

It is common to schedule project activities first, then the utilization of equipment and its operating crew is planned based on such schedule. Real world experiences indicate that activity scheduling can be heavily impacted by the resources needed. In particular, if a project requires highly specialized and expensive equipment type, then one needs to take into account the schedule and cost of such resources in developing the project schedule.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

Rotational invariance in the three-dimensional lattice Boltzmann method is dependent on the choice of lattice

The lattice Boltzmann method has recently gained popularity as a tool for simulating complex fluid flows. It uses discrete sets of velocity vectors, or lattices, to create a reduced model of the molecular dynamics of a continuum fluid. While several lattices are believed to behave isotropically, there are reports of qualitatively incorrect results. However, thus far, the reason as to why a lack of isotropy occurs is not known. Based on the hypothesis that lower order lattices may not display rotational invariance, this study tests the isotropy of the D3Q15, D3Q19 and D3Q27 lattices by performing simulations at intermediate Reynolds numbers (50–500) and low Knudsen number (<0.0005) in an axisymmetrical geometry with a nozzle leading to a throat followed by a sudden expansion. The symmetry properties of the results were examined. It was found that at Re ? 250 the D3Q15 and D3Q19 lattices produced different results depending on the plane of the lattice with which the flow was aligned. Lattice planes with fewer than six velocity vectors consistently produced results which were qualitatively different from the planes with six or more velocity vectors. These errors were not observed at Re = 50 or when a D3Q27 lattice was used. They appeared to be independent of grid density, collision operator and Ma. This suggests that the lattices which contain these planes are not fully isotropic and therefore do not properly replicate the behavior of a real fluid in this particular situation, notably downstream from the expansion. Predictions made using these models in more complex geometries may therefore be affected by the orientation of the lattice. When using LBM in CFD simulation (including validation) this study highlights the need for caution to ensure that the solution obtained is independent of the lattice orientation throughout the domain.     

Computing the minimal covering set

We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.     

Perturbation method for determining the group of invariance of hierarchical models

We propose a perturbation method for determining the (largest) group of invariance of a toric ideal defined in [S. Aoki, A. Takemura, The largest group of invariance for Markov bases and toric ideals, J. Symbolic Comput. 43 (5) (2008) 342–358]. In the perturbation method, we investigate how a generic element in the row space of the configuration defining a toric ideal is mapped by a permutation of the indeterminates. Compared to the proof by Aoki and Takemura which was based on stabilizers of a subset of indeterminates, the perturbation method gives a much simpler proof of the group of invariance. In particular, we determine the group of invariance for a general hierarchical model of contingency tables in statistics, under the assumption that the numbers of the levels of the factors are generic. We prove that it is a wreath product indexed by a poset related to the intersection poset of the maximal interaction effects of the model.     

具有销售成本的小额信贷模型

首先剖析了我国小额贷款实践的现状和存在的问题,通过理论和数学模型分析,指出信贷约束本身并不是贫困产生和持续的充分条件.由于农户存在产品销售成本带来的销售规模效应给农户的贫困的影响及其对农村小额信贷项目的影响,过低的贷款额度可能会使得小额贷款项目对农户失去吸引力,造成小额贷款需求萎缩.因此,适当扩大小额贷款的额度限制,有利于农户更加积极地参与到小额贷款项目中,通过正当经营,增加收入,从而提高生活水平.     

A note on coalitional manipulation and centralized inventory management

In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies this property. The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN.     

改进的最小费用理论在盲竖井选址中的应用

在网络的任意点求解绝对中心等特殊点是网络流研究的一个难点.在目前最小费用理论的基础上引入平面几何理论,把网络等效于几何图形,建立了数学模型.通过求解,得出了网络间的最佳连接点,从而确定出盲竖井的位置.最后以云南锡业集团个旧东区两个生产平台之间的连接为一算例,得出了理想的结果,验证了该方法的有效可行性.