Skip to main content
SpringerLink
Log in

Constrained energy-efficient routing in time-aware road networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Routing problems find applications in many location-based services. Existing works which answer route queries mainly focus on static road networks rather than time-aware road networks. Observe the fact that (i) the same road segment may be driven with different speeds during different time intervals, and (ii) users usually prefer driving on a route that consumes minimum energy within a travel time budget. Motivated by this, this paper proposes the Constrained Energy-Efficient Time-Aware Routing problem, denoted as C E E T A R. We take time factor into consideration and utilize a time-aware speed model and a time-aware polynomial energy cost model. To solve C E E T A R, we propose a dynamic programming solution, and then propose an approximation algorithm which uses the branch and bound, and scaling strategy with provable approximation bounds to answer the query of C E E T A R in real-world dense road networks. In addition, we also propose a greedy route planning algorithm. Experimental results demonstrate that our approximation algorithms can efficiently answer C E E T A R queries with high accuracy.

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

Similar content being viewed by others

Notes

  1. http://www.dis.uniroma1.it/challenge9/download.shtml.

References

  1. Andersen O, Jensen CS, Torp K, Yang B (2013) Ecotour: Reducing the environmental footprint of vehicles using eco-routes. In: IEEEInternational conference on mobile data management, pp 338–340

  2. Artmeier A, Haselmayr J, Leucker M, Sachenbacher M (2010) The shortest path problem revisited: Optimal routing for electric vehicles. In: KI 2010: Advances In artificial intelligence, pp 309–316. Springer

  3. Batz GV, Delling D, Sanders P, Vetter C (2009) Time-dependent contraction hierarchies. In: ALENEX, vol. 9. SIAM

  4. Baum M, Dibbelt J, Hübschle-Schneider L., Pajor T, Wagner D (2014) Speed-consumption tradeoff for electric vehicle route planning. In: 14Th workshop on algorithmic approaches for transportation modelling, optimization, and systems, p 138

  5. Baum M, Dibbelt J, Pajor T, Wagner D (2013) Energy-optimal routes for electric vehicles. In: Proceedings of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems, pp 54–63. ACM

  6. Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. Proceedings of the VLDB Endowment 5(11):1136–1147

    Article  Google Scholar 

  7. Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Experimental algorithms, pp 376–387. Springer

  8. Demestichas K, Masikos M, Adamopoulou E, Dreher S, Diaz de Arkaya A (2012) Machine-learning methodology for energy efficient routing. In: 19Th ITS world congress

  9. Desrochers M, Soumis F, Desrochers M (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. Information Systems & Operational Research 26(3):191–212

    Article  Google Scholar 

  10. Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th international conference on extending database technology: Advances in database technology, pp 205–216. ACM

  11. Duckham M, Kulik L (2003) simplest paths: Automated route selection for navigation. In: Spatial information theory. Foundations of geographic information science, pp 169–185. Springer

  12. Dumitrescu I., Boland N. (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 8(1):15C29

    Article  Google Scholar 

  13. Eisner J, Funke S, Storandt S (2011) Optimal route planning for electric vehicles in large networks. In: AAAI

  14. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. In: W.h. Freeman and company

  15. Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388–404

    Article  Google Scholar 

  16. Geisberger R, Vetter C (2011) Efficient routing in road networks with turn costs. In: Experimental algorithms, pp 100–111. Springer

  17. Guo C, Yang B, Andersen O, Jensen CS, Torp K (2015) Ecomark 2.0: empowering eco-routing with vehicular environmental models and actual vehicle fuel consumption data. Geoinformatica 19(3):567–599

    Article  Google Scholar 

  18. Hartmann F, Funke S (2014) Energy-efficient routing: Taking speed into account. In: KI 2014: Advances In artificial intelligence, pp 86–97. Springer

  19. Holzer M, Schulz F, Wagner D (2009) Engineering multilevel overlay graphs for shortest-path queries. Journal of Experimental Algorithmics (JEA) 13:5

    Google Scholar 

  20. Jung S, Pramanik S (2002) An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans Knowl Data Eng 14(5):1029–1046

    Article  Google Scholar 

  21. Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on A road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering, ICDE, p 10

  22. Kriegel HP, Renz M, Schubert M (2010) Route skyline queries: a multi-preference path planning approach. In: 2010 IEEE 26Th international conference on data engineering (ICDE), pp 261–272. IEEE

  23. Luxen D, Vetter C (2011) Real-time routing with openstreetmap data. In: Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 513–516. ACM

  24. Matthew Carlyle W, Kevin Wood R (2005) Near-shortest and k-shortest simple paths. Networks 46(2):98–109

    Article  Google Scholar 

  25. Schulz F, Wagner D, Zaroliagis C (2002) Using multi-level graphs for timetable information in railway systems. In: Algorithm engineering and experiments, pp 43–59. Springer

  26. Shang J, Zheng Y, Tong W, Chang E, Yu Y (2014) Inferring gas consumption and pollution emission of vehicles throughout a city. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1027–1036. ACM

  27. Song YY, Yao EJ, Zuo T, Lang ZF (2013) Emissions and fuel consumption modeling for evaluating environmental effectiveness of its strategies. Discret Dyn Nat Soc

  28. Storandt S (2012) Algorithms for vehicle navigation

  29. Storandt S (2012) Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL international workshop on computational transportation science, pp 20–25. ACM

  30. Tielert T, Rieger D, Hartenstein H, Luz R, Hausberger S (2012) Can v2x communication help electric vehicles save energy?. In: 12Th international conference on ITS telecommunications, pp 232–237

  31. Wang Y, Zheng Y, Xue Y (2014) Travel time estimation of a path using sparse trajectories. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 25–34

  32. Winter S (2002) Modeling costs of turns in route planning. GeoInformatica 6 (4):345–361

    Article  Google Scholar 

  33. Wu B (2013) A simpler and more efficient algorithm for the next-to-shortest path problem. Algorithmica 65(2):467–479. doi:10.1007/s00453-011-9601-7

    Article  Google Scholar 

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

Download references

Acknowledgments

This work is partly supported by Beijing Laboratory of Advanced Information Networks and National Natural Science Foundation of China (Grant No. 61471053).

Author information

Authors and Affiliations

  1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, People’s Republic of China

    Yaqiong Liu & Guochu Shou

  2. School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore

    Yaqiong Liu & Hock Soon Seah

Authors
  1. Yaqiong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hock Soon Seah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guochu Shou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yaqiong Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Y., Seah, H.S. & Shou, G. Constrained energy-efficient routing in time-aware road networks. Geoinformatica 21, 89–117 (2017). https://doi.org/10.1007/s10707-016-0274-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-016-0274-x

Keywords

Search

Navigation