Evacuation Route Planning for Alternative Fuel Vehicles
Denissa Sari Darmawi Purba, Eleftheria Kontou, Chrysafis Vogiatzis

TL;DR
This paper introduces a novel evacuation route planning method for alternative fuel vehicles, considering refueling needs and infrastructure, using advanced algorithms to optimize safety and efficiency during emergencies.
Contribution
It formulates a new seamless evacuation route problem incorporating refueling constraints and develops a branch-and-price algorithm to solve it effectively.
Findings
Refueling infrastructure and vehicle range significantly impact evacuation routes.
Unique routes are often required for different fuel types.
Driving range constraints can increase evacuation time by up to 7.32%.
Abstract
As the number of adopted alternative fuel vehicles increases, it is crucial for communities (especially those that are susceptible to hazards) to make evacuation plans that account for such vehicles refueling needs. During emergencies that require preemptive evacuation planning, travelers using alternative fuel vehicles are vulnerable when evacuation routes do not provide access to refueling stations on their way to shelters. In this paper, we formulate and solve a novel seamless evacuation route plan problem, by designing -minimum spanning trees with hop constraints that capture the refueling needs of each vehicle fuel type on their way to reach a shelter. We develop a branch-and-price algorithm based on a matheuristic column generation approach to solve the evacuation problem. We apply the proposed framework to the Sioux Falls transportation network with existing…
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.
