Analysis of City Transportation Routes with Fleury Algorithm on Bus Route Network: Case Study of Trans Mamminasata Makassar City Indonesia

Abstract

Graph theory is a branch of mathematics that studies the structure and describes the relationships between vertices and edges. In general, graph theory is used to represent discrete objects (vertices) and the relationships between them (edges). A path that can pass through each edge exactly once in a graph is called a directed graph Euler path. One way to find Euler paths is by using Fleury's algorithm. Fleury's algorithm is designed to find Euler paths in directed graphs. This article examines the application of Fleury's algorithm to the determination of a transportation route in a city interpreted in a directed graph. The case study in this research focuses on the trans Mamminasata bus route in Makassar city Indonesia with the aim of implementing Fleury's algorithm in bus route generation. The result obtained from the simulation using Fleury's algorithm is that all edges can be visited exactly once, so that an Euler path is formed on the transportation route. The route formed from the Euler trajectory will be a comparison of the current route to determine the operational efficiency of the bus route network in the city.