Lower and upper bounds for a capacitated plant location problem with multicommodity flow

Computers and Operations Research

Volumn 36, Issue 11, 2009, Pages 3019-3030

  Li, Jinfeng ^a   Chu, Feng ^a   Prins, Christian ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Lagrangean relaxation; Location; Multicommodity flow; Tabu search

Indexed keywords

COMPUTATIONAL RESULTS; FLOW DISTRIBUTIONS; LAGRANGEAN HEURISTIC; LAGRANGEAN RELAXATION; LOCATION PROBLEMS; LOWER AND UPPER BOUNDS; MULTICOMMODITY FLOW; PLANT LOCATIONS; PLANT SITES; SOLUTION METHODS; SUB-GRADIENT OPTIMIZATIONS; UPPER AND LOWER BOUNDS; UPPER BOUNDS;

CONTROL THEORY; HEURISTIC METHODS; LOCATION; STRATEGIC PLANNING;

TABU SEARCH;

EID: 64549134183     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.012     Document Type: Article

References (39)

1. Geoffrion A.M., and McBride R. Lagrangean relaxation applied to capacitated facility location problems. AIIE Transactions 10 1 (1978) 40-47
2. Domschke W., and Drexl A. ADD-heuristics' starting procedures for capacitated plant location models. European Journal of Operational research 21 1 (1985) 47-53
3. Akinc U., and Khumawala B.M. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Sciences 23 6 (1977) 585-594
4. Klose A., and Görtz S. A branch-and-price algorithm for the capacitated facility location problem. European Journal of Operational Research 179 3 (2007) 1109-1125
5. Wentges P. Accelerating Benders' decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research 44 2 (1996) 267-290
6. Aardal K. Capacitated facility location: separation algorithm and computational experience. Mathematical Programming Series B 81 2 (1998) 149-175
7. Srivastava R., and Benton W.C. Location-routing problem: considerations in physical distribution system design. Computers & Operations Research 17 5 (1990) 427-435
8. Hansen P.H., Hegedahl B., Hjortkjær S., and Obel B. A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research 76 1 (1994) 111-127
9. Chan Y., Carter W.B., and Burnes M.D. A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers & Operations Research 28 8 (2001) 803-826
10. Wu T.H., Low C., and Bai J.W. Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research 29 10 (2002) 1393-1415
11. Prins C., Prodhon C., Ruiz A., Soriano P., and Wolfler Calvo R. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41 4 (2007) 470-483
12. Barreto S., Ferreira C., Paixão J., and Santos B.S. Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research 179 3 (2007) 968-977
13. Maranzana F.E. On the location of supply points to minimize transport costs. Operational Research Quarterly 15 3 (1964) 261-270
14. Berman O., Jaillet P., and Simchi-Levi D. Location-routing problems with uncertainty. In: Drezner Z. (Ed). Facility location: a survey of applications and methods (1995), Springer, New York 427-452
15. Nagy G., and Salhi S. Location-routing: issues, models and methods. European Journal of Operational Research 177 2 (2007) 649-672
16. Salhi S., and Nagy G. Consistency and robustness in location-routing. Studies in Location Analysis 13 (1999) 3-19
17. Keskin B.B., and Üster H. A scatter search-based heuristic to locate capacitated transshipment points. Computers & Operations Research 34 10 (2007) 3112-3125
18. Keskin B.B., and Üster H. Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem. European Journal of Operational Research 182 2 (2007) 663-682
19. Daskin MS, Hurter AP, Van Buer MG. Toward an integrated model of facility location and transportation network design. Working paper, The Transportation Center, Northwestern University, Evanston, IL, USA; 1993.
20. Melkote S., and Daskin M.S. An integrated model of facility location and transportation network design. Transportation Research Part A: Policy and Practice 35 6 (2001) 515-538
21. Melkote S., and Daskin M.S. Capacitated facility location/network design problems. European Journal of Operational Research 129 3 (2001) 481-495
22. Aardal K., Labbé M., Leung J., and Queyranne M. On the two-level uncapacitated facility location problem. INFORMS Journal on Computing 8 3 (1996) 289-301
23. Pirkul H., and Jayaraman V. A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Computers & Operations Research 25 10 (1998) 869-878
24. Jayaraman V., and Pirkul H. Planning and coordination of production and distribution facilities for multiple commodities. European Journal of Operational Research 133 2 (2001) 394-408
25. Pirkul H., and Jayaraman V. Production, transportation, and distribution planning in a multi-commodity tri-echelon system. Transportation Science 30 4 (1996) 291-302
26. Elhedhli S., and Coffin J.L. Efficient production-distribution system design. Management Science 51 7 (2005) 1151-1164
27. Crainic T.G., Dejax P., and Delorme L. Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research 18 1 (1989) 277-302
28. Gendron B., and Crainic T.G. A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Computers & Operations Research 24 9 (1997) 829-847
29. Gendron B., Potvin J.Y., and Soriano P. A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Annals of Operations Research 122 1-4 (2003) 193-217
30. Pisinger D. An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research 87 1 (1995) 175-187
31. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows (1993), Prentice-Hall, London
32. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13 5 (1986) 533-549
33. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, London
34. ILOG CPLEX, 2005.
35. Ali A, Kennington JL. Mnetgen program documentation. Technical Report 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas; 1977.
36. 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 3 (1991) 280-297
37. Pham D.T., and Karaboga D. Intelligent optimisation techniques (1999), Springer, New York
38. Lorena L.A.N., and Senne E.L.F. A column generation approach to capacitated p-median problems. Computers & Operations Research 31 6 (2004) 863-876
39. Frangioni A., and Gallo G. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS Journal on Computing 11 4 (1999) 370-393