@article {10.3844/jcssp.2018.939.944,
article_type = {journal},
title = {TransTrip: A Shortest Path Finding Application for Jakarta Public Transportation using Dijkstra Algorithm},
author = {Wongso, Rini and Cin, Cin and Suhartono, and Joseph,},
volume = {14},
number = {7},
year = {2018},
month = {Jun},
pages = {939-944},
doi = {10.3844/jcssp.2018.939.944},
url = {https://thescipub.com/abstract/jcssp.2018.939.944},
abstract = {Government of Jakarta, the capital of Indonesia, highlighted congestion as one of the issues that must be addressed immediately. The high population of Jakarta increases the number of vehicles operating on the streets and causes congestion that leads to a loss of 67.5 trillion rupiah. The development of adequate public transport facilities is expected to be one of the solution, such as TransJakarta which has flat and low price. The bus fleets of TransJakarta are also equipped with air-conditioning. However, the level of public transport users is still quite low because the use of public transport is considered ineffective as it usually cost longer time to reach a destination. Based on the factors, the authors are encouraged to develop an Android-based application, “TransTrip”, to provide clear information about the shortest path using Dijkstra algorithm and the type of public transportation that can be used to reach a destination, form a source location, with TransJakarta as the main transport and other public transport such as Angkot and Metromini to complete the routes. Notification to stop and transit features are included in TransTrip to answer the current needs of the community.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}