Robust, Almost Constant Time Shortest-Path Queries in Road Networks

When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions. Recently, other research groups and we have largely independently developed this informal observation into transit node routing, a technique for reducing quickest-path queries in road networks to a small number of table lookups. The contribution of our paper is twofold. First, we present a generic framework for transit node routing that allows almost constant time routing for both global and local queries. Second, we develop a highly tuned implementation using highway hierarchies. For the road maps of Western Europe and the United States, our best query times improve over the best previously published figures by two orders of magnitude. This is more than one million times faster than the best known algorithm for general networks. We also explain how to compute complete descriptions of shortest paths (and not only their lengths) very efficiently.

[1]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[2]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[3]  Dorothea Wagner,et al.  Drawing Graphs to Speed Up Shortest-Path Computations , 2005, ALENEX/ANALCO.

[4]  Christos D. Zaroliagis,et al.  Using Multi-level Graphs for Timetable Information in Railway Systems , 2002, ALENEX.

[5]  Peter Sanders,et al.  Engineering highway hierarchies , 2006, JEAL.

[6]  Rolf H. Möhring,et al.  Partitioning Graphs to Speed Up Dijkstra's Algorithm , 2005, WEA.

[7]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[8]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[9]  Dorothea Wagner,et al.  Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs , 2003, ESA.

[10]  Frank Schulz,et al.  High-Performance Multi-Level Graphs ∗ , 2006 .

[11]  Mikkel Thorup,et al.  Compact oracles for reachability and approximate distances in planar digraphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Dominik Schultes,et al.  Engineering and applications track - engineering highway hierarchies , 2006 .

[14]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[15]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[16]  Peter Sanders,et al.  Highway Hierarchies Star , 2006, The Shortest Path Problem.

[17]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[18]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[19]  D. Delling Design and Implementation of an Efficient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs , 2006 .

[20]  Peter Sanders,et al.  Computing Many-to-Many Shortest Paths Using Highway Hierarchies , 2007, ALENEX.

[21]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[22]  A. Goldberg,et al.  TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing , 2006 .