Penentuan Jalur Evakuasi Terpendek Saat Bencana Tsunami di Kota Padang Menggunakan Algoritma Dijkstra

Abstract

Padang City is a high-risk area for tsunamis. Evacuation speed is crucial for saving lives, but the lack of a spatial data-based evacuation system is a challenge. This study aims to design the shortest evacuation route using the Dijkstra algorithm. Road network data was obtained from OpenStreetMap and processed using Python libraries such as OSMnx, NetworkX, and Folium. The initial and final locations were used as nodes in a weighted graph based on the length of the road segment. The results show that the evacuation route from Padang State University to Mount Pangilun is 3.65 km long, and from Lubuk Buaya Market to Anak Aia is 3.07 km long. The resulting interactive map facilitates the delivery of spatial information. Thus, the application of the Dijkstra algorithm is effective in supporting the design of a disaster evacuation system in Padang City.