查看文章

In this paper, we present an evacuation planner algorithm that does not use the time-expanded graphs. Given a transportation network with nodes and edges, where nodes have capacity/occupancy and edges have capacity/travel time, the proposed algorithm can be used to plan the evacuation routing that minimizes the evacuation time. In order to avoid the use of time-expanded graphs, we are using the quickest paths instead of the shortest paths to construct the evacuation routing. By combining the quickest paths, we can get a routing scheme that has short evacuation time that is scalable with the increase of number of evacuees. The simulation results show that our algorithm is scalable and the found evacuation routes have short evacuation time.