IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-15644-1_32.html
   My bibliography  Save this book chapter

Optimal Unit Locations in Emergency Service Systems with Bayesian Optimization

In: City, Society, and Digital Transformation

Author

Listed:
  • Wenqian Xing

    (IEOR Department Columbia University)

  • Cheng Hua

    (Antai College Shanghai Jiao Tong University)

Abstract

We model the facility location problem in an emergency service system as an optimization problem in which the objective is to minimize the system-wide mean response time, which requires exponential complexity to solve. We show that this problem is NP-hard and develop lower and upper bounds for the optimal solution from a special case of the classical p-median problem. We propose a Bayesian optimization solution to this problem that includes searching within feasible trust regions and adaptive swapping strategies. We show that our algorithm always converges to a globally optimal solution with a regret bound guarantee. Our algorithm consistently outperforms the p-median solution in numerical experiments and quickly converges to the optimal solution. We also apply our method to solve the optimal ambulance location problem in St. Paul, Minnesota, using one year of real data. We show that our method converges to the optimal solution very quickly. Our method can be applied to solve the optimal unit locations in the emergency service systems of the largest cities.

Suggested Citation

  • Wenqian Xing & Cheng Hua, 2022. "Optimal Unit Locations in Emergency Service Systems with Bayesian Optimization," Lecture Notes in Operations Research, in: Robin Qiu & Wai Kin Victor Chan & Weiwei Chen & Youakim Badr & Canrong Zhang (ed.), City, Society, and Digital Transformation, chapter 0, pages 439-452, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-15644-1_32
    DOI: 10.1007/978-3-031-15644-1_32
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnopch:978-3-031-15644-1_32. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.