Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios
Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios
We investigate a dynamic route planning problem in restricted-space evacuation, namely, the Multiobjective Dynamic Route Network Planning (MODRNP) problem. It models the multisource to multidestination evacuation in restricted-space scenarios, with the objectives of minimizing the whole evacuation delay and maximizing the evacuation efficiency. We study the problem in 3D scenarios, which can provide intuition vision for the geographic space and contribute to the evacuation plan and implementation. Based on the auxiliary graph transformation, we propose a heuristic algorithm referred to the classical problem, Minimum Weighted Set Cover. We finally conduct extensive experiments to evaluate the performance of the proposed algorithm and give an application instance on a typical kind of restricted-space scenarios. The results indicate that the proposed algorithm outperforms the existing alternatives in terms of the utilization as well as timeliness.
Document information
Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios
2018
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Similar titles
Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
| Transportation Research Record | 2008
Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
| Online Contents | 2008
Emergency evacuation planning as a network design problem: a critical review
| Taylor & Francis Verlag | 2009
Pedestrian–bus route and pickup location planning for emergency evacuation
| DOAJ | 2021