A nested-compliance table policy for emergency medical service systems under relocation

The goal of Emergency Medical Service (EMS) systems is to provide rapid response to emergency calls in order to save lives. This paper proposes a relocation strategy to improve the performance of EMS systems. In practice, EMS systems often use a compliance table to relocate ambulances. A compliance table specifies ambulance base stations as a function of the state of the system. We consider a nested-compliance table, which restricts the number of relocations that can occur simultaneously. We formulate the nested-compliance table model as an integer programming model in order to maximize expected coverage. We determine an optimal nested-compliance table policy using steady state probabilities of a Markov chain model with relocation as input parameters. These parameter approximations are independent of the exact compliance table used. We assume that there is a single type of medical unit, single call priority, and no patient queue. We validate the model by applying the nested-compliance table policies in a simulated system using real-world data. The numerical results show the benefit of our model over a static policy based on the adjusted maximum expected covering location problem (AMEXCLP).

[1]  Maria E. Mayorga,et al.  Joint location and dispatching decisions for Emergency Medical Services , 2013, Comput. Ind. Eng..

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

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

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

[5]  Vincent A. Knight,et al.  Ambulance allocation for maximal survival with heterogeneous outcome measures , 2012 .

[6]  Laura A McLay,et al.  Evaluating emergency medical service performance measures , 2010, Health care management science.

[7]  J. P. Jarvis,et al.  Approximating the Equilibrium Behavior of Multi-Server Loss Systems , 1985 .

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

[9]  Elise Miller-Hooks,et al.  Optimizing Location and Relocation of Response Units in Guarding Critical Facilities , 2005 .

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

[11]  Peter J. Kolesar,et al.  An Algorithm for the Dynamic Relocation of Fire Companies , 1974, Oper. Res..

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

[13]  Damitha Bandara,et al.  DISTRICTING AND DISPATCHING POLICIES TO IMPROVE THE EFFICIENCY OF EMERGENCY MEDICAL SERVICE (EMS) SYSTEMS , 2012 .

[14]  Oded Berman,et al.  Dynamic Repositioning of Indistinguishable Service Units on Transportation Networks , 1981 .

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

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

[17]  Stephen M. Hess,et al.  Prioritizing Project Selection , 2009 .

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

[19]  Jay Fitch Response times: myths, measurement & management. , 2005, JEMS : a journal of emergency medical services.

[20]  Richard C. Larson,et al.  Approximating the Performance of Urban Emergency Service Systems , 1975, Oper. Res..

[21]  Bahar Y. Kara,et al.  The P-Hub maximal covering problem and extensions for gradual decay functions $ , 2015 .

[22]  Karl F. Doerner,et al.  Ambulance location and relocation problems with time-dependent travel times , 2010, Eur. J. Oper. Res..

[23]  Ramayya Krishnan,et al.  An Efficient Simulation-Based Approach to Ambulance Fleet Allocation and Dynamic Redeployment , 2012, AAAI.

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

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

[26]  Maria E. Mayorga,et al.  The minimum p-envy location problem: a new model for equitable distribution of emergency resources , 2011 .

[27]  A. Hallstrom,et al.  Predicting survival from out-of-hospital cardiac arrest: a graphic model. , 1993, Annals of emergency medicine.

[28]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[29]  Maria E. Mayorga,et al.  A Dispatching Model for Server-to-Customer Systems That Balances Efficiency and Equity , 2013, Manuf. Serv. Oper. Manag..

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

[31]  Elise Miller-Hooks,et al.  Evaluation of Relocation Strategies for Emergency Medical Service Vehicles , 2009 .

[32]  Cem Saydam,et al.  A multiperiod set covering location model for dynamic redeployment of ambulances , 2008, Comput. Oper. Res..

[33]  Sunderesh S. Heragu,et al.  An optimization approach for dispatching and relocating EMS vehicles , 2012 .

[34]  Oded Berman Repositioning of Two Distinguishable Service Vehicles on Networks , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[35]  I. Stiell,et al.  Improved Out-of-Hospital Cardiac Arrest Survival Through the Inexpensive Optimization of an Existing Defibrillation Program: OPALS Study Phase II , 1999 .