Open AccessPencarian Stasiun Kereta Terdekat dengan Algoritma A Star Berbasis Android di Bekasi
Author(s) -
Ikhsan Dwikurniawan,
Herlawati Herlawati,
Robertus Suraji
Publication year - 2021
Publication title -
jurnal ict : information communication and technology/jurnal ict (information communication and technology)
Language(s) - English
Resource type - Journals
eISSN - 2303-3363
pISSN - 2302-0261
DOI - 10.36054/jict-ikmi.v20i2.401
Subject(s) - android application , a* search algorithm , android (operating system) , computer science , star (game theory) , operations research , transport engineering , algorithm , engineering , operating system , mathematics , mathematical analysis
Transportation has become one of the most important needs in daily activities in social life. Advances in information technology that exist today, can be used as a means to improve public services, one of which is in the railway sector. With advances in information technology can make it easier for people to find information quickly and easily. There are several obstacles, namely the lack of information about the nearest station route. This study aims to create an android-based nearest station search application with the shortest route to the destination station using the A STAR Algorithm. The A STAR algorithm is an algorithm that looks for the shortest route to reach the expected destination. In this study Kranji Station, Bekasi Station, East Bekasi Station, Tambun Station, Cibitung Station, Telaga Murni Station, Cikarang Station. With tests carried out from 7 times of testing, it can be ensured that 4 times the A STAR algorithm is successful in the shortest distance, 1 time the results of the A STAR algorithm are the same as Google Maps, and 2 times the A-Star algorithm shows a longer distance than Google Maps.