Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 29 June 2018

TransTrip: A Shortest Path Finding Application for Jakarta Public Transportation using Dijkstra Algorithm

Rini Wongso1, Cin Cin1, Suhartono1 & Joseph1

Journal of Computer Science, Volume 14, Issue 7, pp. 939–944 · doi.org/10.3844/jcssp.2018.939.944

9,328 accesses6,141 downloads4 citations (Crossref)Metrics
Cite Check for updates

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.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Wongso, R., Cin, C., Suhartono, & Joseph, (2018). TransTrip: A Shortest Path Finding Application for Jakarta Public Transportation using Dijkstra Algorithm. Journal of Computer Science, 14(7), 939–944. https://doi.org/10.3844/jcssp.2018.939.944

Licence
CC BY 3.0
Issue
Volume 14, Issue 7
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
TransTrip: A Shortest Path Finding Application for Jakarta Public Transportation using Dijkstra AlgorithmJournal of Computer Science · Volume 14, Issue 7 · pp. 939–944 · CC BY 3.0Download