The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Heuristic shortest path algorithms for transportation applications: State of the art
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Axten, N., Newell, A., & Simon, H. A. (1973) · Contemporary Sociology · doi:10.2307/2063712 · Cited by 6,834
Newell, A. (1972) · Cited by 6,222
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
Planning in a hierarchy of abstraction spaces
Sacerdoti, E. D. (1974) · Artificial Intelligence · doi:10.1016/0004-3702(74)90026-5 · Cited by 1,155
Heuristics: Intelligent Search Strategies for Computer Problem Solving
(1986) · Telematics and Informatics · doi:10.1016/s0736-5853(86)80081-8 · Cited by 1,072
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Korf, R. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90054-4 · Cited by 917
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 756
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 743
Evidence of hierarchies in cognitive maps
Hirtle, S. C., & Jonides, J. (1985) · Memory & Cognition · doi:10.3758/bf03197683 · Cited by 655
Hierarchical structure in perceptual representation
Palmer, S. E. (1977) · Cognitive Psychology · doi:10.1016/0010-0285(77)90016-0 · Cited by 630
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Zhan, F. B., & Noon, C. E. (1998) · Transportation Science · doi:10.1287/trsc.32.1.65 · Cited by 570
Algorithm 360: shortest-path forest with topological ordering [H]
Dial, R. B. (1969) · Communications of the ACM · doi:10.1145/363269.363610 · Cited by 369
Planning as search: A quantitative approach
Korf, R. E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90051-8 · Cited by 363
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
An efficient path computation model for hierarchically structured topographical road maps
Jung, S., & Pramanik, S. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033772 · Cited by 229
Chabini, I., & Lan, S. (2002) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/6979.994796 · Cited by 221
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Denardo, E. V., & Fox, B. L. (1979) · Operations Research · doi:10.1287/opre.27.1.161 · Cited by 198
A conceptual model of wayfinding using multiple levels of abstraction
Timpf, S., Volta, G. S., Pollock, D. W., & Egenhofer, M. J. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55966-3_21 · Cited by 169
Enhanced iterative-deepening search
Reinefeld, A., & Marsland, T. A. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.297950 · Cited by 133
Bidirectional Heuristic Search Reconsidered
Kaindl, H., & Kainz, G. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.460 · Cited by 132
Shortest paths in euclidean graphs
Sedgewick, R., & Vitter, J. S. (1986) · Algorithmica · doi:10.1007/bf01840435 · Cited by 127
A fast algorithm for finding better routes by AI search techniques
Ikeda, T., Hsu, M.-Y., Imai, H., Nishimura, S., SHIMOURA, H., Hashimoto, T., TENMOKU, K., & Mitoh, K. (2002) · Vehicle Navigation and Information Systems Conference (VNIS) · doi:10.1109/vnis.1994.396824 · Cited by 99
BS∗: An admissible bidirectional staged heuristic search algorithm
Kwa, J. B. H. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90069-6 · Cited by 82
A computational study of routing algorithms for realistic transportation networks
Jacob, R., MARATHE, M. V., & Nagel, K. (1999) · ACM Journal of Experimental Algorithmics · doi:10.1145/347792.347814 · Cited by 80
Materialization trade-offs in hierarchical shortest path algorithms
Shekhar, S., Fetterer, A., & Goyal, B. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63238-7_26 · Cited by 68
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
A metric space approach to the specification of the heuristic function for the A* algorithm
Passino, K. M., & Antsaklis, P. J. (1994) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.259697 · Cited by 33
REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH
Karimi, H. A. (1996) · Journal of Intelligent Transportation Systems · doi:10.1080/10248079608903712 · Cited by 22
Route guidance with unspecified staging posts using genetic algorithm for car navigation systems
Kanoh, H., & Nakamura, N. (2002) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2000.881028 · Cited by 22
Real-time route planning in road networks
Guzolek, J., & Koch, E. (2003) · Vehicle Navigation and Information Systems Conference (VNIS) · doi:10.1109/vnis.1989.98758 · Cited by 18
Real-Time Route Selection Using Genetic Algorithms for Car Navigation Systems
BUI, L. T. H., KASHIWAZAKI, A., Takahashi, Y., & Kanoh, H. (2000) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr1965.36.789 · Cited by 14
Cited by
Map-matching for low-sampling-rate GPS trajectories
Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., & Huang, Y. (2009) · Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1653771.1653820 · Cited by 797
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
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
Exact Routing in Large Road Networks Using Contraction Hierarchies
Geisberger, R., Sanders, P., Schultes, D., & Vetter, C. (2012) · Transportation Science · doi:10.1287/trsc.1110.0401 · Cited by 323
Diakaki, C., Papageorgiou, M., Papamichail, I., & Nikolos, I. (2015) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2015.03.015 · Cited by 112
Metadata
- Authors
- Fu, L., Sun, D., & Rilett, L. R.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2006-11
- Volume
- 33
- Issue
- 11
- Pages
- 3324-3343
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2017694061
- Cited by
- 341
- References
- 41
- FWCI
- 26.18
- 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.