Engineering Highway Hierarchies

  • Peter Sanders
  • Dominik Schultes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4168)


In [1], we presented a shortest path algorithm that allows fast point-to-point queries in graphs using preprocessed data. Here, we give an extensive revision of our method. It allows faster query and preprocessing times, it reduces the size of the data obtained during the preprocessing and it deals with directed graphs. Some important concepts like the neighbourhood radii and the contraction of a network have been generalised and are now more flexible. The query algorithm has been simplified: it differs only by a few lines from the bidirectional version of Dijkstra’s algorithm. We can prove that our algorithm is correct even if the graph contains several paths of the same length.

Experiments with real-world road networks confirm the effectiveness of our approach. Preprocessing the network of Western Europe, which consists of about 18 million nodes, takes 15 minutes and yields 68 bytes of additional data per node. Then, random queries take 0.76 ms on average. If we are willing to accept slower query times (1.38 ms), the memory usage can be decreased to 17 bytes per node. For the European and the US road networks, we can guarantee that at most 0.05% of all nodes are visited during any query.


Short Path Road Network Neighbourhood Size Query Time Highway Network 
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.
    Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568–579. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Goldberg, A.V., Harrelson, C.: Computing the shortest path: A * meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165 (2005)Google Scholar
  3. 3.
    Willhalm, T.: Engineering Shortest Path and Layout Algorithms for Large Graphs. PhD thesis, Universität Karlsruhe (TH), Fakultät für Informatik (2005)Google Scholar
  4. 4.
    Schultes, D.: Fast and exact shortest path queries using highway hierarchies. Master’s thesis, Universität des Saarlandes (2005)Google Scholar
  5. 5.
    Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments (2004)Google Scholar
  6. 6.
    Goldberg, A., Kaplan, H., Werneck, R.: Reach for A *: Efficient point-to-point shortest path algorithms. In: Workshop on Algorithm Engineering & Experiments (2006)Google Scholar
  7. 7.
    UA Census 2000 TIGER/Line Files, U.S. Census Bureau, Washington, DC (2002),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Peter Sanders
    • 1
  • Dominik Schultes
    • 1
  1. 1.Universität Karlsruhe (TH)KarlsruheGermany

Personalised recommendations