Optimizing Landmark-Based Routing and Preprocessing

Many acceleration techniques exist for the single-pair shortest path problem on road networks. Most of them have been significantly improved over the years to achieve faster preprocessing times and superior performance. In this spirit, our current work significantly improves the classic ALT (A* + Landmarks + Triangle equality) algorithm. By carefully optimizing both preprocessing and query phases, we managed to effectively minimize preprocessing time to a few seconds, making the ALT algorithm also suitable for dynamic scenarios, i.e., road networks with changing edge weights due to traffic updates. We also accelerated the query phase for both unidirectional and bidirectional versions of the ALT algorithm, providing fast enough query times (including full-path unpacking) suitable for real-time services and continental road networks.

[1]  Dieter Pfoser,et al.  Crowdsourcing computing resources for shortest-path computation , 2012, SIGSPATIAL/GIS.

[2]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[3]  Andrew V. Goldberg,et al.  Customizable Route Planning , 2011, SEA.

[4]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[5]  Sakti Pramanik,et al.  An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..

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

[7]  Peter Sanders.  Fast Priority Queues for Cached Memory , 1999, ALENEX.

[8]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[9]  Andrew V. Goldberg,et al.  Hierarchical Hub Labelings for Shortest Paths , 2012, ESA.

[10]  Dorothea Wagner,et al.  Landmark-Based Routing in Dynamic Graphs , 2007, WEA.

[11]  Peter Sanders,et al.  Distributed Evolutionary Graph Partitioning , 2011, ALENEX.

[12]  Marlon Dumas,et al.  Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs , 2011, CIKM '11.

[13]  Dieter Pfoser,et al.  Efficient data management in support of shortest-path computation , 2011, CTS '11.

[14]  Andrew V. Goldberg,et al.  The shortest path problem : ninth DIMACS implementation challenge , 2009 .

[15]  Peter Sanders,et al.  Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.

[16]  Dorothea Wagner,et al.  Partitioning graphs to speedup Dijkstra's algorithm , 2007, ACM J. Exp. Algorithmics.

[17]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[18]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.

[19]  Peter Sanders,et al.  Mobile Route Planning , 2008, ESA.

[20]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[21]  Daniel Delling,et al.  Faster Customization of Road Networks , 2013, SEA.

[22]  Andrew V. Goldberg,et al.  The Shortest Path Problem , 2009 .

[23]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.

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

[25]  Dieter Pfoser,et al.  Towards a Flexible and Scalable Fleet Management Service , 2013, IWCTS '13.

[26]  Peter Sanders,et al.  Transit Node Routing Reconsidered , 2013, SEA.

[27]  Peter Sanders,et al.  Fast Routing in Road Networks with Transit Nodes , 2007, Science.

[28]  V. Ramachandran,et al.  Priority Queues and Dijkstra ’ s Algorithm , 2007 .

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

[30]  Andrew V. Goldberg,et al.  PHAST: Hardware-Accelerated Shortest Path Trees , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[31]  Kurt Mehlhorn,et al.  Review of algorithms and data structures: the basic toolbox by Kurt Mehlhorn and Peter Sanders , 2011, SIGA.

[32]  Hiroshi Imai,et al.  A fast algorithm for finding better routes by AI search techniques , 1994, Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference.