SISTEM APLIKASI PENENTUAN RUTE TERPENDEK PADA JARINGAN MULTI MODA TRANSPORTASI UMUM MENGGUNAKAN ALGORITMA DIJKSTRA

Abstract

Transportation costs are a significant component, average 15%-20%, even in Jakarta it can reach 25% -30% of household expenses. In Jakarta city, it has been provided several types of public transportation and the passengers are free to choose which kind of transportation is used to reach into the provided place. The transportation types in big cities that the route can be presented as graph are transjakarta bus and KRL commuter line. Shortest route determination on public transportation can be determined by Dijkstra algorithm. Transportation lane is considered as a directed and weighted graph. The points represent a vehicle stop. User input the starting and destination place, the shortest route from the starting point to all other points are determined by Dijkstra algorithm, so that the output of the shortest route from the beginning to the destination can be found. The shortest route calculation that is chosen from several alternatives route manually result the same value by using the application of shortest route determination using Dijkstra algorithm so that the application is feasible to use. Key words : Dijkstra algorithm, the shortest route, public transportation