A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path

Path optimization is especially useful for improving freight efficiency, and the problem of finding the maximum load path is an important issue in path optimization. Although the problem of finding the shortest path is similar to the problem of finding the maximum load path, the Dijkstra's algorithm for solving the problem of finding the shortest path is not suitable for solving the problem of finding the maximum load path. In this paper, the Dijkstra's algorithm for solving the problem of finding the shortest path is introduced, and the Dijkstra's algorithm is modified to solve the problem of finding the maximum load path. Finally, the running process of the modified Dijkstra's algorithm is described by an example.