Computational Optimization and Applications

, Volume 2, Issue 1, pp 47–75

The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm

Authors

  • Richard V. Helgason
    • Department of Computer Science and EngineeringSouthern Methodist University
  • Jeffery L. Kennington
    • Department of Computer Science and EngineeringSouthern Methodist University
  • B. Douglas Stewart
    • Department of Industrial EngineeringUniversity of Alabama
Article

DOI: 10.1007/BF01299142

Cite this article as:
Helgason, R.V., Kennington, J.L. & Stewart, B.D. Comput Optim Applic (1993) 2: 47. doi:10.1007/BF01299142

Abstract

Four new shortest-path algorithms, two sequential and two parallel, for the source-to-sink shortest-path problem are presented and empirically compared with five algorithms previously discussed in the literature. The new algorithm, S22, combines the highly effective data structure of the S2 algorithm of Dial et al., with the idea of simultaneously building shortest-path trees from both source and sink nodes, and was found to be the fastest sequential shortest-path algorithm. The new parallel algorithm, PS22, is based on S22 and is the best of the parallel algorithms. We also present results for three new S22-type shortest-path heuristics. These heuristics find very good (often optimal) paths much faster than the best shortest-path algorithm.

Keywords

Shortest-pathsparallel algorithms

Copyright information

© Kluwer Academic Publishers 1993