Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
M.C. Agar and S. Salhi. Lagrangean heuristics applied to a variety of large scale capacitated plant location problems. Journal of the Operational Research Society, 49: 1072–1084, 1998.
J. Barceló and J. Casanovas. A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 15: 212–226, 1984.
J. Barceló, E. Fernandez, and K. Jornsten. Computational results from a new relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research, 15: 38–45, 1991.
J.E. Beasley. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41: 1069–1072, 1990.
J.E. Beasley. Lagrangean heuristics for location problems. European Journal of Operational Research, 65: 383–309, 1993.
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.
N. Christofides, A. Mingozzi, and P. Toth. Combinatorial Optimization. Wiley, Chichester, 1979.
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.
K. Darby-Dowman and H.S. Lewis. Lagrangean relaxation and the single source capacitated facility location problem. Journal of the Operational Research Society, 39: 1035–1040, 1988.
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.
O. DeMaio and C.A. Roveda. An all zero-one algorithm for a certain class of transportation problems. Operations Research, 19: 1406–1418, 1971.
D. Erlenkotter. A dual-based procedure for the uncapacitated facility location. Operations Research, 26: 992–1009, 1978.
V.J.M.F. Filho and R.D. Galvão. A tabu search heuristic for the concentrator location problem. Location Science, 6: 189–209, 1998.
R.W. Floyd. Algorithm 97: Sorthest path. Communications of the ACM, 5: 345, 1962.
M. Guignard and S. Kim. A strong Lagrangean relaxation for the capacitated plant location problems. Report 56, Department of Statistics, University of Pennsylvania, 1983.
K.S. Hindi and K. Pienkosz. Efficient solution of large scale, single source, capacitated plant location problems. Journal of the Operational Research Society, 50: 268–274, 1999.
J.K. Holmberg, M. Ronnqvist, and D. Yuan. An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research, 113: 544–559, 1999.
CPLEX Optimization Inc. Using the Cplex Callable Library, version 3.0,1994.
J.G. Klincewicz and H. Luss. A Lagrangean relaxation heuristic for the capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37: 495–500, 1986.
A. Kuenh and M.J. Hamburger. A heuristic program for locating warwhouses. Management Science, 9: 643–666, 1963.
R.M. Nauss. An improved algorithm for the capacitated facility location problem. Journal of the Operational Research Society, 29: 1195–1201, 1978.
A.E. Neebe and M.R. Rao. An algorithm for the fixed-charge assignment users to sources problem. Journal of the Operational Research Society, 34: 1107–1113, 1983.
H. Pirkul. Efficient algorithms for the capacitated concentrator problem. Computers and Operations Research, 14: 197–208, 1987.
R. Sridharan. A Lagrangean heuristic for the capacitated plant problem with single source constraints. European Journal of Operational Research, 66: 305312, 1993.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cortinhal, M.J., Captivo, M.E. (2003). Genetic Algorithms for the Single Source Capacitated Location Problem. In: Metaheuristics: Computer Decision-Making. Applied Optimization, vol 86. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4137-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4137-7_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5403-9
Online ISBN: 978-1-4757-4137-7
eBook Packages: Springer Book Archive