Computing k-shortest path lengths in euclidean networks
暂无分享,去创建一个
In this paper, we examine the problem of finding k-shortest paths between an origin and destination pair when distances are Euclidean. Two versions of a generalized Dijkstra algorithm are compared. Computational results show that the advantage of the adaptive version (measured by total number of permanent labels) grows with both k and the network size. For large networks, the adaptive algorithm exhibits a 100:1 advantage in the number of permanent labels set.
[1] J. Bovet. An improvement on Dijkstra's method for finding the shortest path in a network , 1986 .
[2] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[3] Douglas R. Shier,et al. On algorithms for finding the k shortest paths in a network , 1979, Networks.
[4] B. L. Golden,et al. Shortest paths with euclidean distances: An explanatory model , 1978, Networks.