Optimal time-dependent sequenced route queries in road networks

In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories of interest, we find the fastest route between an origin and destination that passes through a sequence of points of interest belonging to each of the specified categories of interest. Our approach uses the A* search paradigm equipped with an admissible heuristic function, thus guaranteed to yield the optimal solution, along with a pruning scheme for further reducing the search space. Our experiments using a real data set have shown our proposed solution to be up to two orders of magnitude faster than a previous solution extended to handle time-dependency.

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

[2]  Jean G. Vaucher,et al.  Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem , 2006, Comput. Oper. Res..

[3]  Cyrus Shahabi,et al.  Processing Optimal Sequenced Route Queries Using Voronoi Diagrams , 2008, GeoInformatica.

[4]  Yaron Kanza,et al.  TARS: traffic-aware route search , 2014, GeoInformatica.

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

[6]  Noboru Sonehara,et al.  Sequenced Route Query in Road Network Distance Based on Incremental Euclidean Restriction , 2012, DEXA.

[7]  Stefan Funke,et al.  Sequenced route queries: getting things done on the way back home , 2012, SIGSPATIAL/GIS.

[8]  Jinha Kim,et al.  Processing time-dependent shortest path queries without pre-computed speed information on road networks , 2014, Inf. Sci..

[9]  Cyrus Shahabi,et al.  The optimal sequenced route query , 2008, The VLDB Journal.

[10]  Xiang Lian,et al.  Trip Planner Over Probabilistic Time-Dependent Road Networks , 2014, IEEE Transactions on Knowledge and Data Engineering.

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

[12]  Feifei Li,et al.  On Trip Planning Queries in Spatial Databases , 2005, SSTD.

[13]  Mohammad H. Ahmadi,et al.  General Time-Dependent Sequenced Route Queries in Road Networks , 2017, 2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech).

[14]  Roger Zimmermann,et al.  The partial sequenced route query with traveling rules in road networks , 2011, GeoInformatica.

[15]  Jiajie Xu,et al.  Traffic Aware Route Planning in Dynamic Road Networks , 2012, DASFAA.

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

[17]  José Antônio Fernandes de Macêdo,et al.  Aggregate k-nearest neighbors queries in time-dependent road networks , 2012, J. Inf. Data Manag..

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

[19]  Noboru Sonehara,et al.  Optimal Sequenced Route Query Algorithm Using Visited POI Graph , 2012, WAIM.

[20]  Tanzima Hashem,et al.  Group Trip Planning Queries in Spatial Databases , 2013, SSTD.

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

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