Determination of Tsunami Evacuation Route using Dijkstra Algorithm: Case Study of Batu Karas, Indonesia
Aldo Novaznursyah Costrada, Elis Agustiana, Nina Siti Aminah, Mitra Djamal

Instrumentation and Computational Research Group, Bandung Institute of Technology

Abstract

During a tsunami, the choice of evacuation route is vital for safety. Dijkstra^s algorithm is used to plan the shortest route for evacuation. The optimal shortest route is obtained from various nodes to the evacuation zone by identifying the distance, determining the speed and density of pedestrians, and shelter availability. The main purpose of this study is to identify the shortest route to the evacuation zone by determining the speed and density of pedestrians, and shelter availability in Batu Karas, Indonesia.
It is found that hhe farthest distance from a node to the evacuation zone is 1850 m. It takes 34 minutes to evacuate, with an estimated arrival time of tsunami 20 minutes. Based on these results, it is necessary to have an additional evacuation zone to minimize the distance to the evacuation zone.
This study can be used to determine tsunami evacuation route for tsunami risk area in Indonesia.

Keywords: Dijkstra algorithm, Tsunami, Evacuation route.

Topic: Life Sciences