Operation of an ambulance fleet under uncertainty
Vincent Guigues, Anton Kleywegt, Victor Hugo Nascimento

TL;DR
This paper presents new optimization models and a rolling horizon approach for ambulance dispatch under uncertainty, improving response times compared to existing decision rules in Rio de Janeiro.
Contribution
Introduces two novel optimization models for ambulance dispatch and a rolling horizon method combining first- and second-stage decisions under uncertainty.
Findings
Proposed dispatch policy reduces response times.
Column generation algorithm efficiently solves large-scale second-stage problems.
Policy outperforms popular decision rules in real data tests.
Abstract
We introduce two new optimization models for the dispatch of ambulances. The first model, called the ambulance selection problem, is used when an emergency call arrives to decide whether an ambulance should be dispatched for that call, and if so, which ambulance should be dispatched, or whether the request should be put in a queue of waiting requests. The second model, called the ambulance reassignment problem, is used when an ambulance finishes its current task to decide whether the ambulance should be dispatched to a request waiting in queue, and if so, which request, or whether the ambulance should be dispatched to an ambulance staging location, and if so, which ambulance staging location. These decisions affect not only the emergency call and ambulance under consideration, but also the ability of the ambulance fleet to service future calls. There is uncertainty regarding the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFacility Location and Emergency Management · Vehicle Routing Optimization Methods · Optimization and Mathematical Programming
