Locational equilibrium of two facilities on a tree
Long-term planning versus short-term planning in the asymptotical location problem
Given the probability measure over the given region , we consider the optimal location of a set composed by points in in order to minimize the average distance (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...
Long-term planning versus short-term planning in the asymptotical location problem
Given the probability measure ν over the given region , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...
Mapping the convergence of genetic algorithms.
Metaheuristics based on Bin Packing for the line balancing problem
The line balancing problem consits in assigning tasks to stations in order to respect precedence constraints and cycle time constraints. In this paper, the cycle time is fixed and the objective is to minimize the number of stations. We propose to use metaheuristics based on simulated annealing by exploiting the link between the line balancing problem and the bin packing problem. The principle of the method lies in the combination between a metaheuristic and a bin packing heuristic. Two representations of...
Multidimensional assignment: applications and some thoughts.
Multiperiod medians on networks
Odd cycles and a class of facets of the axial 3-index assignment polytope
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between...
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum...
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
For a family of maps , d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.
On the solution of a class of location problems. A sample problem
Optimal Distribution Centers Involving Supply Capacity, Demands and Budget Restriction
Optimal Location of Production Centers Interconnected Materials and Products Allocation
Part and Machine Partitioning Problem in Cellular Manufacturing: Multiple Machine Environment
Planification des emplois du temps et de la formation au sein d'une grande entreprise
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise
We describe an O.R. technique which plans the allotment of time of the collaborators of a big company. The proposed method not only considers the immediate profitability of the company, but also the training of the collaborators in order to guarantee the success of the company's rising generation. The proposed method uses a greedy approach and constitutes therefore a simple and fast tool for decision makers. It has been successfully implemented in an important Swiss bank society.
Problème d'affectation, localisation d'entrepôts
Problemi di localizzazione di cammini e alberi su reti
RedInv-SA : a simulated annealing for the quadratic assignment problem