PERFORMANCE ANALYSIS OF PATH COMPUTING ALGORITHMS IN SUMO SIMULATION TOOL

Abstract

Traffic is one of the most important issues for people in big cities. We are spending too much time in traffic due to the intensity when we are going and coming from work, school or etc. Due to the serious consequences of the increase in traffic jams people are experiencing as well as the loss of time and a rise in traffic costs. Algorithms for calculating routes are proposed to optimize vehicle routes based on real-time traffic flows or historical data. To find the shortest path used many algorithms such as Dijkstra algorithm, A * algorithm, Genetic algorithm, Floyd algorithm and Ant colony algorithm. This study aims to find out which of the best routing algorithms are tools to achieve their targets through simulation, and the study will focus on two algorithms. Therefore, by comparing the performance analysis of the two types of algorithms, it is necessary to investigate which one reaches the least edges and reach the goal in the least cost way. The study was performed using the visual SUMO simulation tool. Based on the result, the A * algorithm showed that the search time was faster than Dijkstra's algorithm.