The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Exact Routing in Large Road Networks Using Contraction Hierarchies
Open accessAbstract
Contraction hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handles road networks of whole continents. During a preprocessing step, we exploit the inherent hierarchical structure of road networks by adding shortcut edges. A subsequent modified bidirectional Dijkstra algorithm can then find a shortest path in a fraction of a millisecond, visiting only a few hundred nodes. This small search space makes it suitable to implement it on a mobile device. We present a mobile implementation that also handles changes in the road network, like traffic jams, and that allows instantaneous routing without noticeable delay for the user. Also, an algorithm to calculate large distance tables is currently the fastest if based on contraction hierarchies.
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
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
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Self-citationEngineering Route Planning Algorithms
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02094-0_7 · Cited by 454
Self-citationHeuristic 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
Highway Hierarchies Hasten Exact Shortest Path Queries
Sanders, P., & Schultes, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11561071_51 · Cited by 327
Self-citationA Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20662-7_20 · Cited by 254
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Self-citationFast point-to-point shortest path computations with arc-flags
Hilger, M., Köhler, E., Möhring, R. H., & Schilling, H. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/03 · Cited by 184
Schultes, D., & Sanders, P. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_6 · Cited by 179
Self-citationModeling Costs of Turns in Route Planning
Winter, S. (2002) · GeoInformatica · doi:10.1023/a:1020853410145 · Cited by 172
SHARC: Fast and robust unidirectional routing
Bauer, R., & Delling, D. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1498698.1537599 · Cited by 156
Highway dimension, shortest paths, and provably efficient algorithms
Abraham, I., Fiat, A., Goldberg, A. V., Werneck, R. F., Octavius, G., & Caesar, T. A. (2010) · Cited by 145
PHAST: Hardware-accelerated shortest path trees
Delling, D., Goldberg, A. V., Nowatzyk, A. G., & Werneck, R. F. (2012) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2012.02.007 · Cited by 140
Route Planning in Road Networks
Schultes, D. (2008) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000007755 · Cited by 135
Self-citationComputing Many-to-Many Shortest Paths Using Highway Hierarchies
Knopp, S., Sanders, P., Schultes, D., Schulz, F., & Wagner, D. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972870.4 · Cited by 132
Self-citationLandmark-Based Routing in Dynamic Graphs
Delling, D., & Wagner, D. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_5 · Cited by 129
Time-Dependent Contraction Hierarchies
Batz, G. V., Delling, D., Sanders, P. W., & Vetter, C. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972894.10 · Cited by 99
Self-citationGoldberg, A. V., Kaplan, H. Y., & Werneck, R. F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72845-0_4 · Cited by 93
Graph indexing of road networks for shortest path queries with label restrictions
Rice, M. N., & Tsotras, V. J. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1921071.1921074 · Cited by 88
Goal-directed shortest-path queries using precomputed cluster distances
Maue, J., Sanders, P., & Matijević, D. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1498698.1564502 · Cited by 76
Self-citationReach for A*: shortest path algorithms with preprocessing
Goldberg, A. V., Kaplan, H. Y., & Werneck, R. F. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/05 · Cited by 75
Route Planning with Flexible Objective Functions
Geisberger, R., Kobitzsch, M., & Sanders, P. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972900.12 · Cited by 62
Self-citationDistributed Time-Dependent Contraction Hierarchies
Kieritz, T., Luxen, D., Sanders, P., & Vetter, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_8 · Cited by 59
Self-citationSanders, P., Schultes, D., & Vetter, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_61 · Cited by 54
Self-citationPreprocessing Speed-Up Techniques Is Hard
Bauer, R., Columbus, T., Katz, B., Krug, M., & Wagner, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13073-1_32 · Cited by 51
Contraction of Timetable Networks with Realistic Transfers
Geisberger, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_7 · Cited by 49
Self-citation
Cited by
A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles
Paden, B., Cap, M., Yong, S. Z., Yershov, D., & Frazzoli, E. (2016) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2016.2578706 · Cited by 2,585
A Survey of Autonomous Driving: Common Practices and Emerging Technologies
Yurtsever, E., Lambert, J., Carballo, A., & Takeda, K. (2020) · IEEE Access · doi:10.1109/access.2020.2983149 · Cited by 1,889
“Contraction Hierarchies (CH) method was proposed in [247]”
MethodBadue, C., Guidolini, R., Carneiro, R. V., Azevedo, P., Cardoso, V. B., Forechi, A., Jesus, L., Berriel, R., Paixão, T. M., Mutz, F., et al. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113816 · Cited by 1,209
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
Self-citationRoute 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
Self-citation
Metadata
- Authors
- Geisberger, R., Sanders, P., Schultes, D., & Vetter, C.
- Venue
- Transportation Science
- Published
- 2012-08
- Volume
- 46
- Issue
- 3
- Pages
- 388-404
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2143083884
- Cited by
- 323
- References
- 28
- FWCI
- 26.47
- Type
- journal article
- Language
- en
- Open access
- green
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.