New Heuristics for the Operation of an Ambulance Fleet under Uncertainty
Vincent Guigues, Anton J. Kleywegt, Victor Hugo Nascimento

TL;DR
This paper introduces new heuristics and a rollout approach for ambulance fleet operation under uncertainty, improving response times and computational efficiency for real-time emergency dispatch decisions.
Contribution
It proposes four novel heuristics for ambulance selection, strategies for reassignment, and integrates them into a rollout framework with stochastic programming, enhancing real-time EMS management.
Findings
Heuristics outperform existing dispatch methods.
Rollout approach yields better response times.
Decisions are computed in seconds, enabling real-time application.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Mathematical Programming · Management and Optimization Techniques
