Optimization Of Dijkstra’s Algorithm And Itsapplications

Abstract

We review recent advances in public transport route planning algorithms the modified dijkstra algorithm. However, the ideal route for public transport differs depending on the traveller's choice. The shortest route is preferred by most users as the primary criteria for the ideal route. According to our research, Dijkstra's algorithm is mainly used to find the shortest path from a single source to  all other nodes of a weighted graph. However, Dijkstra's algorithm is inefficient for planning public transport routes, because it ignores the number of transfers and walking distances. Thus, in order to minimize these drawbacks, Dijkstra's algorithm is modified. It can be seen that our modified algorithm is quite efficient for route planning in the public transport network in terms of the number of transfers, the distance of the proposed route and the walking distance.