The onetoone shortestpath problem: An empirical analysis with the twotree Dijkstra algorithm
 Richard V. Helgason,
 Jeffery L. Kennington,
 B. Douglas Stewart
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Four new shortestpath algorithms, two sequential and two parallel, for the sourcetosink shortestpath 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 shortestpath trees from both source and sink nodes, and was found to be the fastest sequential shortestpath 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 S22type shortestpath heuristics. These heuristics find very good (often optimal) paths much faster than the best shortestpath algorithm.
 Title
 The onetoone shortestpath problem: An empirical analysis with the twotree Dijkstra algorithm
 Journal

Computational Optimization and Applications
Volume 2, Issue 1 , pp 4775
 Cover Date
 199306
 DOI
 10.1007/BF01299142
 Print ISSN
 09266003
 Online ISSN
 15732894
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Shortestpaths
 parallel algorithms
 Industry Sectors
 Authors

 Richard V. Helgason ^{(1)}
 Jeffery L. Kennington ^{(1)}
 B. Douglas Stewart ^{(2)}
 Author Affiliations

 1. Department of Computer Science and Engineering, Southern Methodist University, 752750122, Dallas, TX
 2. Department of Industrial Engineering, University of Alabama, 354060288, Tuscaloosa, AL