This paper proposes a scenario-based ambulance location model which explicitly computes the availability of ambulances with stochastic call arrivals under a dispatching policy. The model utilizes two-stage stochastic programming to represent the temporal variations in call arrivals as a set of call arrival sequences. Constraints are embedded in the model to ensure that available ambulances are assigned to incoming calls following a dispatching policy. A logic-based Benders decomposition algorithm is presented to solve the model. The advantage of using our algorithm is demonstrated by comparing its performance with those of other location models.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
In a strict sense, the model of Carson and Batta (1990) is not a scenario planning model because the location decisions for each scenario are not linked.
Note that unlike a probabilistic location model our model does not utilize the busy fraction to compute a location solution. They are only implicit in the model.
Aboueljinane L, Sahin E, Jemai Z (2013) A review on simulation models applied to emergency medical service operations. Comput Ind Eng 66(4):734–750
Andersson T, Värbrand P (2007) Decision support tools for ambulance dispatch and relocation. J Oper Res Soc 58(2):195–201
Beraldi P, Bruni M (2009) A probabilistic model applied to emergency service vehicle location. Eur J Oper Res 196(1):323–331
Birge JR, Louveaux F (2011) Introduction to stochastic programming. Springer, New York
Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur J Oper Res 147(3):451–463
Carson YM, Batta R (1990) Locating an ambulance on the Amherst Campus of the State University of New York at Buffalo. Interfaces 20(5):43–49
Church R, Velle CR (1974) The maximal covering location problem. Pap Reg Sci 32(1):101–118
Daskin MS, Dean LK (2005) Location of health care facilities. In: Sainfort F, Brandeau M, Pierskalla W (eds) Operations research and health care. Springer, New York, p 43–76
Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility location: a review. Comput Ind Eng 62(1):368–407
Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450–459
Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467
Hogan K, ReVelle C (1986) Concepts and applications of backup coverage. Manag Sci 32(11):1434–1444
Hooker JN, Yan H (1995) Logic circuit verification by benders decomposition. Principles and practice of constraint programming: the newport papers, pp 267–288
Huang Y, Fan Y (2011) Modeling uncertainties in emergency service resource allocation. J Infrastruct Syst 17(1):35–41
Jagtenberg C, Bhulai S, Van der Mei R (2016) Dynamic ambulance dispatching: is the closest-idle policy always optimal? Health Care Manag Sci. doi:10.1007/s10729-016-9368-0
Jain V, Grossmann IE (2001) Algorithms for hybrid MILP CLP models for a class of optimization problems. INFORMS J Comput 13(4):258–276
Jia H, Ordóñez F, Dessouky M (2007) A modeling framework for facility location of medical services for large-scale emergencies. IIE Trans 39(1):41–55
Lee S (2011) The role of preparedness in ambulance dispatching. J Oper Res Soc 62(10):1888–1897
Li X, Zhao Z, Zhu X, Wyatt T (2011) Covering models and optimization techniques for emergency response facility location and planning: a review. Math Methods Oper Res 74(3):281–310
Lim CS, Mamat R, Bräunl T (2011) Impact of ambulance dispatch policies on performance of emergency medical services. IEEE Trans Intell Transp Syst 12(2):624–632
Marianov V, ReVelle C (1996) The Queueing Maximal availability location problem: a model for the siting of emergency vehicles. Eur J Oper Res 93(1):110–120
Matteson DS, McLean MW, Woodard DB, Henderson SG (2011) Forecasting emergency medical service call arrival rates. Ann Appl Stat 5(2B):1379–1406
Nickel S, Reuter-Oppermann M, Saldanha-da Gama F (2016) Ambulance location under stochastic demand: a sampling approach. Oper Res Health Care 8:24–32
Owen SH, Daskin MS (1998) Strategic facility location: a review. Eur J Oper Res 111(3):423–447
Pereira MA, Coelho LC, Lorena LA, De Souza LC (2015) A hybrid method for the probabilistic maximal covering location-allocation problem. Comput Oper Res 57:51–59
Repede J, Bernardo JJ (1994) Case study developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur J Oper Res 75:567–581
ReVelle C, Eiselt H (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165(1):1–19
ReVelle C, Hogan K (1989) The maximum availability location problem. Transp Sci 23(3):192–200
Schilling DA (1982) Strategic facility planning: the analysis of options. Decis Sci 13(1):1–14
Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19(6):1363–1373
Van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17(4):638–663
This research was supported by a Grant “Research and development of modeling and simulating the rescues, the transfer, and the treatment of disaster victims” [MPSS-SD-2013-36] through the Disaster and Safety Management Institute funded by Ministry of Public Safety and Security of Korean government.
The original version of this article was revised: Algorithm 1 had been missing in the article. This has been corrected in this version.
About this article
Cite this article
Sung, I., Lee, T. Scenario-based approach for the ambulance location problem with stochastic call arrivals under a dispatching policy. Flex Serv Manuf J 30, 153–170 (2018). https://doi.org/10.1007/s10696-016-9271-5
- Ambulance location problem
- Stochastic programming
- Stochastic call arrivals
- Dispatching policy
- Logic-based Benders decomposition