SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

Although recent scientific literature focuses on multiple shortest-path SP problem definitions for road networks, none of the existing solutions can efficiently answer all the different SP query variations. This work proposes SALT, a novel framework that not only efficiently answers most SP queries but also k-nearest neighbor queries not tackled by previous methods. Our solution offers excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic, live-traffic road networks and all types of practical use-cases. The proposed SALT framework is a deployable software solution capturing a range of graph-related query problems under one "algorithmic hood".

[1]  Dorothea Wagner,et al.  Energy-optimal routes for electric vehicles , 2013, SIGSPATIAL/GIS.

[2]  Torben Bach Pedersen,et al.  Nearest neighbor queries in road networks , 2003, GIS '03.

[3]  Andrew V. Goldberg,et al.  Customizable Route Planning in Road Networks (Extended Abstract) , 2013, SOCS.

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

[5]  Kian-Lee Tan,et al.  G-tree: an efficient index for KNN search on road networks , 2013, CIKM.

[6]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[7]  Andrew V. Goldberg,et al.  Faster Batched Shortest Paths in Road Networks , 2011, ATMOS.

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

[9]  Ben Strasser,et al.  Customizable Contraction Hierarchies , 2014, SEA.

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

[11]  Dieter Pfoser,et al.  Isochrones, traffic and DEMOgraphics , 2013, SIGSPATIAL/GIS.

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

[13]  Dieter Pfoser,et al.  GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem , 2014, ESA.

[14]  Peter Sanders,et al.  Engineering Multilevel Graph Partitioning Algorithms , 2010, ESA.

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

[16]  Peter Sanders,et al.  Goal-directed shortest-path queries using precomputed cluster distances , 2010, JEAL.

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

[18]  A. Flatt.  Grasp , 2000, Proceedings.

[19]  Roger Zimmermann,et al.  Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks , 2011, IEEE Transactions on Knowledge and Data Engineering.

[20]  Daniel Delling,et al.  Customizable Point-of-Interest Queries in Road Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

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

[22]  Dieter Pfoser,et al.  Optimizing Landmark-Based Routing and Preprocessing , 2013, IWCTS '13.

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

[24]  Kyriakos Mouratidis,et al.  Continuous nearest neighbor monitoring in road networks , 2006, VLDB.

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

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

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

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

[29]  Andrew V. Goldberg,et al.  Customizable Route Planning in Road Networks , 2017, Transp. Sci..

[30]  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.