A branch-and-price algorithm for the capacitated facility location problem

European Journal of Operational Research

Volumn 179, Issue 3, 2007, Pages 1109-1125

  Klose, Andreas ^a   Görtz, Simon ^b  

^a UNIVERSITY OF ZURICH   (Switzerland)

^b UNIVERSITY OF WUPPERTAL   (Germany)

Author keywords

Branch and price; Capacitated facility location; Column generation; Lagrangean relaxation; Mixed integer programming

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; OPERATIONS RESEARCH; PROBLEM SOLVING;

CAPACITATED FACILITY LOCATION; COLUMN GENERATION; LAGRANGEAN RELAXATION; MIXED INTEGER PROGRAMMING;

TRACKING (POSITION);

EID: 33845922643     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.03.078     Document Type: Article

References (64)

1. Aardal K. Capacitated facility location: Separation algorithm and computational experience. Mathematical Programming 81 (1998) 149-175
2. Aardal K., Pochet Y., and Wolsey L.A. Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research 20 (1995) 552-582
3. Achterberg T., Koch T., and Martin A. Branching rules revisited. Operations Research Letters 33 (2005) 42-54
4. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: Column generation for solving huge integer programs. Operations Research 46 (1998) 316-329
5. Beasley J.E. An algorithm for solving large capacitated warehouse location problems. European Journal of Operational Research 33 (1988) 314-325
6. Beasley J.E. OR-library: Distributing test problems by electronic mail. The Journal of the Operational Research Society 41 (1990) 1069-1072
7. Beasley J.E. Lagrangean heuristics for location problems. European Journal of Operational Research 65 (1993) 383-399
8. Boffey T.B. Location problems arising in computer networks. The Journal of the Operational Research Society 40 (1989) 347-354
9. Carraresi P., Frangioni A., and Nonato M. Applying bundle methods to the optimization of polyhedral functions: An applications-oriented development. Ricerca Operativa 25 (1995) 5-49
10. Chardaire P. Hierarchical two level location problems. In: Sansò B., and Soriano P. (Eds). Telecommunications Network Planning (1999), Kluwer Academic Publishers Group, London, Dordrecht, Boston 33-54 (Chapter 3)
11. Christofides N., and Beasley J.E. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem. European Journal of Operational Research 12 (1983) 19-28
12. Cornuejols G., Sridharan R., and Thizy J.-M. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50 (1991) 280-297
13. Cortinhal M.J., and Captivo M.E. Upper and lower bounds for the single source capacitated location problem. European Journal of Operational Research 151 (2003) 333-351
14. Dantzig G.B., and Wolfe P. Decomposition principle for linear programs. Operations Research 8 (1960) 101-111
15. Dantzig G.B., and Wolfe P. The decomposition algorithm for linear programs. Econometrica 29 (1961) 767-778
16. Delmaire H., Díaz J.A., and Fernández E. Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR, Canadian Journal of Operational Research and Information Processing 37 (1999) 194-225
17. Domschke W., and Drexl A. ADD-heuristics' starting procedures for capacitated plant location models. European Journal of Operational Research 21 (1985) 47-53
18. Dongarra, J.J., 2005. Performance of various computers using standard linear equations software. Technical Report CS-89-95, Computer Science Department, University of Tennessee. Available from: http://www.netlib.org/benchmark/performance.pdf.
19. du Merle O., Villeneuve D., Desrosiers J., and Hansen P. Stabilized column generation. Discrete Mathematics 194 (1999) 229-237
20. Frangioni A., and Gallo G. A bundle type dual-ascent approach to linear multi-commodity min cost flow problems. Informs Journal on Computing 11 (1999) 370-393
21. Garfinkel R.S., Neebe A.W., and Rao M.R. An algorithm for the M-median plant location problem. Transportation Science 8 (1974) 848-856
22. Geoffrion A.M., and McBride R. Lagrangean relaxation to capacitated facility location problems. AIIE Transactions 10 (1978) 40-47
23. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859
24. Goffin J.-L., and Vial J.-P. Convex nondifferentiable optimization: A survey focussed on the analytic center cutting plane method. Optimization Methods & Software 17 (2002) 805-867
25. Goffin J.-L., Haurie A., and Vial J.-P. Decomposition and nondifferentiable optimization with the projective algorithm. Management Science 38 (1992) 284-302
26. Goffin J.-L., Haurie A., Vial J.-P., and Zhu D.L. Using central prices in the decomposition of linear programs. European Journal of Operational Research 64 (1993) 409-593
27. Gondzio, J., Sarkissian, R. 1996. Column generation with a primal-dual method. Technical Report 1996:6, LogiLab, HEC, Section of Management Studies, University of Geneva. Available from: .
28. Görtz, S., Klose, A. 2004. Das kapazitierte Standortproblem: Branch-and-Price und die Wahl der Verzweigungsvariable. Arbeitspapier, Bergische Universität Wuppertal, Fachbereich Wirtschafts- und Sozialwissenschaften.
29. Guignard, M., Zhu, S. 1994. A two-phase dual algorithm for solving Lagrangean duals in mixed integer programming. Report 94-10-03, Operations and Information Management Department, University of Pennsylvania, The Wharton School.
30. ILOG 2002. CPLEX 8.0. User's manual.
31. Jacobsen S.K. Heuristics for the capacitated plant location model. European Journal of Operational Research 12 (1983) 253-261
32. Khumawala B.M. An efficient heuristic procedure for the capacitated warehouse location problem. Naval Research Logistics Quarterly 21 (1974) 609-623
33. Klose A., and Drexl A. Combinatorial optimization problems of the assignment type and a partitioning approach. In: Klose A., Van Wassenhove L.N., and Speranza M.G. (Eds). Quantitative Approaches to Distribution Logistics and Supply Chain Management. Lecture Notes in Economics and Mathematical Systems vol. 519 (2002), Springer-Verlag, Berlin, Heidelberg, New York 215-245
34. Klose, A., Drexl, A., 2002b. A partitioning and column generation approach for the capacitated facility location problem. Technical Report, University of St. Gallen.
35. Klose A., and Drexl A. Lower bounds for the capacitated facility location problem based on column generation. Management Science 51 (2005) 1689-1705
36. Kochmann G.A., and McCallum C.J. Facility location models for planning a transatlantic communications network. European Journal of Operational Research 6 (1981) 205-211
37. Korupolu, M.R., Plaxton, C.G., Rajaraman, R. 1998. Analysis of a local search heuristic for facility location problems. Technical Report 98-30, DIMACS, Rutgers University.
38. Kuehn A.A., and Hamburger M.J. A heuristic program for locating warehouses. Management Science 9 (1963) 643-666
39. Lemaréchal C. Nondifferentiable optimization. In: Nemhauser G.L., Rinnooy Kan A.H.G., and Todd M.J. (Eds). Optimization. Handbooks in Operations Research and Management Science vol. 1 (1989), North-Holland, Amsterdam 529-572
40. Leung J.M.Y., and Magnanti T.L. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44 (1989) 271-291
41. Linderoth J.T., and Savelsbergh M.W.P. A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing 11 (1999) 173-187
42. Lorena L.A.N., and Senne E.L.F. A column generation approach to capacitated p-median. Computers & Operations Research 31 (2004) 863-876
43. Magnanti T.L., and Wong R.T. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29 (1981) 464-484
44. Marsten R.E., Hogan W.W., and Blankenship J.W. The Boxstep method for large-scale optimization. Operations Research 23 (1975) 389-405
45. Martello S., Pisinger D., and Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45 (1999) 414-424
46. Martin R.K. Large Scale Linear and Integer Optimization (1998), Kluwer Academic Publishers Group, London, Dordrecht, Boston
47. Martinson R.K., and Tind J. An interior point method in Dantzig-Wolfe decomposition. Computers & Operations Research 26 (1999) 1195-1216
48. Mateus G.R., and Bornstein C.T. Dominance criteria for the capacitated warehouse location problem. The Journal of the Operational Research Society 42 (1991) 145-149
49. Mirzaian A. Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks 15 (1985) 1-20
50. Nauss R.M. An improved algorithm for the capacitated facility location problem. The Journal of the Operational Research Society 29 (1978) 1195-1201
51. Neebe A.W., and Rao M.R. An algorithm for the fixed-charge assigning users to sources problem. The Journal of the Operational Research Society 34 (1983) 1107-1113
52. Pirkul H. Efficient algorithms for the capacitated concentrator location problem. Computers & Operations Research 14 (1987) 197-208
53. Pochet Y., and Wolsey L.A. Lot-size models with backlogging: Strong reformulations and cutting planes. Mathematical Programming 40 (1988) 317-335
54. Rolland E., Schilling D.A., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 (1996) 329-342
55. Russell R.M. The Cray-1 computer system. Communications of the ACM 21 (1978) 63-72
56. Ryu, C., 1993. Capacity-oriented planning and scheduling in production and distributions systems. Ph.D. thesis, Department of Operations and Information Management, University of Pennsylvania, Philadelphia, PA.
57. Ryu, C., Guignard, M., 1992. An efficient algorithm for the capacitated plant location problem. Working Paper 92-11-02, Decision Sciences Department, University of Pennsylvania, The Wharton School.
58. Senne E.L.F., Lorena L.A.N., and Pereira M.A. A branch-and-price approach to p-median location problems. Computers & Operations Research 32 (2005) 1655-1664
59. Shetty B. Approximate solutions to large scale capacitated facility location problems. Applied Mathematics and Computation 39 (1990) 159-175
60. Shmoys, D.B., Tardos, E., Aardal, K., 1997. Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265-274.
61. Sridharan R. A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research 66 (1993) 305-312
62. Van Roy T.J. A cross decomposition algorithm for capacitated facility location. Operations Research 34 (1986) 145-163
63. Wentges P. Accelerating Benders' decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research 44 (1996) 267-290
64. Wentges P. Weighted Dantzig-Wolfe decomposition for linear mixed-integer programming. International Transactions in Operational Research 4 (1997) 151-162