Skip to main content
SpringerLink
Log in

Spica: A Path Bundling Model for Rational Route Recommendation

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9932))

Included in the following conference series:

  • 1627 Accesses

Abstract

This paper presents Spica, a path bundling model for rational route recommendation leveraging the intelligence and experience of the past driving records. In this model, the traffic surveillance system is employed to probe the traffic rhythm of a city and vehicle traveling record’s intelligence is used to choose driving directions in the real world. We propose Joint Technique (JT) to build Time-Dependent Joint (TDJ) graph and model the dynamic traffic pattern so as to provide the rational fastest route to a given destination at a given starting time. Then we estimate the travel time in different time slots and based on TDJ graph, we propose Time-Dependent Heuristic Algorithm (TDHA) to compute the rational recommended routes. We build our model based on a real-world trajectory data set generated by totally 44,593,706 passage records in a period of a week, and evaluate the performance of our model by conducting extensive experiments. The recommended routes are effective and JT gives evidence of its rationality over previous ways.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493–498 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dean, B.C.: Continuous-time dynamic shortest path algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1999)

    Google Scholar 

  3. Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: A case for time-dependent shortest path computation in spatial networks, pp. 474–477. ACM (2010)

    Google Scholar 

  4. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395–412 (1969)

    Article  MATH  Google Scholar 

  5. Ge, Y., Xiong, H., Liu, C., Zhou, Z.-H.: A taxi driving fraud detection system, pp. 181–190. IEEE (2011)

    Google Scholar 

  6. Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach, pp. 794–805. VLDB Endowment (2007)

    Google Scholar 

  7. Kanoulas, E., Yang, D., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns, p. 10. IEEE (2006)

    Google Scholar 

  8. Lee, C.-C., Wu, Y.-H., Chen, A.L.P.: Continuous evaluation of fastest path queries on road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 20–37. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (JACM) 37(3), 607–625 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks, pp. 867–876. ACM (2009)

    Google Scholar 

  11. Tian, Y., Lee, K.C., Lee, W.-C.: Monitoring minimum cost paths on road networks, pp. 217–226. ACM (2009)

    Google Scholar 

  12. Tretyakov, K., Armas-Cervantes, A., García-Bañuelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs, pp. 1785–1794. ACM (2011)

    Google Scholar 

  13. Veloso, M., Phithakkitnukoon, S., Bento, C.: Urban mobility study using taxi traces, pp. 23–30. ACM (2011)

    Google Scholar 

  14. Veloso, M., Phithakkitnukoon, S., Bento, C., Fonseca, N., Olivier, P.: Exploratory study of urban flow using taxi traces (2011)

    Google Scholar 

  15. Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endowment 5(5), 406–417 (2012)

    Article  Google Scholar 

  16. Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world, pp. 316–324. ACM (2011)

    Google Scholar 

  17. Jing Yuan, Y., Zheng, X.X., Sun, G.: T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE Trans. Knowl. Data Eng. 25(1), 220–232 (2013)

    Article  Google Scholar 

  18. Yuan, J., Zheng, Y., Zhang, L., Xie, X. and Sun, G.: Where to find my next passenger, pp. 109–118. ACM (2011)

    Google Scholar 

  19. Zheng, X., Liang, X., Ke, X.: Where to wait for a taxi? pp. 149–156. ACM (2012)

    Google Scholar 

Download references

Acknowledgment

This work was supported in part by the National Basic Research 973 Program of China under Grant No. 2015CB352502, the National Natural Science Foundation of China under Grant Nos. 61272092 and 61572289, the Natural Science Foundation of Shandong Province of China under Grant Nos. ZR2012FZ004 and ZR2015FM002, the Science and Technology Development Program of Shandong Province of China under Grant No. 2014GGE27178, and the NSERC Discovery Grants.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong University, Jinan, 250101, China

    Lei Lv, Yang Liu & Xiaohui Yu

  2. School of Information Technology, York University, Toronto, ON, M3J 1P3, Canada

    Xiaohui Yu

Authors
  1. Lei Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaohui Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaohui Yu .

Editor information

Editors and Affiliations

  1. School of Computing, University of Utah, Salt Lake City, Utah, USA

    Feifei Li

  2. School of Electrical Engineering, Seoul National University, Seoul, Korea (Republic of)

    Kyuseok Shim

  3. Soochow University , Suzhou, China

    Kai Zheng

  4. Soochow University , Suzhou, China

    Guanfeng Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lv, L., Liu, Y., Yu, X. (2016). Spica: A Path Bundling Model for Rational Route Recommendation. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45817-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45816-8

  • Online ISBN: 978-3-319-45817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation