Mining fastest path from trajectories with multiple destinations in road networks

Nowadays, research on Intelligent Transportation System (ITS) has received many attentions due to its broad applications, such as path planning, which has become a common activity in our daily life. Besides, with the advances of Web 2.0 technologies, users are willing to share their trajectories, thus providing good resources for ITS applications. To the best of our knowledge, there is no study on the fastest path planning with multiple destinations in the literature. In this paper, we develop a novel framework, called Trajectory-based Path Finding (TPF), which is built upon a novel algorithm named Mining-based Algorithm for Travel time Evaluation (MATE) for evaluating the travel time of a navigation path and a novel index structure named Efficient Navigation Path Search Tree (ENS-Tree) for efficiently retrieving the fastest path. With MATE and ENS-tree, an efficient fastest path finding algorithm for single destination is derived. To find the path for multiple destinations, we propose a novel strategy named Cluster-Based Approximation Strategy (CBAS), to determine the fastest visiting order from specified multiple destinations. Through a comprehensive set of experiments, we evaluate the proposed techniques employed in the design of TPF and show that MATE, ENS-tree and CBAS produce excellent performance under various system conditions.

[1]  Shuo-Yan Chou,et al.  Location determination of mobile devices for an indoor WLAN application using a neural network , 2009, Knowledge and Information Systems.

[2]  M. Parent,et al.  Rule based prediction of fastest paths on urban networks , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[3]  J. W. C. van Lint,et al.  Online Learning Solutions for Freeway Travel Time Prediction , 2008, IEEE Transactions on Intelligent Transportation Systems.

[4]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

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

[6]  Cyrus Shahabi,et al.  A hybrid aggregation and compression technique for road network databases , 2008, Knowledge and Information Systems.

[7]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[8]  Vincent S. Tseng,et al.  Efficient mining and prediction of user behavior patterns in mobile web systems , 2006, Inf. Softw. Technol..

[9]  Yves Duthen,et al.  Improvement of a Shortest Routes Algorithm , 2007, 2007 IEEE Intelligent Transportation Systems Conference.

[10]  Shlomo Bekhor,et al.  Evaluation of choice set generation algorithms for route choice models , 2006, Ann. Oper. Res..

[11]  V.S. Tseng,et al.  Efficiently mining gene expression data via a novel parameterless clustering method , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[12]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[13]  Xing Xie,et al.  Mining interesting locations and travel sequences from GPS trajectories , 2009, WWW '09.

[14]  Sudhir Kumar Barai,et al.  Data mining applications in transportation engineering , 2003 .

[15]  Bruce L. Golden,et al.  Solving the traveling salesman problem with annealing-based heuristics: a computational study , 2002, IEEE Trans. Syst. Man Cybern. Part A.

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

[17]  Xing Xie,et al.  Mining Individual Life Pattern Based on Location History , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

[18]  Eamonn J. Keogh,et al.  A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.

[19]  Zohar Yakhini,et al.  Clustering gene expression patterns , 1999, J. Comput. Biol..

[20]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[21]  Cheng-Yan Kao,et al.  Solving traveling salesman problems by combining global and local search mechanisms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[22]  Mark Levene,et al.  Data Mining of User Navigation Patterns , 1999, WEBKDD.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Anne M. Denton,et al.  Pattern-based time-series subsequence clustering using radial distribution functions , 2009, Knowledge and Information Systems.

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

[26]  Chia-Ching Lin,et al.  Mining the Shortest Path within a Travel Time Constraint in Road Network Environments , 2008, 2008 11th International IEEE Conference on Intelligent Transportation Systems.

[27]  Man Hon Wong,et al.  Mining Popular Paths in a Transportation Database System with Privacy Protection , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[28]  Faramroze Engineer.  Fast Shortest Path Algorithms for Large Road Networks , .

[29]  Barry Smyth,et al.  Predicting navigation patterns on the mobile-internet using time of the week , 2005, WWW '05.

[30]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

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

[32]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[33]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[34]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[35]  Emilio Luque,et al.  A Computational Approach to TSP Performance Prediction Using Data Mining , 2007, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07).

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

[37]  Yongtaek Lim,et al.  A SHORTEST PATH ALGORITHM FOR REAL ROAD NETWORK BASED ON PATH OVERLAP , 2005 .

[38]  A. El-Rabbany.  Introduction to GPS: The Global Positioning System , 2002 .

[39]  Barry Smyth,et al.  Time based patterns in mobile-internet surfing , 2006, CHI.

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

[41]  Petros A. Ioannou,et al.  Real-Time Estimation of Travel Times Along the Arcs and Arrival Times at the Nodes of Dynamic Stochastic Networks , 2008, IEEE Transactions on Intelligent Transportation Systems.

[42]  Wen-Chih Peng,et al.  CarWeb: A Traffic Data Collection Platform , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).