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

Abstract

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.

Evaluation of TSP for Emergency Routing

“…Resource routing during an emergency would be needed for delivering social or medical services to individuals at their homes rather than individuals coming to the service point [8]. Different organizations get involved, different kind of resources (consumable or non-consumable) may have to be provided, coordinated, and becomes a difficult activity during an emergency [9]. Thus, resource planning and routing becomes crucial to increase responsiveness.…”

“…Routing problems in an emergency may have to consider random events such as unavailability or variability of resources, uncertain environment, damaged transportation network, complex traffic system, available vehicles and their capacity, and dynamic demand change [9,10,11]. During these emergency situations Travelling Salesman Problem may be applied in small instances of resource routing with heterogeneous vehicles and demand points [10,11,12].…”

Emergency Evacuation Simulation and Optimization for a Complex Rail Transit Station: A Perspective of Promoting Transportation Safety

“…A comprehensive study was made for the standard-based occupant evacuation design of Chinese metros, including evacuation to safe areas, evacuation time, and evacuation route [18]. A dynamic route planning problem in a restricted space evacuation was investigated through a heuristic algorithm [19]. Four crucial theoretical issues on the passengers' evacuation are included, which are competitive vs. cooperative behaviours, proactive vs. reactive behaviours, route/exit choice, and symmetry breaking [20].…”

Hybrid Dynamic Route Planning Model for Pedestrian Microscopic Simulation at Subway Station

“…Generally, most global path planning (GRP) is static and cannot adjust to the changes of environment. Although some studies adopted a real-time global path planning [6], it always means a large amount of computing resources consumption. Though the operational-level navigation can take full account of the dynamic environment, but it is difficult to ensure an optimal route from an overall perspective due to the limited local information obtained by the agents.…”

“…Waiting Time. Waiting time is estimated by the product of the estimated number of passengers in queue ( , ) and the average service time ( 0 ), as shown in (6).…”