Priority-oriented route network planning for evacuation in constrained space scenarios
From MaRDI portal
Publication:2420781
DOI10.1007/s10957-018-1386-2zbMath1414.90090MaRDI QIDQ2420781
Qiang Wu, Yi Hong, Deying Li, Hua Xu
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1386-2
path planning problem; route network; 3D scenarios; constrained space evacuation; minimum weighted set cover
90C35: Programming involving graphs or networks
90B50: Management decision making, including multiple objectives
90B20: Traffic problems in operations research
Related Items
Cites Work
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- Modeling of building evacuation problems by network flows with side constraints
- Shortest paths algorithms: Theory and experimental evaluation
- A survey on models and algorithms for discrete evacuation planning network problems
- `` Strong NP-Completeness Results
- Finding the k Shortest Paths