Abstract
In this paper we introduce the Single Period Coverage Facility Location Problem. It is a multi-period discrete location problem in which each customer is serviced in exactly one period of the planning horizon. The locational decisions are made independently for each period, so that the facilities that are open need not be the same in different time periods. It is also assumed that at each period there is a minimum number of customers that can be assigned to the facilities that are open. The decisions to be made include not only the facilities to open at each time period and the time period in which each customer will be served, but also the allocation of customers to open facilities in their service period.
We propose two alternative formulations that use different sets of decision variables. We prove that in the first formulation the coefficient matrix of the allocation subproblem that results when fixing the facilities to open at each time period is totally unimodular. On the other hand, we also show that the pricing problem of the second model can be solved by inspection. We prove that a Lagrangean relaxation of the first one yields the same lower bound as the LP relaxation of the second one. While the Lagrangean dual can be solved with a classical subgradient optimization algorithm, the LP relaxation requires the use of column generation, given the large number of variables of the second model. We compare the computational burden for obtaining this lower bound through both models.
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(5):1356–1375
Chardaire P, Sutter A, Costa MC (1996) Solving the dynamic facility location problem. Networks 28:117–124
Cornuejols G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 119–171
Correia I, Gouveia L, Saldanha da Gama F (2008) Solving the variable size bin packing problem with discretized formulations. Comput Oper Res 35(6):2103–2113
Cortinhal MJ, Captivo ME (2003) Upper and lower bounds for the single source capacitated location problem. Eur J Oper Res 151(2):333–351
Current J, Ratick S, ReVelle C (1997) Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach. Eur J Oper Res 110:597–609
Daskin MS, Hopp WJ, Medina B (1992) Forecast horizons and dynamic facility location planning. Ann Oper Res 40:125–152
Drezner Z (1995) Dynamic facility location: the progressive p-median problem. Location Sci 3:1–7
Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109–133
Galvão RD, Santibañez-González ER (1992) A Lagrangean heuristic for the p k -median dynamic location problem. Eur J Oper Res 58:250–262
Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math Program Study 2:82–114
Guignard M (2003) Lagrangean relaxation. TOP 11(2):151–228
Hinojosa Y, Puerto J, Fernández FR (2000) A multiperiod two-echelon multicommodity capacitated plant location problem. Eur J Oper Res 123(2):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
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
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
Mirchandani PB, Francis RL (eds) (1990) Discrete location theory. Wiley, New York
Sridharan R (1995) The capacitated plant location problem. Eur J Oper Res 87(2):203–213
van Roy TJ, Erlenkotter D (1982) A dual-based procedure for dynamic facility location. Manag Sci 28(10):1091–1105
Warszawski A (1973) Multi-dimensional location problems. Oper Res Q 24:165–179
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Albareda-Sambola, M., Fernández, E., Hinojosa, Y. et al. The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches. TOP 18, 43–61 (2010). https://doi.org/10.1007/s11750-009-0102-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-009-0102-7