Open AccessAnalisa Rute Transjateng Rute Purwokerto – Purbalingga Dengan Algoritma Dijkstra
Author(s) -
Cindy Magnolia,
Pungkas Subarkah,
Reza Arief Firmanda,
Dava Patria Utama
Publication year - 2021
Publication title -
doubleclick : journal of computer and information technology
Language(s) - English
Resource type - Journals
ISSN - 2579-5317
DOI - 10.25273/doubleclick.v5i1.9593
Subject(s) - transport engineering , dijkstra's algorithm , bus rapid transit , business , government (linguistics) , computer science , engineering , public transport , shortest path problem , graph , linguistics , philosophy , theoretical computer science
Transportation has grown very rapidly in the last few decades, including in Purwokerto, one of the cities in Central Java that is developing in its economic sector where transportation is one of the facilities needed for people who need high mobility to meet their needs, one of the transportation that is in demand is BRT, To reduce congestion and support the community's economy, the government launched the BRT Trans Jateng Bukateja - Purwokerto which has travel time savings so that fuel consumption is minimal and transportation costs can be optimized. In this study, the authors analyzed the BRT Trans Jateng Bukateja – Purwokerto route using the Djikstra method to measure efficiency and the fastest mileage by paying attention to vehicle specifications on the BRT Trans Jateng Bukateja – Purwokerto, the data used is the distance between shelters, passenger capacity, operating hours, bus departure distance and bus fuel consumption.