IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2021i11p2536-2550.html
   My bibliography  Save this article

Dispatching policies during prolonged mass casualty incidents

Author

Listed:
  • Eric DuBois
  • Laura A. Albert

Abstract

Mass casualty incidents that result from prolonged increases in patient arrivals represent a unique modeling challenge with patients arriving and queuing over extended periods of time. In this paper, we consider how to optimally dispatch ambulances to prioritized patients during these incidents. Patients arrive, queue, and renege, and their conditions deteriorate over time, and ambulances are allowed to idle while less emergent patients are queued, thereby lifting several assumptions typically made in the literature. We formulate the ambulance dispatching problem as a Markov decision process model with patients prioritized by the benefit they will receive from ambulance care and with two classes of ambulances. Computational results are presented for a real-world example, and an extensive sensitivity analysis is performed. We observe that under the optimal policies, ambulances often remain idle when less emergent patients are queued to provide quicker service to future, more emergent patients. We propose and evaluate heuristics that represent static idling policies to study how to practically implement the results. The results suggest that delaying service to low priority patients when the system is congested enables ambulances to immediately respond to future high priority patients who may need care and whose conditions may deteriorate.

Suggested Citation

  • Eric DuBois & Laura A. Albert, 2021. "Dispatching policies during prolonged mass casualty incidents," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(11), pages 2536-2550, December.
  • Handle: RePEc:taf:tjorxx:v:73:y:2021:i:11:p:2536-2550
    DOI: 10.1080/01605682.2021.1999181
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1999181
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2021.1999181?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:73:y:2021:i:11:p:2536-2550. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.