Abstract
The Multi-period Incremental Service Facility Location Problem, which was recently introduced, is a strategic problem for timing the location of facilities and the assignment of customers to facilities in a multi-period environment. Aiming at finding the strongest formulation for this problem, in this work we study three alternative formulations based on the so-called impulse variables and step variables. To this end, an extensive computational comparison is performed. As a conclusion, the hybrid impulse–step formulation provides better computational results than any of the other two formulations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albareda-Sambola M, Fernández E, Hinojosa Y, Puerto J (2009) The multi-period incremental service facility location problem. Comput Oper Res 36:1356–1375
Alonso-Ayuso A, Escudero LF, Ortuño MT (2003) BFC, a Branch-and-Fix Coordination algorithmic framework for solving stochastic 0–1 programs. Eur J Oper Res 151:503–519
Andreatta G, Mason FM (1994) A note on a perfect forward procedure for a single facility dynamic location/relocation problem. Oper Res Lett 15:81–83
Antunes A, Peeters D (2001) On solving complex multi-period location models using simulated annealing. Eur J Oper Res 130:190–201
Ballou R (1968) Dynamic warehouse location analysis. J Mark Res 5:271–276
Bastian M, Volkmer M (1992) A perfect forward procedure for a single facility dynamic location/relocation problem. Oper Res Lett 12:11–16
Bertsimas D, Stock-Patterson S (1998) The air traffic flow management problem with enroute capacities. Oper Res 46:406–422
Chardaire P, Sutter A, Costa M (1996) Solving the dynamic facility location problem. Networks 28:117–124
Drezner Z (1995) Dynamic facility location: the progressive p-median problem. Location Sci 3:1–7
Drezner Z, Wesowlosky GO (1991) Facility location when demand is time dependent. Nav Res Logist 38:763–777
Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992–1009
Erlenkotter D (1981) A comparative study of approaches to dynamic location problems. Eur J Oper Res 6:133–143
Fong CO, Srinivasan V (1981) The multiregion dynamic capacity expansion problem. Parts I and II. Oper Res 29:787–816
Fong CO, Srinivasan V (1986) The multiregion dynamic capacity expansion problem: an improved heuristic. Manage Sci 32:1140–1152
Frantzeskakis M, Watson-Gandy CDT (1989) The use of state space relaxation for the dynamic facility location problem. Ann Oper Res 18:189–212
Galvão RD, Santibañez-Gonzalez ER (1990) The p k -median dynamic location problem: formulation and a heuristic solution method. Invest Oper 1:295–308
Galvão RD, Santibañez-Gonzalez ER (1992) A Lagrangian heuristic for the p k -median dynamic location problem. Eur J Oper Res 58:250–262
Hinojosa Y, Puerto J, Fernández FR (2000) A multiperiod two-echelon multicommodity capacitated plant location problem. Eur J Oper Res 123:45–65
Hinojosa Y, Kalcsics J, Nickel S, Puerto J, Velten S (2008) Dynamic supply chain design with inventory. Comput Oper Res 35(2):373–391
Jacobsen SK (1977) Heuristic procedures for dynamic plant location. Technical report, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark
Kelly D, Marucheck AS (1984) Planning horizon results for the dynamic warehouse location problem. J Oper Manag 4:279–294
Khumawala BM, Whybark DC (1976) Solving the dynamic warehouse location problem. Int J Prod Res 6:238–251
Lee SB, Luss H (1987) Multifacility-type capacity expansion planning: algorithms and complexities. Oper Res 35:249–153
Lodish LM (1970) Computational limitations of dynamic programming for warehouse location. J Mark Res 7:262–263
Melachrinoudis E, Min H, Wu X (1995) A multiobjective model for the dynamic location of landfills. Location Sci 3:143–166
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–208
Rosenblatt MJ (1986) The dynamics of plant layout. Manag Sci 32:76–86
Saldanha da Gama F, Captivo ME (1998) A heuristic approach for the discrete dynamic location problem. Location Sci 6:211–223
Scott AJ (1971) Dynamic location–allocation systems: some basic planning strategies. Environ Plan 3:73–82
Shulman A (1991) An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Oper Res 39:423–436
Sweeney DJ, Tatham RL (1976) An improved long-run model for multiple warehouse location. Manag Sci 22:748–758
van Roy TJ, Erlenkotter D (1982) A dual-based procedure for dynamic facility location. Manag Sci 28:1091–1105
Warszawski A (1973) Multi-dimensional location problems. Oper Res Q 24:165–179
Wesolowsky GO (1973) Dynamic facility location. Manag Sci 19:1241–1248
Wesolowsky GO, Truscott WG (1975) The multiperiod facility location–allocation problem with relocation of facilities. Manag Sci 22:57–65
Author information
Authors and Affiliations
Corresponding author
Additional information
This work has been partially supported by the grants MTM2006-14961-C05, SEC2002-00112, MTM2004-01095, and MTM2007-67433-C02-01 from the Spanish Ministry of Education and Science, and URJC-CM-2007-CET-1622 and URJC-CM-2008-CET-3703, Spain.
Rights and permissions
About this article
Cite this article
Albareda-Sambola, M., Alonso-Ayuso, A., Escudero, L.F. et al. A computational comparison of several formulations for the multi-period incremental service facility location problem. TOP 18, 62–80 (2010). https://doi.org/10.1007/s11750-009-0106-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-009-0106-3