Skip to main content
SpringerLink
Log in

Efficient route search on hierarchical dynamic road networks

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (2007)

  2. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. In: Proceedings of the 7th International Workshop on Experimental Algorithms, pp. 303–318 (2008)

  3. Chen, S., Tu, Y.C., Xia, Y.: Performance analysis of a dual-tree algorithm for computing spatial distance histograms. VLDB J. 20(4), 471–494 (2011)

    Article  Google Scholar 

  4. Demiyurek, U., Kashani, F.B., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: Proceedings of the 12th International Symposium on Advances in Spatial and Temporal Databases, pp. 92–111 ( 2011)

  5. Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: Proceedings of the 23rd International Conference on Data, Engineering, pp. 796–805 ( 2007)

  6. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology, pp. 205–216 (2008)

  7. Gao, J., Jin, R., Zhou, J., Yu, J.X., Jiang, X., Wang, T.: Relational approach for shortest path discovery over large graphs. Proc. VLDB Endow. 5(4), 358–369 (2011)

    Article  Google Scholar 

  8. Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-\(k\) simple shortest paths discovery in graphs. In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, pp. 509–518 (2010)

  9. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Faster and simpler hierarchical routing in road networks. In: Proceedings of the 7th International Workshop on Experimental Algorithms, pp. 319–333 (2008)

  10. Goldberg A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165 (2005)

  11. 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 the 33rd International Conference on Very Large Data, Bases, pp. 794–805 (2007)

  12. Gunturi, V.M.V., Nunes, E., Yang, K.S., Shekhar, S.: A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results. In: Proceedings of the 12th International Symposium on Advances in Spatial and Temporal Databases, pp. 74–91 (2011)

  13. Hua M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 347–358 (2010)

  14. Huang, B., Wu, Q., Zhan, F.B.: A shortest path algorithm with novel heuristics for dynamic transportation networks. Int. J. Geogr. Inf. Sci. 21(6), 625–644 (2007)

    Article  Google Scholar 

  15. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. in Proceedings of the 22nd International Conference on Data, Engineering (2006)

  16. Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A. Artif. Intell. 155(1–2), 93–146 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: Proceedings of the 26th International Conference on Data, Engineering, pp. 261–272 (2010)

  18. Li, F., Chen, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Proceedings of the 9th International Symposium on Advances in Spatial and Temporal Databases, pp. 273–290 (2005)

  19. Likhachev, M., Ferguson, D.I., Gordon, G.J., Stentz, A., Thrun, S.: Anytime dynamic A*: an anytime, replanning algorithm. In: Proceedings of the 5th International Conference on Automated Planning and Scheduling, pp. 262–271 (2005)

  20. Malviya, N., Madden, S., Bhattacharya, A.: A continuous query system for dynamic route planning. In: Proceedings of the 27th International Conference on Data, Engineering, pp. 792–803 (2011)

  21. Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd International Conference on Very Large Data, Bases, pp. 43–54 (2006)

  22. Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 867–876 ( 2009)

  23. Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. Proc. VLDB Endow. 4(2), 69–80 (2010)

    Article  Google Scholar 

  24. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 43–54 ( 2008)

  25. Sanders P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Proceedings of the 13th Annual European Symposium on Algorithms, pp. 568–579 (2005)

  26. Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. Proc. VLDB Endow. 2(1), 1210–1221 (2009)

    Article  Google Scholar 

  27. Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proceedings of the 12th International Conference on Extending Database Technology, pp. 493–504 (2009)

  28. Xu, J., Guo, L., Ding, Z., Sun, X., Liu, C.: Traffic aware route planning in dynamic road networks. In: Proceedings of the 17th International Conference on Database Systems for Advanced Applications, pp. 576–591 (2012)

  29. Zeng, W., Church, R.L.: Finding shortest paths on real road networks: the case for A*. Int. J. Geogr. Inf. Sci. 23(4), 531–543 (2009)

    Article  Google Scholar 

Download references

Acknowledgments

The research work reported in this paper was partly supported by the NSFC projects under grant numbers 61232006, 91124001, 61379033, 61003049, 61073061, and 61202064, the Fundamental Research Funds for the Central Universities under Grant 2013QNA5020, the Key Project of Zhejiang University Excellent Young Teacher Fund (Zijin Plan), and ARC discovery project under grant number DP120102627.

Author information

Authors and Affiliations

  1. School of Computer Science, Soochow University, Suzhou, China

    Jiajie Xu & Lei Zhao

  2. College of Computer Science, Zhejiang University, 38 Zheda Road, Hangzhou, 310027, China

    Yunjun Gao

  3. Faculty of ICT, Swinburne University of Technology, Melbourne, VIC, Australia

    Chengfei Liu

  4. Institute of Software, Chinese Academy of Sciences, Beijing, China

    Zhiming Ding

Authors
  1. Jiajie Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunjun Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chengfei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lei Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhiming Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yunjun Gao.

Additional information

A preliminary version of this work has been published in [28]. Substantial new technical materials have been added to this journal submission. In particular, we propose two novel route search strategies on the hierarchy of dynamic road network, as explicitly pointed out in Sect. 2 of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, J., Gao, Y., Liu, C. et al. Efficient route search on hierarchical dynamic road networks. Distrib Parallel Databases 33, 227–252 (2015). https://doi.org/10.1007/s10619-014-7146-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-014-7146-x

Keywords

Search

Navigation