Optimizing Dijkstra's Algorithm for Managing Urban Traffic Using Simulation of Urban Mobility (Sumo) Software

Amenah Sufyan Mhmood Thabet and Ahmet Zengin*

Among the challenges of urbanization is traffic management as a measure of growth and progress. Recent population growth has resulted in a significant increase in vehicles, causing traffic jams that are challenging for the existing transportation networks. This congestion affects other services, including public transit, airports, road maintenance, and pollution caused by emissions of CO2 and other gases. Furthermore, it doubles the amount of fuel used. This has negative consequences for society as well as economic losses. This paper focuses on an improved Dijkstra algorithm based on traffic congestion levels to address the above problems. Improved Dijkstra algorithm can provide (a) real data collected from the map via OpenStreetMap, (b) Add four features to SUMO(Simulation of Urban Mobility) simulator software (time period, rush-hour, number of vehicles, and routing algorithm), (c) it could know congestion level for roads (d) rerouting vehicles to avoid traffic congestion. Based on the simulation results and analysis presented in the paper, it was found that the proposed improved Dijkstra algorithm increased the performance of the road traffic flow by reducing the number of related vehicles in traffic congestion and average delay time for experiment scenarios.

Keywords:

Published on: Jul 16, 2024 Pages: 206-213

Full Text PDF Full Text HTML DOI: 10.17352/amp.000124
CrossMark Publons Harvard Library HOLLIS Search IT Semantic Scholar Get Citation Base Search Scilit OAI-PMH ResearchGate Academic Microsoft GrowKudos Universite de Paris UW Libraries SJSU King Library SJSU King Library NUS Library McGill DET KGL BIBLiOTEK JCU Discovery Universidad De Lima WorldCat VU on WorldCat