论文信息 - A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths ∗

A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths ∗

It has been a general belief that label-setting algorithms are better choices than label-correcting algorithms for computing the shortest path distance between a source node and a destination node (one-to-one) on a network. The reason is that iterations in label-setting algorithms can be terminated whenever the destination node is scanned and permanently labeled. In this paper, a fast-performing implementation of each type of algorithm is selected based on the results of a recent study (Zhan and Noon 1998) and compared for computing one-to-one shortest paths using 10 large real road networks. The selected label-setting algorithm is Dijkstra's algorithm implemented with approximate buckets (DIKBA) and the selected label-correcting algorithm is Pallottino's graph growth algorithm implemented with two queues (TWO-Q). It is concluded that, in some situations, the TWO-Q algorithm is a better choice for computing one-to-one shortest paths on real road networks.

F. Benjamin Zhan | Charles E. Noon | C. Noon | F. Zhan

[1] F. Benjamin Zhan,et al. Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[2] Bruce A. Ralston,et al. Investment selection model for multicommodity multimodal transportation networks , 1996 .

[3] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[4] Cheng Liu,et al. A spatial decision support system for transportation policy analysis in Bangladesh , 1994 .

[5] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[6] RadzikTomasz,et al. Shortest paths algorithms , 1996 .

[7] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9] Fred W. Glover,et al. A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[10] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..