Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities

References

• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Barcelo J, Hallefjord Å, 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.Crossref, Google Scholar
• Beasley JE (1993) Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3):383–399.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur. J. Oper. Res. 147(3):451–463.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Chardaire P, Sutter M-C, Costa A (1996) Solving the dynamic facility location problem. Networks 28(2):117–124.Crossref, Google Scholar
• 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.Link, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011) The dynamic uncapacitated hub location problem. Transportation Sci. 45(1):18–32.Link, Google Scholar
• Correia I, Captivo ME (2003) A Lagrangean heuristic for a modular capacitated location problem. Ann. Oper. Res. 122(1):141–161.Crossref, Google Scholar
• Correia I, Captivo EM (2006) Bounds for the single source modular capacitated plant location problem. Comput. Oper. Res. 33(10):2991–3003.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Dias J, Captivo ME, Clímaco J (2006) Capacitated dynamic location problems with opening, closure and reopening of facilities. IMA J. Management Math. 17(4):317–348.Crossref, Google Scholar
• Dias J, Captivo ME, Clímaco J (2007) Dynamic location problems with discrete epansion and reduction sizes of available capacities. Investigação Operacional 27(2):107–130.Google Scholar
• Elhedhli S, Wu H (2010) A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J. Comput. 22(2):282–296.Link, Google Scholar
• Fleischmann B, Ferber S, Henrich P (2006) Strategic planning of BMW’s global production network. Interfaces 36(3):194–208.Link, Google Scholar
• Frangioni A (2005) About Lagrangian methods in integer optimization. Ann. Oper. Res. 139(1):163–193.Crossref, Google Scholar
• 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.Link, Google Scholar
• Frangioni A, Gorgone E (2014) Bundle methods for sum-functions with “easy” components: Applications to multicommodity network design. Math. Programming 145(1):133–161.Crossref, Google Scholar
• Gendron B (2011) Decomposition methods for network design. Procedia—Soc. Behav. Sci. 20:31–37.Crossref, Google Scholar
• Gendron B, Larose M (2014) Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2(1):55–75.Crossref, Google Scholar
• Geoffrion AM (1974) Lagrangean relaxation for integer programming. Balinski ML, ed. Approaches to Integer Programming (Springer, Berlin), 82–114.Crossref, Google Scholar
• Görtz S, Klose A (2012) A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS J. Comput. 24(4):597–610.Link, Google Scholar
• Held M, Wolfe P, Crowder HP (1974) Validation of subgradient optimization. Math. Programming 6(1):62–88.Crossref, Google Scholar
• Hinojosa Y, Puerto J, Fernández FR (2000) A multiperiod two-echelon multicommodity capacitated plant location problem. Eur. J. Oper. Res. 123(2):271–291.Crossref, Google Scholar
• Hinojosa Y, Kalcsics J, Nickel S, Puerto J, Velten S (2008) Dynamic supply chain design with inventory. Comput. Oper. Res. 35(2):373–391.Crossref, Google Scholar
• Holmberg K, Ling J (1997) A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. 97(1):63–74.Crossref, Google Scholar
• Holmberg K, Yuan D (2000) A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48(3):461–481.Link, Google Scholar
• Jacobsen SK (1990) Multiperiod capacitated location models. Mirchandani PB, Francis RL, eds. Discrete Location Theory, Chap. 4 (John Wiley & Sons, New York), 173–208.Google Scholar
• Jena SD, Cordeau J-F, Gendron B (2015a) Dynamic facility location with generalized modular capacities. Transportation Sci. 49(3):484–499.Link, Google Scholar
• Jena SD, Cordeau J-F, Gendron B (2015b) Modeling and solving a logging camp location problem. Ann. Oper. Res. 232(1):151–177.Google Scholar
• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Luss H (1982) Operations research and capacity expansion problems: A survey. Oper. Res. 30(5):907–947.Link, Google Scholar
• Melo MT, Nickel S, Saldanha-da Gama F (2006) Dynamic multi-commodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33(1):181–208.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Padberg MW, Van Roy TJ, Wolsey LA (1985) Valid linear inequalities for fixed charge problems. Oper. Res. 33(4):842–861.Link, Google Scholar
• Peeters D, Antunes AP (2001) On solving complex multi-period location models using simulated annealing. Eur. J. Oper. Res. 130(1):190–201.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Shulman A (1991) An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Oper. Res. 39(3):423–436.Link, Google Scholar
• Smith HK, Laporte G, Harper PR (2009) Locational analysis: Highlights of growth to maturity. J. Oper. Res. Soc. 60(Suppl. 1):S140–S148.Crossref, Google Scholar
• Sridharan R (1991) A Lagrangian heuristic for the capacitated plant location problem with side constraints. J. Oper. Res. Soc. 42(7):579–585.Crossref, Google Scholar
• Sridharan R (1995) The capacitated plant location problem. Eur. J. Oper. Res. 87(2):203–213.Crossref, Google Scholar
• Thomas DJ, Griffin PM (1996) Coordinated supply chain management. Eur. J. Oper. Res. 94(1):1–15.Crossref, Google Scholar
• Troncoso J, Garrido R (2005) Forestry production and logistics planning: An analysis using mixed-integer programming. Forest Policy Econom. 7(4):625–633.Crossref, Google Scholar
• Wu L, Zhang X, Zhang J (2006) Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33(5):1226–1241.Crossref, Google Scholar