Aplikasi Pencarian Lokasi Tambal Ban Di Wilayah Jakarta Utara Menggunakan Metode A*(Star) dan Haversine
Total View This Week0
Total View This Week0
Institusion
Institut Teknologi Perusahaan Listrik Negara
Author
Ilham, Muhammad
Djunaidi, Karina
Prayitno, Budi
Djunaidi, Karina
Prayitno, Budi
Subject
Teknik Informatika
Datestamp
2022-09-23 07:51:59
Abstract :
The obstacles that are often experienced by motorized vehicle users on the road are leaking tires and having difficulty finding information about the location of the nearest tire patch. The purpose of this research is to build a tire patch location search application in the North Jakarta area which is implemented on the Android platform. The application is built using the A * (Star) method in determining the shortest route, where this method is known for finding the path that connects each node and the Haversine method as determining the location of the nearest tire patch, by drawing a straight line from the starting node to the destination node. With this application, users get information in the form of a list of closest tire patches, routes to destinations and detailed tire patch information. The test results of this application are able to display detailed information, the location and the shortest route to the tire patch, from the initial location to the destination location. The search for the shortest route using the A * (Star) method can be applied and makes it easier for users, and determining the location of the closest tire patch using the Haversine method can help reduce time and energy in searching efforts without knowing the location of the tire patch
The obstacles that are often experienced by motorized vehicle users on the road are leaking tires and having difficulty finding information about the location of the nearest tire patch. The purpose of this research is to build a tire patch location search application in the North Jakarta area which is implemented on the Android platform. The application is built using the A * (Star) method in determining the shortest route, where this method is known for finding the path that connects each node and the Haversine method as determining the location of the nearest tire patch, by drawing a straight line from the starting node to the destination node. With this application, users get information in the form of a list of closest tire patches, routes to destinations and detailed tire patch information. The test results of this application are able to display detailed information, the location and the shortest route to the tire patch, from the initial location to the destination location. The search for the shortest route using the A * (Star) method can be applied and makes it easier for users, and determining the location of the closest tire patch using the Haversine method can help reduce time and energy in searching efforts without knowing the location of the tire patch
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
