Abstract
Traffic congestion is a major issue in urban city centers where lot of time and fuel is wasted on congested streets. Destination based routing by GPS and navigation apps allow motorists to identify and use preferred routes however, daily commuters on city streets need real-time guidance to use dynamic detours around congested road segments. We develop an algorithm to provide guidance to motorists passing through urban intersections in smart cities on avoiding traffic congestion ahead of them. This is accomplished by using short detours calculated by graph-based algorithms using several dynamic parameters. The parameters may include CF (congestion factor), differential distance and the density of traffic on road segments. The goal of this project is to use the power of graph-based algorithms to resolve congestion on urban streets in a smart city as soon as it is detected. In this paper, we present the design of the congestion avoidance algorithm, its implementation and the simulation results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
