Penerapan Algoritme Dijkstra Pada Rute Angkot Bogor Berbasis Android

Abstract

There are some problems dealing with angkot in Bogor. The problems are related to the complexity of route system and amount of angkot unit. In this research, information system was developed for guiding user in order to choose the most efficient route to reach the purpose location. The Dijkstra algorithme was employed to support the system in order to find the route that provide the shortest distance from the origin to the purpose location. The system was developed by using Java and XML programming language and evaluated by applying black box testing method. The evaluation results show that the system can succesfully meet all requirements, particularly providing the most efficient route of a certain location.