Contraction Hierarchies with A* for digital road maps

  • Curt Nowak
  • Felix Hahne
  • Klaus Ambrosi
Conference paper
Part of the Operations Research Proceedings book series (ORP)


One of the most successful recent approaches for solving single source - single destination problems in graphs is the Contraction Hierarchies (CH) algorithm, originally published by [3]. The general algorithm consists of two phases: Firstly, a total order on the nodes in the graph is calculated. Secondly for queries, a modified bi-directional Dijkstra-search is performed on the hierarchy implied hereby. Relying on Dijkstra’s algorithm, CH makes no use of the geometric information contained within digital road maps. We propose A*-like modifications of the original query algorithm that double query speed. Results are presented in a benchmark using a map from the OpenStreetMap project.


Optimal Path Query Time Forward Search Query Algorithm Bridge Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    BAUER, R., DELLING, D., SANDERS, P., SCHIEFERDECKER,D., SCHULTES, D., ANDWAGNER, D. Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM Journal of Experimental Algorithmics 2010, 15 (2010).Google Scholar
  2. 2.
    DIJKSTRA, E. W. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1 (1959), 269–271.CrossRefGoogle Scholar
  3. 3.
    GEISBERGER, R., SANDERS, P., SCHULTES, D., AND DELLING, D. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. Proceedings of the 7th Workshop on Experimental Algorithms (WEA’08) 5038 of Lecture Notes in Computer Science (2008), 319–333.Google Scholar
  4. 4.
    HAHNE, F. Kürzeste und schnellste Wege in digitalen Straßenkarten (Dissertation). Universität Hildesheim, Hildesheim, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institut für Betriebswirtschaft und WirtschaftsinformatikUniversität HildesheimHildesheimGermany

Personalised recommendations