Online Computation of Fastest Path in Time-Dependent Spatial Networks

The problem of point-to-point fastest path computation in static spatial networks is extensively studied with many precomputation techniques proposed to speed-up the computation. Most of the existing approaches make the simplifying assumption that travel-times of the network edges are constant. However, with real-world spatial networks the edge travel-times are time-dependent, where the arrival-time to an edge determines the actual travel-time on the edge. In this paper, we study the online computation of fastest path in time-dependent spatial networks and present a technique which speeds-up the path computation. We show that our fastest path computation based on a bidirectional time-dependent A* search significantly improves the computation time and storage complexity. With extensive experiments using real data-sets (including a variety of large spatial networks with real traffic data) we demonstrate the efficacy of our proposed techniques for online fastest path computation.

[1]  Jiawei Han,et al.  Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach , 2007, VLDB.

[2]  Walid G. Aref,et al.  SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).

[3]  OrdaAriel,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990 .

[4]  Brian C. Dean,et al.  Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies , 2004, Networks.

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

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

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

[9]  Hua Lu,et al.  S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks , 2007, SSTD.

[10]  Farnoush Banaei Kashani,et al.  Towards modeling the traffic data on road networks , 2009, IWCTS '09.

[11]  Hanan Samet,et al.  Efficient Processing of Spatial Queries in Line Segment Databases , 1991, SSD.

[12]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[13]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[14]  Shashi Shekhar,et al.  Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results , 2007, SSTD.

[15]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[16]  Yufei Tao,et al.  Location-based spatial queries , 2003, SIGMOD '03.

[17]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[18]  Anand Ranganathan,et al.  Real-time, scalable route planning using a stream-processing infrastructure , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

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

[20]  Jing Li,et al.  Moving Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[21]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[22]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[23]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[24]  Alex S. Taylor,et al.  Machine intelligence , 2009, CHI.

[25]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[26]  Farnoush Banaei Kashani,et al.  A case for time-dependent shortest path computation in spatial networks , 2010, GIS '10.

[27]  Kurt Mehlhorn,et al.  Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings , 2008, ESA.

[28]  Xiaohui Yu,et al.  Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).

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

[30]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.

[31]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[32]  Peter Sanders,et al.  Engineering Fast Route Planning Algorithms , 2007, WEA.

[33]  Dik Lun Lee,et al.  Semantic Caching in Location-Dependent Query Processing , 2001, SSTD.

[34]  Kyriakos Mouratidis,et al.  Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.

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

[36]  Yufei Tao,et al.  Time-parameterized queries in spatio-temporal databases , 2002, SIGMOD '02.

[37]  Daniel Delling,et al.  Time-Dependent SHARC-Routing , 2008, Algorithmica.

[38]  Peter Sanders,et al.  Time-Dependent Contraction Hierarchies , 2009, ALENEX.

[39]  Jörg-Rüdiger Sack,et al.  Shortest paths in time-dependent FIFO networks using edge load forecasts , 2009, IWCTS '09.

[40]  Christian S. Jensen,et al.  The Islands Approach to Nearest Neighbor Querying in Spatial Networks , 2005, SSTD.

[41]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[42]  Leo Liberti,et al.  Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.

[43]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[44]  Martin Skutella,et al.  Time-Expanded Graphs for Flow-Dependent Transit Times , 2002, ESA.

[45]  Chengyang Zhang,et al.  Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.

[46]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[47]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[48]  Subhash Suri,et al.  On the Complexity of Time-Dependent Shortest Paths , 2011, Algorithmica.

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

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