Papers › New Heuristics for the Operation of an Ambulance Fleet under Uncertainty

New Heuristics for the Operation of an Ambulance Fleet under Uncertainty

13 Sep 2024arXiv:2409.09158links table onlyarchive 2025-07-28

Vincent Guigues, Anton J. Kleywegt, Victor Hugo Nascimento

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The operation of an ambulance fleet involves ambulance selection decisions about which ambulance to dispatch to each emergency, and ambulance reassignment decisions about what each ambulance should do after it has finished the service associated with an emergency. For ambulance selection decisions, we propose four new heuristics: the Best Myopic (BM) heuristic, a NonMyopic (NM) heuristic, and two greedy heuristics (GHP1 and GHP2). Two variants of the greedy heuristics are also considered. We also propose an optimization problem for an extension of the BM heuristic, useful when a call for several patients arrives. For ambulance reassignment decisions, we propose several strategies to choose which emergency in queue to send an ambulance to or which ambulance station to send an ambulance to when it finishes service. These heuristics are also used in a rollout approach: each time a new decision has to be made (when a call arrives or when an ambulance finishes service), a two-stage stochastic program is solved. The proposed heuristics are used to efficiently compute the second stage cost of these problems. We apply the rollout approach with our heuristics to data of the Emergency Medical Service (EMS) of a large city, and show that these methods outperform other heuristics that have been proposed for ambulance dispatch decisions. We also show that better response times can be obtained using the rollout approach instead of using the heuristics without rollout. Moreover, each decision is computed in a few seconds, which allows these methods to be used for the real-time management of a fleet of ambulances.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections