Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios

The authors 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. The authors 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, the authors propose a heuristic algorithm referred to the classical problem, Minimum Weighted Set Cover. The authors 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.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01676007
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 28 2018 4:04PM