An Extended Dijkstra's Algorithm for Calculating Alternative Routes for Evacuee Agents in Disaster Simulation

This paper proposes an extended Dijkstra's algorithm for calculating alternative routes for evacuee agents in a disaster simulation system. In a disaster simulation, evacuee agents may not be able to utilize the shortest routes to the shelters because the disaster may make some roads on these shortest routes impassable. Our algorithm includes the extension of Dijkstra's algorithm so that alternative routes can be calculated. Experimental results show that the processing time of our algorithm is about one and a half times that of Dijkstra's original algorithm. However, when an evacuee agent reaches an impassable road, Dijkstra's algorithm must be executed again to calculate other routes. Thus, our algorithm can calculate evacuation routes faster than Dijkstra's algorithm when many roads in the disaster area are impassable.