IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v219y2012i3p611-621.html
   My bibliography  Save this article

Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming

Author

Listed:
  • Schmid, Verena

Abstract

Emergency service providers are supposed to locate ambulances such that in case of emergency patients can be reached in a time-efficient manner. Two fundamental decisions and choices need to be made real-time. First of all immediately after a request emerges an appropriate vehicle needs to be dispatched and send to the requests’ site. After having served a request the vehicle needs to be relocated to its next waiting location. We are going to propose a model and solve the underlying optimization problem using approximate dynamic programming (ADP), an emerging and powerful tool for solving stochastic and dynamic problems typically arising in the field of operations research. Empirical tests based on real data from the city of Vienna indicate that by deviating from the classical dispatching rules the average response time can be decreased from 4.60 to 4.01 minutes, which corresponds to an improvement of 12.89%. Furthermore we are going to show that it is essential to consider time-dependent information such as travel times and changes with respect to the request volume explicitly. Ignoring the current time and its consequences thereafter during the stage of modeling and optimization leads to suboptimal decisions.

Suggested Citation

  • Schmid, Verena, 2012. "Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 219(3), pages 611-621.
    • Handle: RePEc:eee:ejores:v:219:y:2012:i:3:p:611-621
    DOI: 10.1016/j.ejor.2011.10.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711009830
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.10.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mark S. Daskin, 1983. "A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution," Transportation Science, INFORMS, vol. 17(1), pages 48-70, February.
    2. Hugo P. Simão & Jeff Day & Abraham P. George & Ted Gifford & John Nienow & Warren B. Powell, 2009. "An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application," Transportation Science, INFORMS, vol. 43(2), pages 178-197, May.
    3. Brotcorne, Luce & Laporte, Gilbert & Semet, Frederic, 2003. "Ambulance location and relocation models," European Journal of Operational Research, Elsevier, vol. 147(3), pages 451-463, June.
    4. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    5. M Gendreau & G Laporte & F Semet, 2006. "The maximal expected coverage relocation problem for emergency vehicles," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 22-28, January.
    6. Gregory A. Godfrey & Warren B. Powell, 2002. "An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times," Transportation Science, INFORMS, vol. 36(1), pages 40-54, February.
    7. Repede, John F. & Bernardo, John J., 1994. "Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky," European Journal of Operational Research, Elsevier, vol. 75(3), pages 567-581, June.
    8. Schmid, Verena & Doerner, Karl F., 2010. "Ambulance location and relocation problems with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1293-1303, December.
    9. Warren Powell & Joel Shapiro & Hugo Simao, 2001. "A Representational Paradigm for Dynamic Resource Transformation Problems," Annals of Operations Research, Springer, vol. 104(1), pages 231-279, April.
    10. Gregory A. Godfrey & Warren B. Powell, 2002. "An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times," Transportation Science, INFORMS, vol. 36(1), pages 21-39, February.
    11. Warren B. Powell, 2010. "Feature Article ---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 2-17, February.
    12. Matthew S. Maxwell & Mateo Restrepo & Shane G. Henderson & Huseyin Topaloglu, 2010. "Approximate Dynamic Programming for Ambulance Redeployment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 266-281, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bélanger, V. & Lanzarone, E. & Nicoletta, V. & Ruiz, A. & Soriano, P., 2020. "A recursive simulation-optimization framework for the ambulance location and dispatching problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 713-725.
    2. McCormack, Richard & Coates, Graham, 2015. "A simulation model to enable the optimization of ambulance fleet allocation and base station location for increased patient survival," European Journal of Operational Research, Elsevier, vol. 247(1), pages 294-309.
    3. Bélanger, V. & Ruiz, A. & Soriano, P., 2019. "Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles," European Journal of Operational Research, Elsevier, vol. 272(1), pages 1-23.
    4. Enayati, Shakiba & Mayorga, Maria E. & Rajagopalan, Hari K. & Saydam, Cem, 2018. "Real-time ambulance redeployment approach to improve service coverage with fair and restricted workload for EMS providers," Omega, Elsevier, vol. 79(C), pages 67-80.
    5. van Barneveld, Thije & Jagtenberg, Caroline & Bhulai, Sandjai & van der Mei, Rob, 2018. "Real-time ambulance relocation: Assessing real-time redeployment strategies for ambulance relocation," Socio-Economic Planning Sciences, Elsevier, vol. 62(C), pages 129-142.
    6. Thije van Barneveld, 2016. "The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 370-384, May.
    7. Karl Schneeberger & Karl Doerner & Andrea Kurz & Michael Schilde, 2016. "Ambulance location and relocation models in a crisis," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 1-27, March.
    8. Boyacı, Burak & Geroliminis, Nikolas, 2015. "Approximation methods for large-scale spatial queueing systems," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 151-181.
    9. Dirk Degel & Lara Wiesche & Sebastian Rachuba & Brigitte Werners, 2015. "Time-dependent ambulance allocation considering data-driven empirically required coverage," Health Care Management Science, Springer, vol. 18(4), pages 444-458, December.
    10. Schmid, Verena & Doerner, Karl F., 2010. "Ambulance location and relocation problems with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1293-1303, December.
    11. Sudtachat, Kanchala & Mayorga, Maria E. & Mclay, Laura A., 2016. "A nested-compliance table policy for emergency medical service systems under relocation," Omega, Elsevier, vol. 58(C), pages 154-168.
    12. Shayesta Wajid & N. Nezamuddin, 2023. "Optimizing emergency services for road safety using a decomposition method: a case study of Delhi," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 155-173, March.
    13. Xueping Li & Zhaoxia Zhao & Xiaoyan Zhu & Tami Wyatt, 2011. "Covering models and optimization techniques for emergency response facility location and planning: a review," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 281-310, December.
    14. T. C. Barneveld & S. Bhulai & R. D. Mei, 2017. "A dynamic ambulance management model for rural areas," Health Care Management Science, Springer, vol. 20(2), pages 165-186, June.
    15. van Barneveld, T.C. & Bhulai, S. & van der Mei, R.D., 2016. "The effect of ambulance relocations on the performance of ambulance service providers," European Journal of Operational Research, Elsevier, vol. 252(1), pages 257-269.
    16. Wajid, Shayesta & Nezamuddin, N., 2023. "Capturing delays in response of emergency services in Delhi," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    17. Shariat-Mohaymany, Afshin & Babaei, Mohsen & Moadi, Saeed & Amiripour, Sayyed Mahdi, 2012. "Linear upper-bound unavailability set covering models for locating ambulances: Application to Tehran rural roads," European Journal of Operational Research, Elsevier, vol. 221(1), pages 263-272.
    18. Zvi Drezner & Vladimir Marianov & George O. Wesolowsky, 2016. "Maximizing the minimum cover probability by emergency facilities," Annals of Operations Research, Springer, vol. 246(1), pages 349-362, November.
    19. Soo-Haeng Cho & Hoon Jang & Taesik Lee & John Turner, 2014. "Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning," Operations Research, INFORMS, vol. 62(4), pages 751-771, August.
    20. Ulmer, Marlin W. & Thomas, Barrett W., 2020. "Meso-parametric value function approximation for dynamic customer acceptances in delivery routing," European Journal of Operational Research, Elsevier, vol. 285(1), pages 183-195.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:219:y:2012:i:3:p:611-621. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.