Dynamic Routing during Disaster Events
Siska Fitrianie, Leon J. M. Rothkrantz
Innovations in mobile technology allow the use of Internet and smartphones for communicating disasters and coordinating evacuations. However, given the turbulent nature of disaster situations, the people and systems at crisis center are subjected to information overload, which can obstruct timely and accurate information sharing. A dynamic and automated evacuation plan that is able to predict future disaster outcome can be used to coordinate the affected people to safety in times of crisis. In this paper, we present a dynamic version of the shortest path algorithm of Dijkstra. The algorithm is able to compute the shortest path from the user’s location (sent by the smartphone) to the safety area by taking into account possible affected areas in future. We aim at employing the computed routes on our mobile communication system for navigating affected people during emergency and disaster evacuations. Two simulation studies have validated the performance of the developed algorithm.