Introduction to algorithms
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Guest Editors' Introduction: Artificial Intelligence for Homeland Security
IEEE Intelligent Systems
Contraflow network reconfiguration for evacuation planning: a summary of results
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Leveraging e-transportation in real-time traffic evacuation management
Electronic Commerce Research and Applications
Vehicle Priority Selection Algorithm for Evacuation Planning
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Evacuation Route Planning Algorithm: Longer Route Preferential
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Demonstrating an evacuation algorithm with mobile devices using an e-scavenger hunt game
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
An evacuation planner algorithm in flat time graphs
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A multi-valued discrete particle swarm optimization for the evacuation vehicle routing problem
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
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
Expert Systems with Applications: An International Journal
Understanding population displacements on location-based call records using road data
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
| Hi-index | 0.00 |
Evacuation planning is critical for applications such as disaster management and homeland defense preparation. Efficient tools are needed to produce evacuation plans to evacuate populations to safety in the event of catastrophes, natural disasters, and terrorist attacks. Current optimal methods suffer from computational complexity and may not scale up to large transportation networks. Current naive heuristic methods do not consider the capacity constraints of the evacuation network and may not produce feasible evacuation plans. In this paper, we model capacity as a time series and use a capacity constrained heuristic routing approach to solve the evacuation planning problem. We propose two heuristic algorithms, namely Single-Route Capacity Constrained Planner and Multiple-Route Capacity Constrained Planner to incorporate capacity constraints of the routes. Experiments on a real building dataset show that our proposed algorithms can produce close-to-optimal solution, which has total evacuation time within 10 percent longer than optimal solution, and also reduce the computational cost to only half of the optimal algorithm. The experiments also show that our algorithms are scalable with respect to the number of evacuees.