Faster Algorithms for the Quickest Transshipment Problem
SIAM Journal on Optimization
Contraflow network reconfiguration for evacuation planning: a summary of results
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Evacuation route planning: scalable heuristics
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
IEEE Transactions on Knowledge and Data Engineering
Evacuation Flow Assignment based on Improved MCMF Algorithm
ICINIS '08 Proceedings of the 2008 First International Conference on Intelligent Networks and Intelligent Systems
A scalable heuristic for evacuation planning in large road network
Proceedings of the Second International Workshop on Computational Transportation Science
Evacuation planning: a capacity constrained routing approach
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
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
| Hi-index | 0.00 |
In this paper, we present an evacuation planner algorithm that does not use the time-expanded graphs. Given a transportation network with nodes and edges, where nodes have capacity/occupancy and edges have capacity/travel time, the proposed algorithm can be used to plan the evacuation routing that minimizes the evacuation time. In order to avoid the use of time-expanded graphs, we are using the quickest paths instead of the shortest paths to construct the evacuation routing. By combining the quickest paths, we can get a routing scheme that has short evacuation time that is scalable with the increase of number of evacuees. The simulation results show that our algorithm is scalable and the found evacuation routes have short evacuation time.