Upper and lower bounds for the single source capacitated location problem

European Journal of Operational Research

Volumn 151, Issue 2, 2003, Pages 333-351

  Cortinhal, Maria João ^a   Captivo, Mari Eugénia ^b  

^a INSTITUTO UNIVERSITÁRIO DE LISBOA ISCTE IUL   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Capacitated facility location; Lagrangean heuristics; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; LOCATION; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0042522794     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00829-9     Document Type: Conference Paper

References (28)

1. Agar M.C., Salhi S. Lagrangean heuristics applied to a variety of large scale capacitated plant location problems. Journal of the Operational Research Society. 49:1998;1072-1084.
2. Barceló J., Casanovas J. A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research. 15:1984;212-226.
3. Barceló J., Fernandez E., Jornsten K. Computational results from a new relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research. 53:1991;38-45.
4. Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Society. 41:1990;1069-1072.
5. Beasley J.E. Lagrangean heuristics for location problems. European Journal of Operational Research. 65:1993;383-399.
6. Christofides N., Mingozzi A., Toth P. Combinatorial Optimization. 1979;Wiley, Chichester.
7. CPLEX Optimization, Inc., Using the CPLEX Callable Library, version 3.0, 1974.
8. Darby-Dowman K., Lewis H.S. Lagrangean relaxation and the single source capacitated facility location problem. Journal of the Operational Research Society. 39(11):1988;1035-1040.
9. H. Delmaire, J.A. Diaz, E. Fernandez, M. Ortega, Comparing new heuristics for the pure integer capacitated plant location problem, research report DR97/10, Dpt E10, Universidad Politecnica de Catalunya, Spain.
10. DeMaio O., Roveda C.A. An all zero-one algorithm for a certain class of transportation problems. Operations Research. 19:1971;1406-1418.
11. Q. Deng, D. Simchi-Levi, Valid inequalities, facets and computational results for the capacitated concentrator location problem, Unpublished paper, 1992.
12. Erlenkotter D. A dual-based procedure for the uncapacitated facility location. Operations Research. 26:1978;992-1009.
13. Fiho V.J.M.F., Galvão R.D. A tabu search heuristic for the concentrator location problem. Location Science. 6:1998;189-209.
14. Floyd R.W., Algorithm 97: Shortest Path Communications of the ACM. 5(6):1962;345.
15. Glover F. Future path for integer programming and links to artificial intelligence. Computers and Operations Research. 1:1986;533-549.
16. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers, Dordrecht.
17. M. Guignard-Spielberg, S. Kim, A strong Lagrangean relaxation for the capacitated plant location problems, Working paper no. 56, Department of statistics, The Wharton School, University of Pennsylvania, 1983.
18. Held M., Karp R.M. The travelling salesman problem and minimum spanning trees. Operations Research. 18:1970;1138-1162.
19. Held M., Karp R.M. The travelling salesman problem and minimum spanning trees: Part II. Mathematical Programming. 1:1970;6-25.
20. Hindi K.S., Pienkosz K. Efficient solution of large scale, single source, capacitated plant location problem. Journal of the Operational Research Society. 50:1999;268-274.
21. Holmberg K., Ronnqvist M., Yuan D. An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research. 113:1999;544-559.
22. Klincewicz J.G., Luss H. A Lagrangean relaxation heuristic for the capacitated facility location with single-source constraints. Journal of the Operational Research Society. 37/5:1986;495-500.
23. Kuehn A., Hamburger M.J. A heuristic program for locating warehouses. Management Science. 9:1963;643-666.
24. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, New York, ISBN 0-471-92420-2, 1990.
25. Neebe A.E., Rao M.R. An algorithm for the fixed-charge assigning users to sources problem. Journal of the Operational Research Society. 34(11):1983;1107-1113.
26. Nauss R.M. An improved algorithm for the capacitated facility location problem. Journal of the Operational Research Society. 29:1978;1195-1201.
27. Pirkul H. Efficient algorithms for the capacitated concentrator problem. Computers and Operations Research. 14:1987;197-208.
28. Sridharan R. A Lagrangean heuristic for the capacitated plant problem with single source constraints. European Journal of Operational Research. 66:1993;305-312.