Flood-Resilient Transportation Network Planning in Montpelier, Vermont: A Penalty Dijkstra Algorithm for Optimizing Evacuation Routes
DOI:
https://doi.org/10.61424/rjiee.v1i1.142Keywords:
Flood-resilient transportation, Evacuation routes, Penalty Dijkstra algorithm, Transportation network planning, Disaster preparednessAbstract
Flooding poses a significant risk to transportation networks, especially in flood-prone regions like Montpelier, Vermont. Effective evacuation planning is crucial for minimizing the impacts of such disasters, ensuring that residents can safely and efficiently evacuate to safe areas. This study introduces a novel approach to flood-resilient transportation network planning by applying a Penalty Dijkstra algorithm to optimize evacuation routes in Montpelier. The algorithm accounts for both the geographic layout of the city and flood-prone areas, applying penalties to paths that are likely to be affected by rising water levels. By incorporating flood risk data into the algorithm’s cost function, the method generates evacuation routes that prioritize safety, speed, and accessibility. The proposed approach is tested using real-world data from Montpelier's transportation network, with simulation results demonstrating its effectiveness in identifying optimal routes while minimizing exposure to flood hazards. This work contributes to the development of adaptive, data-driven evacuation strategies that enhance the resilience of transportation networks in flood-affected regions, providing a framework for other cities to improve their disaster preparedness and response strategies.
Downloads
Published
Versions
- 2024-12-01 (3)
- 2024-11-26 (2)
- 2024-11-21 (1)
How to Cite
Issue
Section
License
Copyright (c) 2024 Research Journal in Industrial and Electrical Engineering

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.