Shortest Path Finding using Modified Dijkstra’s algorithm with Adaptive Penalty Function

Path finding is a technique that is employed extensively for determination of Shortest Path (SP) between source node and destination node. There are various path-finding algorithms like greedy algorithm, A-star algorithm and Dijkstra’s algorithm to identify the shortest path but, it still needs enhancement. So, the study proposes modified Dijkstra’s algorithm with adaptive penalty function to find the optimal shortest path among starting node and destination node using graphs and greedy methods. Also, the study utilizes three existing algorithms like Dijkstra algorithm (DA), Floyd Warshall (FW) algorithm and Bellman-Ford (BF) algorithm to determine the shortest path among the starting and destination node. The main objective of research is to find best optimal path and algorithm. Furthermore, comparison is made between proposed shortest path algorithm and DA, FW and BF algorithms. The main aim of study is to take advantage of proposed algorithm in order to reduce the computation time and enhance performance of optimum path finding technique. The study proposes effective solution algorithm in order to resolve the Shortest Path Problem (SPP) along with least estimated time. The research compares and provides the investigational outcomes for four algorithms on the basis of time complexity. The connection matrix and an undirected or directed weighted matrix are utilized by study to attain the research objective. Consequently, a matrix of paths from source node to destination node will be created. The outcomes of the study will aid in serving various real-time applications like route planning, Computer networking, path finding in social networks, transportation system and Google maps.