Nobody in this world wants to be held hostage in a traffic jam for hours and hours. The need to have efficient traffic flow in our roads cannot be overemphasized. It is in this understanding that this paper delves into the study and implementation of a suitable algorithm for traffic routing. The implementation is based on graph theory, where a road network map is first converted to a graph with nodes and edges where the edges represent the roads and the nodes represent the various road intersections. The roads are given various weights depending on their distance and traffic density, and the time a motorist would take to move from one point to another is estimated. A suitable routing algorithm, which in this case is the Dijkstra’s algorithm is applied on the weighted graph.
If the inline PDF is not rendering correctly, you can download the PDF file here.
Agafonov A. & Myasnikov V. (2017). Efficiency comparison of the routing algorithms used in centralized traffic management systems. Procedia Engineering Vol. 201 265-270.
Agafonov A. & Myasnikov V. (2018). Vehicle routing algorithms based on a route reservation approach. Journal of Physics: Conference Series Vol. 1069 1-9.
Mu H. Yu J. & Liu L. (2009). Shortest path algorithm for road network with traffic restriction. IEEE 2nd International Conference on Power Electronics and Intelligent Transportation System China.
Nha V. Djahel S. & Murphy J. (2012). A comparative study of vehicles' routing algorithms for route planning in smart cities. IEEE First International Workshop on Vehicular Traffic Management for Smart Cities Ireland.