PENENTUAN JARAK TERDEKAT KE LOKASI BENCANA MENGGUNAKAN ALGORITMA DJIKSTRA DAN ALGORITMA A-STAR BERBASIS ANDROID (STUDI KASUS BADAN PENANGGULANGAN BENCANA DAERAH ACEH TIMUR)

Abstract

Abstract
Effective natural disaster management requires an information system capable of quickly and accurately
determining the nearest routes. This addresses issues related to route finding and disaster information to facilitate
disaster response teams in providing assistance at evacuation points located in each sub-district. The area covers
6,040.60 km², encompassing 24 sub-districts and 513 villages. This research focuses on the application of
Dijkstra’s and A* algorithms to determine the shortest distance to disaster locations in East Aceh. The Dijkstra
algorithm is used to find the shortest path in a graph without considering heuristics, while A* utilizes heuristics to
expedite the search process. The maps displayed in the system use the Google Maps API, and the software used to
build this application includes Android Studio with MySQL as the database. The results indicate that the A*
algorithm significantly reduces search time in complex networks compared to Dijkstra's algorithm, which is more
effective in simpler graphs. The final results from the research using both Dijkstra's and A* algorithms reveal the
nearest routes and distances to disaster locations