Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra's Algorithm

Finding the shortest path in the road networks is an urgent issue for the vehicle driver to reach their destination in the shortest time which leads to consuming less fuel. In this article, a framework has been suggested to direct vehicle drivers to their destination in a shortest time taking into account the actual distance and the traffic jam of the road network. The framework consists of three stages: data clustering stage, merging stage, and determining of shortest path stage. The experimental results illustrate that the proposed framework has similar accuracy (98%) to find a shortest path as compared with existing work; on the other hand, the running time of the RN-CMS was the shortest running time; it has been achieved (1.05 s) for 100 inquires.