Multi-Period Facility Location

Chapter

Abstract

In this chapter, we cover basic aspects related with facility location problems involving time dependent parameters. The emphasis is put on problems defined over a multi-period finite planning horizon. A brief overview of continuous and network problems is presented. Nevertheless, most of the chapter focus on a discrete setting. Basic modeling aspects and solution techniques are discussed. Additionally, some features of practical relevance are considered. The value of the multi-period solution is introduced as a measure for the relevance of considering a multi-period modeling framework instead of a static one. Current challenges and future trends on the topic are discussed.

Keywords

Discrete models Multi-period facility location Value of the multi-period solution 

References

  1. Aghezzaf E (2005) Capacity planning and warehouse location in supply chains with uncertain demands. J Oper Res Soc 56:453–462CrossRefGoogle Scholar
  2. Albareda-Sambola M, Fernández E, Hinojosa Y, Puerto J (2009) The multi-period incremental service facility location problem. Comput Oper Res 36:1356–1375CrossRefGoogle Scholar
  3. Albareda-Sambola M, Alonso-Ayuso A, Escudero LF, Fernández E, Hinojosa Y, Pizarro-Romero C (2010) A computational comparison of several formulations for the multi-period incremental service facility location problem. TOP 18:62–80CrossRefGoogle Scholar
  4. Albareda-Sambola M, Alonso-Ayuso A, Escudero LF, Fernández E, Pizarro C (2013) Fix-and-relax coordination for a multi-period location-allocation problem under uncertainty. Comput Oper Res 40:2878–2892CrossRefGoogle Scholar
  5. Alumur SA, Nickel S, Saldanha da Gama F, Verter V (2012) Multi-period reverse logistics network design. Eur J Oper Res 220:67–78CrossRefGoogle Scholar
  6. Antunes A, Peeters D (2001) On solving complex multi-period location models using simulated annealing. Eur J Oper Res 130:190–201CrossRefGoogle Scholar
  7. Arabani AB, Zanjirani Farahani R (2012) Facility location dynamics: an overview of classifications and applications. Comput Ind Eng 62:408–420CrossRefGoogle Scholar
  8. Ballou RH (1968) Dynamic warehouse location analysis. J Mark Res 5:271–276CrossRefGoogle Scholar
  9. Canel C, Khumawala BM (1997) Multi-period international facilities location: an algorithm and application. Int J Prod Res 35:1891–1910CrossRefGoogle Scholar
  10. Canel C, Khumawala BM (2001) International facilities location: a heuristic procedure for the dynamic uncapacitated problem. Int J Prod Res 39:3975–4000CrossRefGoogle Scholar
  11. 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:411–427CrossRefGoogle Scholar
  12. Cavalier TM, Sherali HD (1985) Sequential location-allocation problems on chains and trees with probabilistic link demands. Math Program 32:249–277CrossRefGoogle Scholar
  13. Chand S (1988) Decision/forecast horizon results for a single facility dynamic location/relocation problem. Oper Res Lett 7:247–251CrossRefGoogle Scholar
  14. Chardaire P, Sutter A, Costa M-C (1996) Solving the dynamic facility location problem. Networks 28:117–124CrossRefGoogle Scholar
  15. Daskin MS, Hopp WJ, Medina B (1992) Forecast horizons and dynamic facility location planning. Ann Oper Res 40:125–151CrossRefGoogle Scholar
  16. Dias J, Captivo ME, Clímaco J (2007) Efficient primal-dual heuristic for a dynamic location problem. Comput Oper Res 34:1800–1823CrossRefGoogle Scholar
  17. Dias J, Captivo ME, Clímaco J (2008) A memetic algorithm for multi-objective dynamic location problem. J Global Optim 42:221–253CrossRefGoogle Scholar
  18. Drezner Z (1995) Dynamic facility location: the progressive p-median problem. Locat Sci 3:1–7CrossRefGoogle Scholar
  19. Drezner Z, Wesolowsky GO (1991) Facility location when demand is time dependent. Nav Res Logist 38:763–777CrossRefGoogle Scholar
  20. Erlenkotter D (1981) A comparative study of approaches to dynamic location problems. Eur J Oper Res 6:133–143CrossRefGoogle Scholar
  21. Galvão RD, Santibañez-Gonzalez ER (1992) A Lagrangean heuristic for the p k-median dynamic location problem. Eur J Oper Res 58:250–262CrossRefGoogle Scholar
  22. Gourdin É, Klopfenstein O (2008) Multi-period capacitated location with modular equipments. Comput Oper Res 35:661–682CrossRefGoogle Scholar
  23. Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459CrossRefGoogle Scholar
  24. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475CrossRefGoogle Scholar
  25. Hakimi SL, Labbé M, Schmeichel EF (1999) Locations on time-varying networks. Networks 34:250–257CrossRefGoogle Scholar
  26. Hamacher HW, Nickel S (1998) Classification of location problems. Locat Sci 6:229–242CrossRefGoogle Scholar
  27. Hinojosa Y, Puerto J, Fernández FR (2000) A multiperiod two-echelon multicommodity capacitated plant location problem. Eur J Oper Res 123:271–291CrossRefGoogle Scholar
  28. Hinojosa Y, Kalcsics J, Nickel S, Puerto J, Velten S (2008) Dynamic supply chain design with inventory. Comput Oper Res 35:373–391CrossRefGoogle Scholar
  29. Hugo A, Pistikopoulos EN (2005) Environmentally conscious long-range planning and design of supply chain networks. J Clean Prod 13:1471–1491CrossRefGoogle Scholar
  30. Jena S, Cordeau J-F, Gendron B (2012) Modeling and solving a logging camp location problem. Ann Oper Res. doi: 10.1007/s10479-012-1278-zGoogle Scholar
  31. Jena S, Cordeau J-F, Gendron B (2014) Dynamic facility location with generalized modular capacity. Transp Sci. doi: 10.1287/trsc.2014.0575Google Scholar
  32. Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manag Sci 18:718–731CrossRefGoogle Scholar
  33. Lee S-B, Luss H (1987) Multifacility-type capacity expansion planning: algorithms and complexities. Oper Res 35:249–253CrossRefGoogle Scholar
  34. Manzini R, Gebennini E (2008) Optimization models for the dynamic facility location and allocation problem. Int J Prod Res 46:2061–2086CrossRefGoogle Scholar
  35. Melachrinoudis E, Min H (2007) Redesigning a warehouse network. Eur J Oper Res 176:210–229CrossRefGoogle Scholar
  36. 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:181–208CrossRefGoogle Scholar
  37. Melo MT, Nickel S, Saldanha da Gama F (2009) Facility location and supply chain management. Eur J Oper Res 196:401–412CrossRefGoogle Scholar
  38. Mesa J (1991) Multiperiod medians on networks. RAIRO - Rech Oper 25:87–95Google Scholar
  39. Nickel S, Saldanha da Gama F, Ziegler H-P (2012) A multi-stage stochastic supply network design problem with financial decisions and risk management. Omega 40:511–524CrossRefGoogle Scholar
  40. Orda A, Rom R (1991) Location of central nodes in time varying computer networks. Oper Res Lett 10:143–152CrossRefGoogle Scholar
  41. Puerto J, Rodríguez-Chía A (1999) Location of a moving service facility. Math Method Oper Res 49:373–393CrossRefGoogle Scholar
  42. Roodman GM, Schwarz LB (1975) Optimal and heuristic facility phase-out strategies. AIIE Trans 7:177–184CrossRefGoogle Scholar
  43. Roodman GM, Schwarz LB (1977) Extensions of the multi-period facility phase-out model: new procedures and application to a phase-in/phase-out problem. AIIE Trans 9:103–107CrossRefGoogle Scholar
  44. Saldanha da Gama F (2002) Modelos e algoritmos para o problema de localização dinâmina (in Portuguese). Ph.D. thesis, Faculty of science, University of Lisbon, PortugalGoogle Scholar
  45. Saldanha da Gama F, Captivo ME (1998) A heuristic approach for the discrete dynamic location problem. Locat Sci 6:211–223CrossRefGoogle Scholar
  46. Scott AJ (1971) Dynamic location-allocation systems: some basic planning strategies. Environ Plan 3:73–82CrossRefGoogle Scholar
  47. Shulman A (1991) An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Oper Res 39:423–436CrossRefGoogle Scholar
  48. Sweeney D, Tatham RL (1976) An improved long-run model for multiple warehouse location. Manag Sci 22:748–758CrossRefGoogle Scholar
  49. Van Roy T, Erlenkotter D (1982) A dual-based procedure for dynamic facility location. Manag Sci 28:1091–1105CrossRefGoogle Scholar
  50. Warszawski A (1973) Multi-dimensional location problems. Oper Res Q 24:165–179CrossRefGoogle Scholar
  51. Wesolowsky GO (1973) Dynamic facility location. Manag Sci 19:1241–1248CrossRefGoogle Scholar
  52. Wesolowsky GO, Truscott WG (1975) The multi-period location-allocation problem with relocation of facilities. Manag Sci 22:57–65CrossRefGoogle Scholar
  53. Zanjirani Farahani R, Drezner Z, Asgari N (2009) Single facility location and relocation problem with time dependent weights and discrete planning horizon. Ann Oper Res 167:353–368CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute for Operations ResearchKarlsruhe Institute of Technology (KIT)KarlsruheGermany
  2. 2.Fraunhofer Institute for Industrial Mathematics (ITWM)KaiserslauternGermany
  3. 3.Centro de Investigação Operacional/Departamento de Estatística e Investigação OperacionalFaculdade de Ciências da Universidade de LisboaLisbonPortugal

Personalised recommendations