Abstract
Finding the shortest path in a graph can be applied to various fields of shortest distance costs in routes, computer games, robotics or navigation. This study implements the A star heuristic search algorithm in determining the shortest path using the Visual Basic programming language and MySQL database. A star heuristic algorithm is implemented to find the shortest path between two vertices in a two-way weighted graph. We use a heuristic method to estimate the remaining cost from the start node to the destination point. This condition gives the A star algorithm the opportunity to choose the next closest node and optimize the search for the shortest route. Various experiments have been carried out with various graph conditions and with different complicated graphs to test the A star algorithm. The experimental results show that this algorithm succeeds in finding the shortest path efficiently in various situations. Our findings confirm that the A star algorithm has great potential in solving the shortest path search problem with an advantage in combining various information and remaining cost estimates, thereby minimizing the number of explored nodes and producing the shortest path efficiently.
Reference18 articles.
1. R. Astri, “Implementation of A-star algorithm for searching routes near the tsunami evacuation shelter point,” J. RESTI (Rekayasa Sist. Dan Teknol. Informasi), vol. 4, no. 2, pp. 254–259, 2020.
2. H. Hermawan and H. Setiyani, “Implementasi Algoritma A-Star Pada Permainan Komputer Roguelike Berbasis Unity,” J. Algoritm. Log. dan Komputasi, vol. 2, no. 1, 2019.
3. G. Mutaqin, J. N. Fadilah, and F. Nugroho, “Implementasi Metode Path Finding dengan Penerapan Algoritma A-Star untuk Mencari Jalur Terpendek pada Game ‘Jumrah Launch Story,’” Walisongo J. Inf. Technol., vol. 3, no. 1, pp. 43–48, 2021.
4. S. Wahyuni and M. Marbun, “Implementation of Data Mining In Predicting the Study Period of Student Using the Naïve Bayes Algorithm Implementation of Data Mining In Predicting the Study Period of Student Using the Naïve Bayes Algorithm,” in IOP Confrence Series: materials Science and engineering, 2020, pp. 4–11.
5. S. Wahyuni, kana S. Saragih, and M. I. Perangin-angin, “Implemntasi Metode Decision Tree C4.5 Untuk Menganalisa Mahasiswa Dop Out,” ethos, vol. 6, no. 1, pp. 42–51, 2018.