Rancang Bangun Aplikasi Trayek Smart Untuk Rute Transportasi Umum Kota Medan Menggunakan Algoritma Dijkstra

Abstract

The high mobility of Medan's population demands an efficient and integrated public transportation system, but public transportation route information is still delivered conventionally and is difficult to access. This study aims to design and build an Android based TrayekSmart application that can help users determine the fastest public transportation route by utilizing the Dijkstra algorithm. This algorithm is used to calculate the shortest path between nodes in a route graph formed by stop points and paths between routes in Medan City. The application development process uses the Waterfall model which includes the stages of needs analysis, system design, implementation, and testing. The implementation results show that the application can display optimal routes with information on the number of nodes, estimated travel distance, and recommended routes that can be used. Functional tests show that the Dijkstra algorithm can work efficiently in the context of an urban route system. This application also received a positive response from users because it is considered able to improve understanding of public transportation routes that have been less digitally documented. With further developments such as GPS integration and regular route data updates, TrayekSmart has the potential to become a relevant digital solution in supporting a smart, efficient, and technology-based public transportation system.