Skip to main content
SpringerLink
Log in

Mining fastest path from trajectories with multiple destinations in road networks

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrawal R, Imielinski T, Swami A (1993) Mining association rule between sets of items in large databases. In: Proceedings of ACM SIGMOD conference on management of data, pp 207–216

  2. Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of international conference on data engineering, pp 3–14

  3. Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45: 753–782

    Article  MathSciNet  MATH  Google Scholar 

  4. Awasthi A, Lechevallier Y, Parent M et al (2005) Rule based prediction of fastest paths on urban networks. In: Proceedings of 8th IEEE conference on intelligent transportation systems, pp 978–983

  5. Barai SK (2003) Data mining applications in transportation engineering. Transport 18(5): 216–223

    Google Scholar 

  6. Bekhor S, Ben-Akiva ME, Ramming MS (2006) Evaluation of choice set generation algorithms for route choice models. Ann Oper Res 144(1): 235–247

    Article  MathSciNet  MATH  Google Scholar 

  7. Ben-Dor A, Yakhini Z (1999) Clustering gene expression patterns. J Comput Biol 6(3): 281–297

    Article  Google Scholar 

  8. Borges J, Levene M (2000) Data mining of user navigation patterns. Lecture Notes in Computer Science 1836, pp 92–112

  9. Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2): 209–221

    Article  Google Scholar 

  10. Cheong CH, Wong MH (2006) Mining popular paths in a transportation database system with privacy protection. In: Proceedings of 22nd international conference on data engineering workshops, p 122

  11. Chon HD, Agrawal D, El Abbadi A (2003) FATES: Finding a time dependent shortest path. In: Proceedings of 4th international conference on mobile data management, pp 165–180

  12. Denton AM, Besemann CA, Dorr DH (2009) Pattern-based time-series subsequence clustering using radial distribution functions. Knowl Inf Syst 18(1): 1–27

    Article  Google Scholar 

  13. Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1(1): 269–271

    Article  MathSciNet  MATH  Google Scholar 

  14. El-Rabbany A (2006) Introduction to GPS: the global positioning system, 2nd edn. Artech House, Boston

    Google Scholar 

  15. Engineer F (2001) Fast shortest path algorithms for large road networks. In: Proceedings of 36th annual ORSNZ conference

  16. Fritzsche PC, Rexachs D, Luque E (2007) A computational approach to TSP performance prediction using data mining. In: Proceedings of 21st international conference on advanced information networking and applications workshops, pp 252–259

  17. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco

    MATH  Google Scholar 

  18. Gonzalez H, Han J, Li X et al (2007) Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of 33rd international conference on very large data bases, pp 794–805

  19. Google Map, http://maps.google.com/

  20. Halvey M, Keane T, Smyth B (2005) Predicting navigation patterns on the mobile-internet using time of the week. In: Proceedings of 14th international conference on World Wide Web, pp 958–959

  21. Halvey M, Keane T, Smyth B (2006) Time based patterns in mobile-internet surfing. In: Proceedings of SIGCHI conference on human factors in computing system, pp 31–34

  22. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2): 100–107

    Article  Google Scholar 

  23. Johnson DS, McGeoch LA (1995) The traveling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK Local search in combinatorial optimization. Wiley, New York

  24. Jula H, Dessouky M, Ioannou PA (2008) Real-time estimation of travel times along the arcs and arrival times at the nodes of dynamic stochastic networks. IEEE Trans Intell Transp Syst 9(1)

  25. Kanoulas E, Du Y, Xia T et al (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of 22nd international conference on data engineering, p 10

  26. Kaohsiung City Real-Time Traffic Information, http://kctraffic.tbkc.gov.tw/link01.htm

  27. Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York

    Google Scholar 

  28. Khoshgozaran A, Khodaei A, Sharifzadeh M et al (2008) A hybrid aggregation and compression technique for road network databases. Knowl Inf Syst 17(3): 265–286

    Article  Google Scholar 

  29. Lassabe N, Berro A, Duthen Y (2007) Improvement of a shortest routes algorithm. In: Proceedings of 10th IEEE conference on intelligent transportation systems, pp 613–617

  30. Lim Y, Kim H (2005) A shortest path algorithm for real road network based on path overlap. J East Asia Soc Transp Stud 6: 1426–1438

    Google Scholar 

  31. Lin J, Keogh E, Lonardi S et al (2003) A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of 8th ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp 2–11

  32. van Lint JWC (2008) Online learning solutions for freeway travel time prediction. IEEE Trans Intell Transp Syst 9(1): 38–47

    Article  Google Scholar 

  33. Lo C-H, Peng W-C, Chen C-W et al (2008) CarWeb: a traffic data collection platform. In: Proceedings of international conference on mobile data management, pp 221–222

  34. Lu EH-C, Lin CC, Tseng VS (2008) Mining the shortest path within a travel time constraint in road network environments. In: Proceedings of IEEE conference on intelligent transportation systems, pp 593–598

  35. Pallottino S, Scutella MG (1998) Shortest path algorithms in transportation models: classical and innovative aspects. In: Equilibrium and advanced transportation modelling, pp 245–281

  36. Pepper J, Golden B, Wasil E (2002) Solving the traveling salesman problem with annealing-based heuristics: a computational study. IEEE Trans Man Cybern Syst A Syst Hum 32(1): 72–77

    Article  Google Scholar 

  37. Rosenkrantz DJ, Stearns RE, Lewis PM II (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6(3): 563–581

    Article  MathSciNet  MATH  Google Scholar 

  38. Tsai C-Y, Chou S-Y, Lin S-W et al (2009) Location determination of mobile devices for an indoor WLAN application using a neural network. Knowl Inf Syst 20(1): 81–93

    Article  Google Scholar 

  39. Tsai H, Yang J, Kao C (2002) Solving traveling salesman problems by combining global and local search mechanisms. In: Proceedings of congress on evolutionary computation, pp 1290–1295

  40. Tseng VS, Chen LJ (2002) An empirical study of the validity of gene expression clustering. In: Proceedings of international conference on mathematics and engineering techniques in medicine and biological sciences

  41. Tseng VS, Lin KW (2006) Efficient mining and prediction of user behavior patterns in mobile web systems. Inf Softw Technol 48(6): 357–369

    Article  Google Scholar 

  42. Tseng VS, Kao C (2005) Efficiently mining gene expression data via a novel parameterless clustering method. IEEE/ACM Trans Comput Biol Bioinform 2(4): 355–365

    Article  Google Scholar 

  43. Ye Y, Zheng Y, Chen Y et al (2009) Mining individual life pattern based on location history. In: Proceedings of international conference on mobile data management systems, services and middleware, pp 1–10

  44. Zheng Y, Zhang L, Xie X et al (2009) Mining interesting location and travel sequences from GPS trajectories. In: Proceedings of 18th international World Wide Web conference pp 791–800

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC

    Eric Hsueh-Chan Lu & Vincent S. Tseng

  2. Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA

    Wang-Chien Lee

Authors
  1. Eric Hsueh-Chan Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wang-Chien Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent S. Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent S. Tseng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, E.HC., Lee, WC. & Tseng, V.S. Mining fastest path from trajectories with multiple destinations in road networks. Knowl Inf Syst 29, 25–53 (2011). https://doi.org/10.1007/s10115-010-0333-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-010-0333-9

Keywords

Search

Navigation