Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Network Programming
Algorithms for Network Programming
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Evacuation Route Planning Algorithm: Longer Route Preferential
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
A scalable heuristic for evacuation planning in large road network
Proceedings of the Second International Workshop on Computational Transportation Science
An evacuation planner algorithm in flat time graphs
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Agent-based modeling for household level hurricane evacuation
Winter Simulation Conference
An agent based model for evacuation traffic management
Proceedings of the Winter Simulation Conference
Computers and Industrial Engineering
| Hi-index | 0.00 |
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable population. Evacuation route planning is a vital components of efforts by civil authorities to prepare for both natural and man-made disasters (e.g., hurricanes, terrorist acts, etc). However, evacuation route planning is computationally challenging due to the size of transportation networks, the large number of evacuees, and capacity constraints. For example, the number of evacuees often far exceeds the bottleneck capacity, i.e., the minimum cut of a given network. Current approaches (e.g., linear programming and Capacity Constrained Route Planner (CCRP), a recently proposed evacuation planning algorithm) do not scale well because of intensive computation needs in order to produce the schedules of evacuees as well as routing plans. This paper presents innovative heuristics scalable to very large transportation networks. The Intelligent Load Reduction heuristic accelerates the routing computation by the reduction of evacuees using the bottleneck saturation. The performance of Intelligent Load Reduction is evaluated using real world scenarios. Results show that the Intelligent Load Reduction heuristic significantly improve the runtime of CCRP. We propose another heuristic named Incremental Data Structure. While the Intelligent Load Reduction gains performance increase by giving up the schedules of evacuees, the Incremental Data Structure heuristic can reduce calculation time of the CCRP algorithm by the enhanced data structures without affecting the outputs.