Абстрактный

Modified Dijkstra?s Shortest Path Algorithm

S. Sivakumar, Dr. C.Chandrasekar

Roads play a vital role to the people live in different places and, from day to day, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of a shortest path between different locations appears to be a key problem in the road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. Even now the problem still persists to find the shortest path on road networks. To overcome the shortest path problem a new algorithm namely, Modified Dijkstra’s Shortest Path (MDSP) algorithm using multiple parameters is proposed in this paper. The proposed algorithm is compared with the existing algorithm to prove its efficiency.