Fuzzy shortest path approach for determining public bus route (Case study : Route planning for "Trans Bantul bus" in Yogyakarta, Indonesia). (17th February 2021)

• Record Type: Journal Article
• Authors: Rosyida, Isnaini; Asih, Tri Sri Noor; Waluya, S. B.; Sugiyanto,
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 24:Number 2(2021)
• Page Start: 557
• Page End: 577
• Publication Date: 2021-02-17
• Subjects: Primary 05C38 -- Secondary 05C90; Shortest path -- Chuang-Kung algorithm -- Yadav-Biswas algorithm -- Fuzzy network -- Triangular fuzzy number; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2021.1891692
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Fuzzy graph became a nice tool for modeling and designing a network that contains indeterminacy. Public transportation has become a necessity in Bantul Regency because it is one of the regions that became popular in Yogyakarta Special Region Province (YSR), Indonesia. There are many tourism sectors in Bantul that became favourite destinations in recent years. However, we cannot obtain convenient public transportation that connects the favourite destinations in Bantul. Therefore, it is needed a bus rapid transit (BRT) in Bantul which will be called as "Trans Bantul". The problem is how to determine optimal routes that connect public facilities in Bantul. In the real problem cases, a route between two places contains indeterminate parameters, such as distance, time, and cost. Hence, it is suitable to represent the bus stops and all possible roads in a fuzzy network, especially fuzzy weighted network. In this research, we use fuzzy shortest path approach to find optimal routes for public bus. We design an algorithm to determine optimal routes based on fuzzy shortest path algorithm. We construct a Matlab code according to a combination of Chuang-Kung and Yadav-Biswas algorithms. The weights on the network are the distances between two bus stops which are represented in triangular fuzzy numbers and we use the code to find the optimal routes. We have implemented the algorithm for route planning of the BRT "Trans Bantul" in Yogyakarta, Indonesia. The experimental results show that we can use three routes where the shortest distance in route 1 is 30.8 Km; the shortest distance in route 2 is 26.8 Km; and the shortest distance in route 3 is 20.8 Km. Further, the information of the bus routes is displayed in the Matlab GUI.