Ambulance Dispatch Center Pilots Proactive Relocation Policies to Enhance Effectiveness

In life-threatening emergency situations in which every second counts, the timely arrival of an ambulance can make the difference between survival and death. In practice, the response-time targets, defined as the maximum time between the moment an incoming emergency call is received the moment when onsite medical aid is provided, are often not met. A promising means to reduce late arrivals by ambulances is to proactively relocate ambulances to ensure good coverage by the available ambulances in real time. This paper evaluates two dynamic relocation policies that an ambulance service provider in the Netherlands modified for operational use and implemented in a software tool for realtime decision support. The policies were used in a pilot program within a dispatch center for 12 weeks. Based on the success of this pilot, our policies were adopted for ongoing use and permanent implementation. This paper describes the relocation methods, evaluates the pilot, provides statistics for efficiency improvements, and discusses the experiences of ambulance dispatchers and management.

[1]  Andrew Mason,et al.  Simulation and Real-Time Optimised Relocation for Improving Ambulance Operations , 2013 .

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

[3]  Angel Ruiz,et al.  Recent Advances in Emergency Medical Services Management , 2015 .

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

[5]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[6]  Thije van Barneveld,et al.  The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles , 2016, INFORMS J. Comput..

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

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

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

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

[11]  Rajan Batta,et al.  The Maximal Expected Covering Location Problem: Revisited , 1989, Transp. Sci..

[12]  Gilbert Laporte,et al.  Solving an ambulance location model by tabu search , 1997 .

[13]  Erhan Erkut,et al.  Ambulance location for maximum survival , 2008 .

[14]  Sandjai Bhulai,et al.  The effect of ambulance relocations on the performance of ambulance service providers , 2016, Eur. J. Oper. Res..

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

[16]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

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

[18]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

[19]  Matthew S. Maxwell,et al.  Ambulance redeployment: An approximate dynamic programming approach , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[20]  Alan Fern,et al.  Simulation-based Optimization of Resource Placement and Emergency Response , 2009, IAAI.

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

[22]  Maria E. Mayorga,et al.  A nested-compliance table policy for emergency medical service systems under relocation , 2016 .