Towards Shortest Path Finding System Using Fuzzy-Dijkstra Method for Emergency Routing Problem
Gholyf Fahry Al Mustafid, Prima Kristalina, I Gede Puja Astawa · 2022 International Electronics Symposium (IES) · 2022
Traffic congestion is one of the causes of slow assistance to accident victims in a big city. With such a large population and high mobility, the accumulation of traffic during peak hours on the road causes difficulty in accessing ambulances - in charge of transporting accident victims, or cops - in charge of breaking traffic jams, to quickly go to the accident scene. The method of finding the shortest path is the right solution to get an alternative route that can be used by ambulance drivers or cops to go to their destination immediately. This paper proposes a combination of the Fuzzy-Dijkstra method for finding the shortest path. This method is an improvement of the Dijkstra, which only considers distance as a weight in determining the shortest path. By adding the Fuzzy Sugeno method, we set the road density and road section length as the weight parameters of each path. The Dijkstra algorithm will be executed using the weights that have been generated from Fuzzy, to calculate the shortest path. The experimental results showed that the weight value of the Fuzzy with 5 membership functions yields a shorter path better than 3 membership functions. The more reference nodes that are used as vertexes on the graph, it forms the shorter and more compact path. Meanwhile, the accuracy of the proposed system is 86.72% when compared to the optimal distance by Google Map. The reason is that Google Map has a large coverage area and more detailed geographical information.