Genetic Algorithms for the Single Source Capacitated Location Problem
The single source capacitated location problem is considered. Given a set of potential locations and the plant capacities, it must be decided where and how many plants must be open and which clients must be assigned to each open plant. Genetic algorithms that use different methodologies for handling constraints are described and tested. Computational experiments on different sets of problems are presented.
KeywordsCapacitated facility location Genetic algorithms Search methods.
Unable to display preview. Download preview PDF.
- J.E. Beasley. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41: 1069–1072, 1990.Google Scholar
- R. Berretta and P. Moscato. The number partitionating problem: An open challenge for evolutionary computation? In M. Dorigo D.Corn and F. Glover, editors, New ideias in Optimization, pages 261–278. Mc Graw Hill Companies ISBN 007 709506 5, 1999.Google Scholar
- M.J. Cortinhal and M.E. Captivo. Upper and lower bounds for the single source capacitated location problem. Accepted for publication in the special issue of European Journal of Operational Research dedicated to the EURO Winter Institute XV III, 2001.Google Scholar
- H. Delmaire, J.A. Diaz, E. Fernandez, and M.Ortega. Comparing new heuristics for the pure integer capacitated location problem. Research report DR97/10, Universidad Politecnica de Catalunya, Spain, 1997.Google Scholar
- M. Guignard and S. Kim. A strong Lagrangean relaxation for the capacitated plant location problems. Report 56, Department of Statistics, University of Pennsylvania, 1983.Google Scholar
- CPLEX Optimization Inc. Using the Cplex Callable Library, version 3.0,1994.Google Scholar