Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Contraflow network reconfiguration for evacuation planning: a summary of results
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Mathematical programming algorithms for reliable routing and robust evacuation problems
Mathematical programming algorithms for reliable routing and robust evacuation problems
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics
IEEE Intelligent Systems
Evacuation route planning: scalable heuristics
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Path selection model and algorithm for emergency logistics management
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper addresses the problem of modeling evacuation routes from a building and out of an affected area. The evacuation route involves pathways such as corridors, and stairs in buildings and road networks and sidewalks outside the building. To illustrate such an approach, we consider the problem of finding evacuation paths from an urban building and out of a predetermined neighborhood of the building on foot. A case study for a college campus building and small set of road around it is provided. There are a pre-defined set of exit points out of the target building and out of the road network serving the building. A two-step approach with an uncapacitated network model for route finding and a capacitated scheduling algorithm for evacuation time computation is proposed. A recent efficient heuristic algorithm is selected as a reference for comparative analysis. The process of creating a combined building and road path network data is discussed. The key results are the competitive evacuation time provided by the proposed uncapacitated route planning model, simple pedestrian flow capacity formulas for corridors and roads from readily available geometric data, and the illustration of the creation and use of combined building and road path network.