Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Citation:
Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Citation:
Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Algorithm for Shortest Path Problem with Complex Constraints
The shortest path problem with complex constraints is described, and the application of deviation algorithm, a kind of k shortest paths algorithms, to this problem is introduced. The factors that affect the efficiency of the algorithm are analyzed, and an enhancement to the algorithm is proposed to improve the efficiency. Simulation results show that this enhancement is very efficient.
ISSN 
DownLoad: