Implementasi Algoritma A* (Star) untuk Menentukan Rute Jarak Terpendek
Abstract
In this research, the implementation of the A star algorithm is used to find efficient routes, reduce the travel time, and optimize the use of existing road infrastructure at waypoints. The A star algorithm uses the concept of Open List and Close List, which helps to reduce the number of rechecks on the points travelled, thus speeding up the search process. The A star algorithm stops when there are no more points on the open list or when the end point has been determined. This research method uses primary data, which consists of five street locations in Palangka Raya city, as nodes and combines the distance between the street points. The implemented program uses the A Star algorithm to calculate the shortest route and displays the path along with the distance. The purpose of this research is to achieve the shortest route and calculate the distance travelled for the waypoints.
Keywords: shortest route, A* algorithm, waypoint.
This work is licensed under a Creative Commons Attribution 4.0 International License.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, the copyright of the article shall be assigned to JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya) as the publisher of the journal. Copyright encompasses exclusive rights to reproduce and deliver the article in all forms and media, as well as translations. The reproduction of any part of this journal (printed or online) will be allowed only with written permission from JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya). The Editorial Board of JNATIA (Jurnal Nasional Teknologi Informasi dan Aplikasinya) makes every effort to ensure that no wrong or misleading data, opinions, or statements be published in the journal.
This work is licensed under a Creative Commons Attribution 4.0 International License.
