Solution of the shortest route problem on Trans Jogja bus routes with the Floyd Warshall algorithm

Abstract

This study aims to 1) determine the problem solving for the shortest Trans Jogja bus route from Giwangan terminal and Jombor terminal to Condongcatur terminal using the Floyd Warshall algorithm, 2) determine the optimal level of the Trans Jogja bus route from Giwangan terminal and Jombor terminal to Condongcatur terminal. This research is secondary data in the form of a map from the website of the Yogyakarta Transportation Agency. There are several stages, namely 1) determining the connected weighted directed graph matrix, 2) calculating the distance for each iteration, 3) forming the shortest final matrix. The closest distance from Giwangan terminal to Condongcatur terminal is Giwangan-Tegalturi 2-Nitikan-PA Muhammadiyah-Kol. Sugiono 2-MT Haryono-Tejokusuman-Ngabean Terminal- Hayam Wuruk-Kosudgama-Jl. Colombo (UNY) -Santren (Gejayan) -Condongcatur Terminal with the shortest distance of 15.70 km, travel time of 80 minutes, optimization rate of 54% and very low category, while the shortest route from Jombor terminal to Condongcatur terminal is Jombor-RRU Monjali Terminal 1-RRU Kentungan-Terminal Condongcatur with a distance of 4.6 km, a travel time of 16 minutes, an optimization rate of 88% and an optimal category.