Finding Fastest Paths on A Road Network with Speed Patterns

This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should find a partitioning of I into sub-intervals. Existing methods can only be used to solve a very special case of the problem, when the leaving time is a single time instant. A straightforward solution to the allFP query is to run existing methods many times, once for every time instant in I. This paper proposes a solution based on novel extensions to the A* algorithm. Instead of expanding the network many times, we expand once. The travel time on a path is kept as a function of leaving time. Methods to combine travel-time functions are provided to expand a path. A novel lower-bound estimator for travel time is proposed. Performance results reveal that our method is more efficient and more accurate than the discrete-time approach.

[1]  Bin Jiang,et al.  I/O-efficiency of shortest path algorithms: an analysis , 1992, [1992] Eighth International Conference on Data Engineering.

[2]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[3]  Sakti Pramanik,et al.  HiTi graph model of topographical road maps in navigation systems , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

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

[5]  Elke A. Rundensteiner,et al.  Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations , 1997, VLDB.

[6]  Jignesh M. Patel,et al.  Indexing Large Trajectory Data Sets With SETI , 2003, CIDR.

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

[8]  Elke A. Rundensteiner,et al.  Hierarchical optimization of optimal path finding for transportation applications , 1996, CIKM '96.

[9]  K. Nachtigall.  Time depending shortest-path problems with applications to railway networks , 1995 .

[10]  Roger Barga,et al.  Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDE 2006, 3-7 April 2006, Atlanta, GA, USA , 2006, ICDE Workshops.

[11]  Michael Stonebraker,et al.  Heuristic Search in Data Base Systems , 1984, Expert Database Workshop.

[12]  J. Leon Zhao,et al.  Spatial data traversal in road map databases: a graph indexing approach , 1994, CIKM '94.

[13]  Divyakant Agrawal,et al.  FATES: Finding A Time dEpendent Shortest path , 2003, Mobile Data Management.

[14]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[15]  Shashi Shekhar,et al.  CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations , 1997, IEEE Trans. Knowl. Data Eng..

[16]  Shashi Shekhar,et al.  Path computation algorithms for advanced traveller information system (ATIS) , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[17]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[18]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[19]  Shashi Shekhar,et al.  Materialization Trade-Offs in Hierarchical Shortest Path Algorithms , 1997, SSD.

[20]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[21]  Soondal Park,et al.  Shortest paths in a network with time-dependent flow speeds , 1998, Eur. J. Oper. Res..

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