Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities

INFORMS Journal on Computing

Volumn 29, Issue 3, 2017, Pages 388-404

  Jena, Sanjay Dominik ^a   Cordeau, Jean François ^b   Gendron, Bernard ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Dynamic facility location; Lagrangian heuristics; Mixed integer programming; Modular capacities

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LOCATION; SITE SELECTION;

COMPUTATIONAL RESULTS; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; LAGRANGIAN HEURISTICS; LARGE-SCALE DYNAMICS; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING (MIP); MODULAR CAPACITIES;

PLANT SHUTDOWNS;

EID: 85025475789     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2016.0738     Document Type: Article

References (50)

1. Agar MC, Salhi S (1998) Lagrangean heuristics applied to a variety of large capacitated plant location problems. J. Oper. Res. Soc. 49(10):1072-1084.
2. Arostegui MA, Kadipasaoglu SN, Khumawala BM (2006) An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. Internat. J. Production Econom. 103(2):742-754.
3. Barcelo J, Hallefjord O, Fernandez E, Jörnsten K (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR Spektrum 12(2):79-88.
4. Beasley JE (1993) Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3):383-399.
5. Borghetti A, Frangioni A, Lacalandra F, Nucci CA (2003) Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Trans. Power Systems 18(1):313-323.
6. Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur. J. Oper. Res. 147(3):451-463.
7. Canel C, Khumawala BM, Law J, Loh A (2001) An algorithm for the capacitated, multi-commodity multi-period facility location problem. Comput. Oper. Res. 28(5):411-427.
8. Chardaire P, Sutter M-C, Costa A (1996) Solving the dynamic facility location problem. Networks 28(2):117-124.
9. Chouman M, Crainic TG, Gendron B (2016) Commodity representations and cut-set-based inequalities for multicommodity capacitated fixed-charge network design. Transportation Sci., ePub ahead of print July 27, http://dx.doi.org/10.1287/trsc.2015.0665.
10. Contreras I, Cordeau J-F, Laporte G (2011) The dynamic uncapacitated hub location problem. Transportation Sci. 45(1):18-32.
11. Correia I, Captivo ME (2003) A Lagrangean heuristic for a modular capacitated location problem. Ann. Oper. Res. 122(1): 141-161.
12. Correia I, Captivo EM (2006) Bounds for the single source modular capacitated plant location problem. Comput. Oper. Res. 33(10):2991-3003.
13. Diabat A, Richard J-P, Codrington CW (2011) A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design. Ann. Oper. Res. 203(1):55-80.
14. Dias J, Captivo ME, Clamaco J (2006) Capacitated dynamic location problems with opening, closure and reopening of facilities. IMA J. Management Math. 17(4):317-348.
15. Dias J, Captivo ME, Clamaco J (2007) Dynamic location problems with discrete epansion and reduction sizes of available capacities. Investigação Operacional 27(2):107-130.
16. Elhedhli S, Wu H (2010) A Lagrangean heuristic for hub-andspoke system design with capacity selection and congestion. INFORMS J. Comput. 22(2):282-296.
17. Fleischmann B, Ferber S, Henrich P (2006) Strategic planning of BMW's global production network. Interfaces 36(3):194-208.
18. Frangioni A (2005) About Lagrangian methods in integer optimization. Ann. Oper. Res. 139(1):163-193.
19. Frangioni A, Gallo G (1999) A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS J. Comput. 11(4):370-393.
20. Frangioni A, Gorgone E (2014) Bundle methods for sum-functions with "easy" components: Applications to multicommodity network design. Math. Programming 145(1):133-161.
21. Gendron B (2011) Decomposition methods for network design. Procedia-Soc. Behav. Sci. 20:31-37.
22. Gendron B, Larose M (2014) Branch-and-price-and-cut for largescale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2(1):55-75.
23. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Balinski ML, ed. Approaches to Integer Programming (Springer, Berlin), 82-114.
24. Görtz S, Klose A (2012) A simple but usually fast branch-andbound algorithm for the capacitated facility location problem. INFORMS J. Comput. 24(4):597-610.
25. Held M,Wolfe P, Crowder HP (1974) Validation of subgradient optimization. Math. Programming 6(1):62-88.
26. Hinojosa Y, Puerto J, Fernández FR (2000)Amultiperiod two-echelon multicommodity capacitated plant location problem. Eur. J. Oper. Res. 123(2):271-291.
27. Hinojosa Y, Kalcsics J, Nickel S, Puerto J, Velten S (2008) Dynamic supply chain design with inventory. Comput. Oper. Res. 35(2):373-391.
28. Holmberg K, Ling J (1997) A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. 97(1): 63-74.
29. Holmberg K, Yuan D (2000) A Lagrangian heuristic based branchand-bound approach for the capacitated network design problem. Oper. Res. 48(3):461-481.
30. Jacobsen SK (1990) Multiperiod capacitated location models. Mirchandani PB, Francis RL, eds. Discrete Location Theory, Chap. 4 (John Wiley & Sons, New York), 173-208.
31. Jena SD, Cordeau J-F, Gendron B (2015a) Dynamic facility location with generalized modular capacities. Transportation Sci. 49(3):484-499.
32. Jena SD, Cordeau J-F, Gendron B (2015b) Modeling and solving a logging camp location problem. Ann. Oper. Res. 232(1): 151-177.
33. Jena SD, Cordeau J-F, Gendron B (2016) Solving a dynamic facility location problem with partial closing and reopening. Comput. Oper. Res. 67:143-154.
34. Kim D-G, Kim Y-D (2013) A Lagrangian heuristic algorithm for a public healthcare facility location problem. Ann. Oper. Res. 206(1):221-240.
35. Lee D-H, Dong M (2008) A heuristic approach to logistics network design for end-of-lease computer products recovery. Transportation Res. Part E: Logist. Transportation Rev. 44(3):455-474.
36. Li J, Chu F, Prins C (2009) Lower and upper bounds for a capacitated plant location problem with multicommodity flow. Comput. Oper. Res. 36(11):3019-3030.
37. Luss H (1982) Operations research and capacity expansion problems: A survey. Oper. Res. 30(5):907-947.
38. Melo MT, Nickel S, Saldanha-da Gama F (2006) Dynamic multicommodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33(1):181-208.
39. Melo MT, Nickel S, Saldanha-da Gama F (2009) Facility location and supply chain management-A review. Eur. J. Oper. Res. 196(2):401-412.
40. Melo MT, Nickel S, Saldanha-da Gama F (2011) A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon. Internat. J. Production Econom. 136(1): 218-230.
41. PadbergMW, Van Roy TJ,Wolsey LA (1985) Valid linear inequalities for fixed charge problems. Oper. Res. 33(4):842-861.
42. Peeters D, Antunes AP (2001) On solving complex multi-period location models using simulated annealing. Eur. J. Oper. Res. 130(1):190-201.
43. Revelle C, Eiselt H, Daskin MS (2008) A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184(3):817-848.
44. Shulman A (1991) An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Oper. Res. 39(3):423-436.
45. Smith HK, Laporte G, Harper PR (2009) Locational analysis: Highlights of growth to maturity. J. Oper. Res. Soc. 60(Suppl. 1): S140-S148.
46. Sridharan R (1991) A Lagrangian heuristic for the capacitated plant location problem with side constraints. J. Oper. Res. Soc. 42(7):579-585.
47. Sridharan R (1995) The capacitated plant location problem. Eur. J. Oper. Res. 87(2):203-213.
48. Thomas DJ, Griffin PM (1996) Coordinated supply chain management. Eur. J. Oper. Res. 94(1):1-15.
49. Troncoso J, Garrido R (2005) Forestry production and logistics planning: An analysis using mixed-integer programming. Forest Policy Econom. 7(4):625-633.
50. Wu L, Zhang X, Zhang J (2006) Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33(5):1226-1241.