Priority-oriented route network planning for evacuation in constrained space scenarios

DOI10.1007/s10957-018-1386-2zbMath1414.90090OpenAlexW2891927836MaRDI 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

zbMATH Keywords

path planning problemroute network3D scenariosconstrained space evacuationminimum weighted set cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Traffic problems in operations research (90B20)

Related Items (1)

Balanced-flow algorithm for path network planning in hierarchical spaces

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

This page was built for publication: Priority-oriented route network planning for evacuation in constrained space scenarios