ARCHIVES
VOL. 10, ISSUE 2 (2024)
Analysis and design of the shortest route search application using the Dijkstra Algorithm to visit the Lurah office in Kupang City
Authors
Erna Rosani Nubatonis
Abstract
Daily community
mobility requires efficient travel time, especially when visiting village
heads' offices spread across various areas of Kupang City. To minimize travel
time, an application is needed that can display the shortest route to the
destination village head office. This research aims to analyze and design a
shortest route search application using the Dijkstra algorithm in order to
visit village heads' offices in Kupang City. Dijkstra's algorithm is an
appropriate algorithm for solving the problem of finding the shortest path in a
weighted graph. In this research, the distribution of lurah offices is modeled
in graph form, with nodes representing the location of lurah offices and edges
representing road sections with weights in the form of travel time. The results
of analysis and design using the Dijkstra algorithm show that the shortest
route to visit all village heads' offices in Kupang City starts from the Oeba
Village Head's Office and follows the CBADEFGHIJ route with a total travel time
of 55 minutes. Dijkstra's algorithm was proven to be effective in finding the
shortest route by considering travel time on each road section. By using this
algorithm in the route search application, users can easily find out the
fastest route to visit sub-district heads' offices, thereby saving time and
increasing mobility efficiency.
Download
Pages:5-8
How to cite this article:
Erna Rosani Nubatonis "Analysis and design of the shortest route search application using the Dijkstra Algorithm to visit the Lurah office in Kupang City". International Journal of Research in Advanced Engineering and Technology, Vol 10, Issue 2, 2024, Pages 5-8
Download Author Certificate
Please enter the email address corresponding to this article submission to download your certificate.