Scenario-based approach for the ambulance location problem with stochastic call arrivals under a dispatching policy
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.
KeywordsAmbulance location problem Stochastic programming Stochastic call arrivals Dispatching policy Logic-based Benders decomposition
- Hooker JN, Yan H (1995) Logic circuit verification by benders decomposition. Principles and practice of constraint programming: the newport papers, pp 267–288Google Scholar
- 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