Traffic Routing Algorithm for Road Network

Abstract

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.

Personalized Road Networks Routing with Road Safety Consideration: A Case Study in Manchester

“…The nodes represent road junctions while the edges represent the roads. In terms of congestion, the weights should account for the length of the road and the traffic density [11]. Due to this, roads that have the shortest distance to the destination will not be included in the route if their traffic density is so high that it makes an alternative edge have a lower weight.…”