IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v211y2026ics0191261526001372.html

Drone pre-positioning for cardiac arrest response : A feature-driven distributionally robust chance constrained programming

Author

Listed:
  • Chen, Jie
  • Zhu, Ning
  • Fu, Hao
  • Lam, William H.K.

Abstract

Cardiac arrest is a leading cause of mortality worldwide, with survival critically dependent on treatment within the strict 4–6 min golden time window. Conventional emergency medical service (EMS) relying on ground transport often faces delays from traffic congestion and geographic barriers. To address this challenge, we propose a feature-driven distributionally robust chance-constrained program (DRCCP) that determines drone base locations and assignments to minimize worst-case response time. A feature-driven Wasserstein ambiguity set is constructed to capture travel time uncertainty arising from wind speed and direction. To ensure reliable response within the golden window, we further develop two target-oriented DRCCPs, including a risk-oriented model that minimizes the violation probability and a robustness-oriented model that maximizes the admissible level of distributional ambiguity for a prespecified travel-time target. We solve these models by deriving tractable reformulations and designing a bisection-search algorithm. Numerical experiments demonstrate that the proposed DRCCP consistently outperforms benchmark models, yielding lower expected response times, improved tail-risk performance, and a reduced probability of exceeding critical thresholds. The two target-oriented DRCCP models achieve not only lower violation probabilities within the golden time window, but also smaller violation magnitudes when the target is violated. Moreover, our proposed algorithms significantly outperform state-of-the-art commercial solvers in computational efficiency.

Suggested Citation

  • Chen, Jie & Zhu, Ning & Fu, Hao & Lam, William H.K., 2026. "Drone pre-positioning for cardiac arrest response : A feature-driven distributionally robust chance constrained programming," Transportation Research Part B: Methodological, Elsevier, vol. 211(C).
  • Handle: RePEc:eee:transb:v:211:y:2026:i:c:s0191261526001372
    DOI: 10.1016/j.trb.2026.103525
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261526001372
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2026.103525?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transb:v:211:y:2026:i:c:s0191261526001372. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.