| Summary: | Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected. The reasons cause the problem may be in the Returning Problem mentioned in the following paper. Shortest Path Algorithms only focus on the shortest path between the points, without paying attention to figure out the direct solution from the Starting Point to the Passing Points and finally to the Starting Point. A Shortest Path Algorithm applied in actual practice will be introduced in here, then another case will be introduced and analyzed to explain the following Algorithm: Under the Constraints of time and limit of Loading capacity, figure out the Shortest Path Algorithm through the Starting Point to the Passing Points and back to the Starting Point. At last , the algorithm is of feasibility and practicability.
|
|---|
