An Appraisal of Some Shortest-Path Algorithms
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a network; (3) determining the second, third, etc., shortest path; (4) determining the fastest path through a network with travel times depending on the departure time; and (5) finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 1,236
The shortest route through a network with time-dependent internodal transit times
Cooke, K. L., & Halsey, E. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90009-6 · Cited by 412
Solutions of the Shortest-Route Problem—A Review
Pollack, M., & Wiebenson, W. (1960) · Operations Research · doi:10.1287/opre.8.2.224 · Cited by 114
A Method for Finding the Shortest Route Through a Road Network
Whiting, P., & Hillier, J. A. (1960) · Journal of the Operational Research Society · doi:10.1057/jors.1960.32 · Cited by 63
Cited by
Finding the K Shortest Loopless Paths in a Network
Yen, J. Y. (1971) · Management Science · doi:10.1287/mnsc.17.11.712 · Cited by 2,618
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
T-drive: driving directions based on taxi trajectories
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., & Huang, Y. (2010) · Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1869790.1869807 · Cited by 1,105
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Route choice modeling: past, present and future research directions
Prato, C. G. (2009) · Journal of Choice Modelling · doi:10.1016/s1755-5345(13)70005-8 · Cited by 495
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Orda, A., & Rom, R. (1990) · Journal of the ACM · doi:10.1145/79147.214078 · Cited by 483
Heuristic search viewed as path finding in a graph
Pohl, I. (1970) · Artificial Intelligence · doi:10.1016/0004-3702(70)90007-x · Cited by 433
Auction algorithms for network flow problems: A tutorial introduction
Bertsekas, D. P. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247653 · Cited by 421
The Fastest Path through a Network with Random Time-Dependent Travel Times
Hall, R. W. (1986) · Transportation Science · doi:10.1287/trsc.20.3.182 · Cited by 404
T-Drive: Enhancing Driving Directions with Taxi Drivers' Intelligence
Yuan, J., Zheng, Y., Xie, X., & Sun, G. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.200 · Cited by 396
Fischler, M. A., Tenenbaum, J. M., & Wolf, H. C. (1981) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(81)90056-3 · Cited by 354
Steiner's problem in graphs and its implications
Hakimi, S. L. (1971) · Networks · doi:10.1002/net.3230010203 · Cited by 347
Heuristic shortest path algorithms for transportation applications: State of the art
Fu, L., Sun, D., & Rilett, L. R. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.027 · Cited by 341
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Finding shortest paths on real road networks: the case for A*
Zeng, W., & Church, R. L. (2009) · International Journal of Geographical Information Science · doi:10.1080/13658810801949850 · Cited by 327
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
A new implementation of Yen?s ranking loopless paths algorithm
Martins, E. V., & Pascoal, M. B. (2003) · Quarterly Journal of the Belgian, French and Italian Operations Research Societies · doi:10.1007/s10288-002-0010-2 · Cited by 283
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
A review of urban computing for mobile phone traces: current methods, challenges and opportunities
Jiang, S., Fiore, G. A., Yang, Y., Ferreira, J., Frazzoli, E., & González, M. C. (2013) · Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing · doi:10.1145/2505821.2505828 · Cited by 254
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2015) · arXiv · doi:10.48550/arxiv.1504.05140 · Cited by 189
An Evaluation of Lattice Solutions to the Problem of Corridor Location
Goodchild, M. F. (1977) · Environment and Planning A: Economy and Space · doi:10.1068/a090727 · Cited by 60
Metadata
- Authors
- Dreyfus, S. E.
- Venue
- Operations Research
- Published
- 1969-06
- Volume
- 17
- Issue
- 3
- Pages
- 395-412
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2144050074
- Cited by
- 1,002
- References
- 9
- FWCI
- 16.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.