ABSTRACT It is well known that computing shortest paths over a network is an important task in many network and transportation related analyses. Choosing an adequate algorithm from the numerous algorithms reported in the literature is a critical step in many applications involving real road networks. In a recent study, a set of three shortest path algorithms that run fastest on real road networks has been identified. These three algorithms are: 1) the graph growth algorithm implemented with two queues, 2) the Dijkstra algorithm implemented with approximate buckets, and 3) the Dijkstra algorithm implemented with double buckets. As a sequel to that study, this paper reviews and summarizes these three algorithms, and demonstrates the data structures and procedures related to the algorithms. This paper should be particularly useful to researchers and practitioners in transportation, GIS,
|
4344
|
Maximum likelihood from incomplete data via the EM algorithm
– Dempster, Laird, et al.
- 1977
|
|
811
|
Network flows: theory, algorithms, and applications
– Ahuja, Magnanti, et al.
- 1993
|
|
165
|
Efficient and Adaptive Estimation for Semiparametric Models
– Bickel, Klaassen, et al.
- 1993
|
|
113
|
Shortest Paths Algorithms: Theory and Experimental Evaluation
– Cherkassky, Goldberg, et al.
- 1996
|
|
88
|
Order Restricted Statistical Inference
– Robertson, Wright, et al.
- 1988
|
|
86
|
Statistical inference under order restrictions
– Barlow, Bartholomew, et al.
- 1972
|
|
84
|
Nonlinear Programming: Analysis and Methods
– Avriel
- 1976
|
|
82
|
A Note on Two
– Dijkstra
|
|
81
|
Faster algorithms for the shortest path problem
– Ahuja, Mehlhorn, et al.
- 1990
|
|
66
|
Information Bounds and Nonparametric Maximum Likelihood Estimation
– Groeneboom, Wellner
- 1992
|
|
56
|
Algorithm 360: Shortest Path Forest with Topological Ordering
– Dial
- 1969
|
|
49
|
Shortest Paths Algorithms
– Gallo, Pallottino
- 1988
|
|
38
|
The Empirical Distribution Function with Arbitrarily Grouped, Censored and Truncated Data
– Turnbull
- 1976
|
|
35
|
Non- and semi- parametric maximum likelihood estimators and the von Mises method (part 1). Scand
– Gill
- 1989
|
|
34
|
A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees,” Networks 9
– DIAL, GLOVER, et al.
- 1979
|
|
30
|
Nonparametric maximum likelihood estimation of a mixture distribution
– Laird
- 1978
|
|
30
|
Shortest path algorithms: an evaluation using real road networks
– Zhan, Noon
- 1998
|
|
21
|
The two sample problem with censored data
– Efron
- 1967
|
|
16
|
A new polynomial bounded shortest path algorithm
– Glover, Klingman, et al.
- 1986
|
|
16
|
Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem
– PAPE
- 1974
|
|
14
|
A heuristic improvement of the bellmanford algorithm
– Goldberg, Radzik
- 1993
|
|
13
|
A Computational Study of Efficient Shortest Path Algorithms
– Hung, Divoky
- 1988
|
|
13
|
Weak convergence of a self-consistent estimator of the survival function with doubly censored data
– Chang
- 1990
|
|
13
|
Asymptotic properties of self-consistent estimators based on doubly censored data
– Gu, Zhang
- 1993
|
|
13
|
Three statistical inverse problems
– Jongbloed
- 1995
|
|
11
|
Shortest Path Algorithms: A Computational Study with the C Programming Language
– MONDOU, CRAINIC, et al.
- 1991
|
|
11
|
On convergence of convex minorant algorithms for distribution estimation with interval-censored data
– Aragon, Eberly
- 1992
|
|
11
|
Strong consistency of a nonparametric estimator of the survival function with doubly censored data
– Chang, Yang
- 1987
|
|
7
|
A large sample study of generalized maximum likelihood estimators from incomplete data via self-consistency
– Tsai, Crowley
- 1985
|
|
7
|
Efficiency of infinite dimensional M-estimators
– Vaart
- 1995
|
|
5
|
A generalized two-sample Wilcoxon test for doubly censored data
– Gehan
- 1965
|
|
4
|
Ranking procedures for arbitrarily restricted observations
– Mantel
- 1967
|
|
4
|
Experimental survival curves for interval censored data
– Peto
- 1973
|
|
2
|
Shortest-Path Methods
– Pallottino
- 1984
|
|
2
|
Generalized Cram'er-Von Mises tests of goodness of fit for doubly censored
– Ren
- 1995
|
|
2
|
Asymptotic theory for nonparametric estimators from doubly censored data
– Samuelson
- 1989
|
|
1
|
The Road Not Taken
– Erkut
- 1996
|
|
1
|
Beyond Assessment of Resources: Procurement of Woody Biomass Fuels
– B
- 1996
|
|
1
|
A Spatial Decision Support System for Transportation Policy Analysis
– Ralston, Tharakan, et al.
- 1994
|
|
1
|
Shortest Path Algorithms: Evaluation and Implementation in C. Research Report
– Zhan
- 1995
|
|
1
|
A hierarchy of drug use in adolescence: behavioral and attitudinal correlates of substantial drug use
– Hamburg, Kraemer, et al.
- 1975
|
|
1
|
African infant precocity and some social influences during the first year
– Leiderman, Barbu, et al.
- 1973
|
|
1
|
Nonparametric estimation of a survival ship function with doubly censored data
– Turnbull
- 1974
|
|
1
|
A likelihood ratio statistic for testing goodness of fit with randomly censored data
– Turnbull, Weiss
- 1978
|
|
1
|
Bootstrapping functional Mestimators
– Wellner, Zhan
- 1995
|
|
1
|
http://publish.uwo.ca/~jmalczew/gida_1/Zhan/Zhan.htm (11 of 12) [7/14/2001 5:12:03 PM] Three Fastest Shortest Path Algorithms on Real Road Networks
– Zhan
- 1995
|
