The effect of ambulance relocations on the performance of ambulance service providers

Dynamic Ambulance Management (DAM) is generally believed to provide means to enhance the response-time performance of emergency medical service providers. The implementation of DAM algorithms leads to additional movements of ambulance vehicles compared to the reactive paradigm, where ambulances depart from the base station when an incident is reported. In practice, proactive relocations are only acceptable when the number of additional movements is limited. Motivated by this trade-off, we study the effect of the number of relocations on the response-time performance. We formulate the relocations from one configuration to a target configuration by the Linear Bottleneck Assignment Problem, so as to provide the quickest way to transition to the target configuration. Moreover, the performance is measured by a general penalty function, assigning to each possible response time a certain penalty. We extensively validate the effectiveness of relocations for a wide variety of realistic scenarios, including a day and night scenario in a critically and realistically loaded system. The results consistently show that already a small number of relocations lead to near-optimal performance, which is important for the implementation of DAM algorithms in practice.

[1]  Jan L Jensen,et al.  Offload zones to mitigate emergency medical services (EMS) offload delay in the emergency department: a process map and hazard analysis. , 2015, CJEM.

[2]  Mathew W. McLean,et al.  Forecasting emergency medical service call arrival rates , 2011, 1107.4919.

[3]  Matthew S. Maxwell,et al.  Tuning approximate dynamic programming policies for ambulance redeployment via direct search , 2013 .

[4]  Samir Elhedhli,et al.  A stochastic optimization model for real-time ambulance redeployment , 2013, Comput. Oper. Res..

[5]  Verena Schmid,et al.  Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming , 2012, Eur. J. Oper. Res..

[6]  Armann Ingolfsson,et al.  A Markov Chain Model for an EMS System with Repositioning , 2013 .

[7]  Sandjai Bhulai,et al.  An efficient heuristic for real-time ambulance redeployment , 2015 .

[8]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[9]  Young Hoon Lee,et al.  The Maximal Covering Location Problem with Cost Restrictions , 2004 .

[10]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[11]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[12]  Mohammad Mehdi Sepehri,et al.  Two new models for redeployment of ambulances , 2014, Comput. Ind. Eng..

[13]  Tobias Andersson Granberg,et al.  Decision support tools for ambulance dispatch and relocation , 2007, J. Oper. Res. Soc..

[14]  Matthew S. Maxwell,et al.  Approximate Dynamic Programming for Ambulance Redeployment , 2010, INFORMS J. Comput..

[15]  Karl F. Doerner,et al.  Ambulance location and relocation models in a crisis , 2014, Central European Journal of Operations Research.

[16]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[17]  Rosbi Mamat,et al.  Impact of Ambulance Dispatch Policies on Performance of Emergency Medical Services , 2011, IEEE Transactions on Intelligent Transportation Systems.

[18]  Sangbok Lee,et al.  The role of preparedness in ambulance dispatching , 2011, J. Oper. Res. Soc..

[19]  Michel Gendreau,et al.  The maximal expected coverage relocation problem for emergency vehicles , 2006, J. Oper. Res. Soc..

[20]  Xiaoyan Zhu,et al.  Covering models and optimization techniques for emergency response facility location and planning: a review , 2011, Math. Methods Oper. Res..

[21]  Erhan Erkut,et al.  Ambulance Location for Maximum Survival November 2007 , 2007 .