An exact algorithm for the capacitated facility location problems with single sourcing

European Journal of Operational Research

Volumn 113, Issue 3, 1999, Pages 544-559

  Holmberg, Kaj ^a   Rönnqvist, Mikael ^b   Yuan, Di ^a  

^a Div Optimization Linkoping I   (Sweden)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Branch and bound; Facility location; Integer programming; Lagrangian heuristics

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

BRANCH-AND-BOUND METHOD; LAGRANGIAN HEURISTICS;

SITE SELECTION;

EID: 0033102180     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00008-3     Document Type: Article

References (23)

1. Åhlander, F., 1994. The capacitated facility location problem with single sourcing, Master Thesis LiTH-MAT-EX-1994-07, Linköping University, Sweden (in Swedish).
2. Altinkemer K., Gavish B. Parallel savings based heuristics for the delivery problem. Operations Research. 39:1991;456-469.
3. Barcelo J., Casanovas J. A heuristic Lagrangian algorithm for the capacitated plant location problem. European Journal of Operational Research. 15:1984;212-226.
4. Beasley J.E. Lagrangian heuristics for location problems. European Journal of Operational Research. 65:1993;383-399.
5. CPLEX Optimization, Inc. (1994), Using the CPLEX Callable Library, version 3.0.
6. Desrochers M., Verhoog T. A new heuristic for the fleet size and mix vehicle routing problem. Computers and Operations Research. 18:1991;263-274.
7. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research. 26:1978;992-1009.
8. Fisk J. A solution procedure for a special type of capacitated warehouse location problem. Logistics Transportation Review. 13:1978;305-320.
9. Forbes, M., 1992. Vehicle and Crew Scheduling in Public Transport. Ph.D. thesis, University of Queensland, Brisbane.
10. Geoffrion A.M. Lagrangian relaxation for integer programming. Mathematical Programming Study. 2:1974;82-114.
11. Klincewicz J., Luss H. A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society. 37:1986;495-500.
12. Klincewicz J., Luss H., Pilcher M. Fleet size planning when outside carrier service are available. Transportation Science. 24:1990;169-182.
13. Martello, S., Toth, P., 1990. Knapsack Problems, Algorithms and Computer Implementations, Wiley, New York.
14. Neebe A., Rao M. An algorithm for the fixed-charge assigning users to sources problem. European Journal of Operational Research. 34:1983;1107-1113.
15. Pirkul H. Efficient algorithm for the capacitated concentrator location problem. Computers and Operations Research. 14:1987;197-208.
16. Poljak B.T. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics. 9:1969;14-29.
17. Rönnqvist, M., 1995. Solving single-source capacitated facility location problems using repeated matching. In: Proceedings of the 31st Annual Conference of the Operational Research Society of New Zealand, Wellington, New Zealand pp. 187-194.
18. Rönnqvist, M., Tragantalerngsak, S., Holt, J., 1995. A new approach to solve single-source capacitated facility location problems, European Journal of Operational Research, Forthcoming.
19. Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research. 35:1987;254-265.
20. Sridharan R. A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research. 66:1993;305-312.
21. Teitz M., Bart P. Heuristic methods for estimating the general vertex median of a weighted graph. Operations Research. 16:1968;955-961.
22. Wark P., Holt J. A repeated matching heuristic for the vehicle routeing problem. Journal of Operational Research Society. 45:1994;1156-1167.
23. Wark, P., Holt, J., Rönnqvist, M., Ryan, D., 1995. Aircrew schedule generation using repeated matching, European Journal of Operational Research 102, 21-35.