Popular Route Planning with Travel Cost Estimation

  • Huiping Liu
  • Cheqing JinEmail author
  • Aoying Zhou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9643)


With the increasing number of GPS-equipped vehicles, more and more trajectories are generated continuously, based on which some urban applications become feasible, such as route planning. In general, route planning aims at finding a path from source to destination to meet some specific requirements, i.e., the minimal travel time, fee or fuel consumption. Especially, some users may prefer popular route that has been travelled frequently. However, the existing work to find the popular route does not consider how to estimate the travelling cost. In this paper, we address this issue by devising a novel structure, called popular traverse graph, to summarize historical trajectories. Based on which an efficient route planning algorithm is proposed to search the popular route with minimal travel cost. The extensive experimental reports show that our method is both effective and efficient.


Time Slot Travel Cost Mean Absolute Error Minimum Description Length Optimal Concatenation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



Our research is supported by the 973 program of China (No. 2012CB316203), NSFC (61370101, U1401256 and 61402180), Shanghai Knowledge Service Platform Project (No. ZF1213), Innovation Program of Shanghai Municipal Education Commission (14ZZ045), and Natural Science Foundation of Shanghai (No. 14ZR1412600).


  1. 1.
    Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on A road network with speed patterns. In: Proceedings of ICDE (2006)Google Scholar
  2. 2.
    Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of EDBT, pp. 205–216 (2008)Google Scholar
  3. 3.
    Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proceedings of SIGSPATIAL (2010)Google Scholar
  4. 4.
    Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: Proceedings of KDD (2011)Google Scholar
  5. 5.
    Wang, Y., Zheng, Y., Xue, Y.: Travel time estimation of a path using sparse trajectories. In Proceedings of KDD (2014)Google Scholar
  6. 6.
    Grünwald, P.D., Myung, I.J., Pitt, M.A.: Advances in Minimum Description Length: Theory and Applications. MIT Press, Cambridge (2005)Google Scholar
  7. 7.
    Zheng, K., Zheng, Y., Xie, X., Zhou, X.: Reducing uncertainty of low-sampling-rate trajectories. In: Proceedings of ICDE (2012)Google Scholar
  8. 8.
    Wei, L.-Y., Zheng, Y., Peng, W.-C.: Constructing popular routes from uncertain trajectories. In: Proceedings of KDD (2012)Google Scholar
  9. 9.
    Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: Proceedings of ICDE (2011)Google Scholar
  10. 10.
    Luo, W., Tan, H., Chen, L., Ni, L.M.: Finding time period-based most frequent path in big trajectory data. In: Proceedings of SIGMOD (2013)Google Scholar
  11. 11.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)CrossRefGoogle Scholar
  13. 13.
    Kenneth, 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)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of VLDB (2007)Google Scholar
  15. 15.
    Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: Proceedings of ICDE (2014)Google Scholar
  16. 16.
    Mao, J., Song, Q., Jin, C., Zhang, Z., Zhou, A.: Tscluwin: trajectory stream clustering over sliding window. In: Proceedings of DASFAA (2016)Google Scholar
  17. 17.
    Duan, X., Jin, C., Wang, X., Zhou, A., Yue, K.: Real-time personalized taxi-sharing. In: Proceedings of the DASFAA (2016)Google Scholar
  18. 18.
    Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD (1996)Google Scholar
  19. 19.
    Ranu, S., Deepak, P., Aditya, D. Telang, A., Deshpande, P., Raghavan, S.: Indexing and matching trajectories under inconsistent sampling rates. In: Proceedings of ICDE (2015)Google Scholar
  20. 20.
    Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proceedings of SIGMOD (2007)Google Scholar
  21. 21.
    Balan, R.K., Nguyen, K.X., Jiang, L.: Real-time trip information service for a large taxi fleet. In: Proceedings of MobiSys (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of Computer Science and Software Engineering, Institute for Data Science and EngineeringEast China Normal UniversityShanghaiChina

Personalised recommendations