Implementation of the Trans Jogja Bus Nearest Route System with the Web-Based Shortest Path Method

Authors

  • Yudha Prasetya Nugraha
  • Heru Cahya Rustamaji
  • Yuli Fauziah

Abstract

Objective: To find out the process of finding the closest route using the
Web-based Shortest Path method, where each route consists of 8 routes
(1A-1B-2A-2B-3A-3B-4A-4B).
Design/method/approach: Using the Shortest Path Problem with a combination of UML and Black Box testing.
Results: The results of the tests carried out with the Shortest Path are the distances that will be generated from the starting point to the destination, where each route has its own distance. Which will be processed according to the starting point and destination point, and will produce a branch if it has the closest route that can be taken.
Authenticity/state of the art: The difference between this research and previous research lies in the technology used and the research object used. The object of research here is the Trans Jogja Bus. In this study, the system is expected to increase the efficiency of waiting time for the Trans Jogja Bus, which has a very long wait time. The technology itself in this study uses Web services as a communication bridge between users in the form of services.

Published

2026-01-22

Issue

Section

Articles