A Modified Approach of Dijkstra’s Method for Finding Shortest Path in a Weighted Directed Graph
Md. Mehedi Hassan, Md. Asadujjaman, Md. Golam Robbani · American Journal of Science Engineering and Technology · 2023
The shortest route technique is a fundamental problem in various fields, including transportation, logistics, network routing, and robotics. In this paper, we have discussed a prominent algorithm, namely Dijkstra's algorithm, and propose an alternative method for addressing these problems. A thorough comparison is conducted between the proposed algorithm and Dijkstra's algorithm, considering factors such as solution accuracy and computational efficiency. The experimental results indicate that our proposed method yields identical results to the existing method but with significantly reduced computation time. By leveraging advancements in computational power and algorithmic design, our proposed technique addresses the limitations of existing methods and offers new avenues for optimizing route planning processes. We begin by reviewing the classical algorithms commonly used for solving the shortest route problem, such as Dijkstra's algorithm. While this algorithm has proven its effectiveness over the years, it faces challenges when applied to large-scale networks and real-time applications due to its computational complexity. Our approach incorporates advanced data structures and optimization strategies to efficiently handle massive network graphs. Additionally, we integrate machine learning models to learn from historical data, allowing for the prediction of traffic patterns and considering dynamic factors in route planning.