A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations

OR Spectrum

Volumn 33, Issue 4, 2011, Pages 989-1007

  Amrani, Houssam ^a   Martel, Alain ^a   Zufferey, Nicolas ^b   Makeeva, Polina ^c  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF GENEVA   (Switzerland)

^c EPFL   (Switzerland)

Author keywords

Facilities configuration; Location allocation problem; Production distribution networks; Tabu search; Variable neighborhood search

Indexed keywords

EID: 80053052422     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-009-0182-7     Document Type: Article

References (44)

1. Ahuja RK, Orlin JB, Pallattino S, Scaparra MP, Scutellà MG (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Manage Sci 50(6): 749-760.
2. Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to uncapacitated facility location problem. Ann Oper Res 86: 91-103.
3. Ambrosino D, Scutellà MG (2005) Distribution network design: new problems and related models. Eur J Oper Res 165: 610-624.
4. Amiri A (2006) Designing a distribution network in a supply chain system: Formulation and efficient solution procedure. Eur J Oper Res 171: 567-576.
5. Ballou RH (1992) Business logistics management, 3rd edn. Prentice Hall, New Jersey.
6. Balinski M (1961) Fixed-cost transportation problems. Naval Res Logist Q 8: 41-54.
7. Barahona F, Chudak FA (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2: 35-50.
8. Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65: 383-399.
9. Bornstein CT, Campêlo M (2004) An ADD/DROP procedure for the capacitated plant location problem. Pesquisa Operacional 24(1): 151-162.
10. Cooke J (2007) Weaving 2 supply chains together. CSCMP's Supply Chain Q 3: 34-38.
11. Crainic TG, Gendreau M, Soriano P, Toulouse M (1993) A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann Oper Res 41: 359-383.
12. Delmaire H, Diaz JA, Fernandez E, Ortega M (1999) Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37(3): 194-225.
13. Elson DG (1972) Site location via mixed-integer programming. Oper Res Q 23(1): 31-43.
14. Eppen G, Kipp Martin R, Schrage L (1989) A scenario approach to capacity planning. Oper Res 37: 517-527.
15. Fisher ML, Jaikumar R, van Wassenhove L (1986) A multiplier adjustment method for the generalized assignment problem. Manage Sci 32: 1095-1103.
16. Fleischmann B (1993) Designing distribution systems with transport economies of scale. Eur J Oper Res 70: 31-42.
17. Gendron B, Potvin JY, Soriano P (2003) A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Ann Oper Res 122: 193-217.
18. Geoffrion A, Graves G (1974) Multicommodity distribution system design by benders decomposition. Manage Sci 20: 822-844.
19. Glover F (1986) Future paths for integer programming and linkage to artificial intelligence. Comput Oper Res 13: 533-549.
20. Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston.
21. Hansen P (1986) The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on numerical methods in combinatorial optimization, Capri, Italy.
22. Hindi KS, Basta T (1994) Computationally efficient solution of a multiproduct, two-stage distribution-location problem. J Oper Res Soc 45(11): 1316-1323.
23. Hindi KS, Basta T, Pienakosz K (1998) Efficient solution of a multi-commodity, two-stage distribution problem with constraints on assignment of customers to distribution centers. Int Trans Oper Res 5(6): 519-527.
24. Jacobsen SK (1983) Heuristics for the capacitated plant location model. Eur J Oper Res 12: 253-261.
25. Kaufman L, Vanden Eede M, Hansen P (1997) A Plant and Warehouse Location Problem. Oper Res Q 28(3): 547-554.
26. Kelly DL, Khumawala BM (1982) Capacitated warehouse location with concave costs. J Oper Res Soc 33: 817-826.
27. Klose A (1999) An LP-based heuristic for two-stage capacitated facility location problems. J Oper Res Soc 50(2): 157-166.
28. Klose A (2000) A Lagrangean relax-and-cut approach for two-stage capacitated facility location problem. Eur J Oper Res 126: 408-421.
29. Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162: 4-29.
30. Kratica J, Tosic D, Filipovic V, Ljubic I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper Res 85: 127-142.
31. Kuenh AA, Hamberger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9(4): 643-666.
32. Martel A, Vankatadri U (1999) Optimizing supply network structures under economies of scale. In: IEPM Conference Proceedings, Glasgow, Book 1, pp 56-65.
33. Martel A (2003) Généralisations du modèle d'optimisation d'un réseau de ravitaillement. Document de formation DF-2. 4. 2, CIRRELT, Université Laval, Canada.
34. Martel A (2005) The design of production-distribution networks: a mathematical programming approach. In: Geunes J, Pardalos PM (eds) Supply chain optimization. Springer, Berlin, pp 265-306.
35. Michel L, van Hentenryck P (2004) A simple tabu search for warehouse location. Eur J Oper Res 157: 576-591.
36. Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097-1100.
37. Paquet M, Martel A, Desaulniers G (2004) Including technology selection decisions in manufacturing network design models. Int J Comput Integr Manuf 17: 117-125.
38. Pirkul H, Jayaraman V (1996) Production, transportation, and distribution planning in a multi-commodity tri-echelon system. Transp Sci 30(4): 291-302.
39. Pirkul H, Jayaraman V (1998) Multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Comput Oper Res 25(10): 869-878.
40. ReVelle C, Eiselt H, Daskin M (2008) A bibliography for some fundamental problem categories in discrete location science. Eur J Oper Res 184: 817-848.
41. Soland RM (1974) Optimal plant location with concave costs. Oper Res 22: 373-382.
42. Sörensen K (2002) A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. Ph. D. Thesis, Faculteit Toegepaste Economische Wentenschappen, Universiteit Antwerpen, Belgium.
43. Verter V, Dincer C (1995) Facility location and capacity acquisition: an integrated approach. Nav Res Logistics 42: 1141-1160.
44. Zhang J, Chen B, Ye Y (2005) A multi-exchange local search algorithm for the capacitated facility location problem. Math Oper Res 30(2): 389-403.