Skip to main content
SpringerLink
Log in

Dynamic Vehicle Routing Under Uncertain Energy Consumption and Energy Gain Opportunities

  • Conference paper
  • First Online:
Smart Cities, Green Technologies and Intelligent Transport Systems (SMARTGREENS 2019, VEHITS 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1217))

  • 536 Accesses

Abstract

The amount of energy that needs to be spent by a vehicle to travel between different locations, and the amount of energy that can be regained at certain locations, may not always be known in advance with certainty. In this case, the path that needs to be followed by the vehicle in order to visit some points of interest without exhausting its energy reserves, has to be determined in a dynamic way, via an online algorithm. To this end, we propose a heuristic which takes dynamic routing decisions based on the actually remaining energy of the vehicle and the estimated energy costs/gains of different path options. We evaluate the algorithm via simulations, showing that it always achieves better results than the statically optimal path-planning algorithm and close to optimal results as long as the energy storage capacity of the vehicle is not marginally sufficient to travel between locations where the vehicle can gain some energy. In addition, we investigate different variants of the algorithm that trade-off the achieved coverage for less runtime complexity.

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. Alonso, F., Alvarez, M.J., Beasley, J.E.: A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. 59(7), 963–976 (2008)

    Article  Google Scholar 

  2. Angelelli, E., Speranza, M.G.: The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2), 233–247 (2002)

    Article  Google Scholar 

  3. Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The optimal routing problem in the context of battery-powered electric vehicles. In: CPAIOR Workshop on Constraint Reasoning and Optimization for Computational Sustainability (CROCS) (2010)

    Google Scholar 

  4. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)

    Article  MathSciNet  Google Scholar 

  5. Bent, R.W., Van Hentenryck, P.: Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6), 977–987 (2004)

    Article  Google Scholar 

  6. Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574–585 (1992)

    Article  MathSciNet  Google Scholar 

  7. Chepuri, K., Homem-De-Mello, T.: Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann. Oper. Res. 134(1), 153–181 (2005)

    Article  MathSciNet  Google Scholar 

  8. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Netw. Int. J. 30(2), 105–119 (1997)

    MATH  Google Scholar 

  9. Ehmke, J.F., Campbell, A.M., Urban, T.L.: Ensuring service levels in routing problems with time windows and stochastic travel times. Eur. J. Oper. Res. 240(2), 539–550 (2015)

    Article  MathSciNet  Google Scholar 

  10. Erera, A.L., Morales, J.C., Savelsbergh, M.: The vehicle routing problem with stochastic demand and duration constraints. Transp. Sci. 44(4), 474–492 (2010)

    Article  Google Scholar 

  11. Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J. Heuristics 20(5), 483–509 (2014)

    Article  Google Scholar 

  12. Ford Jr., L.R.: Network flow theory. Technical report, Rand Corp Santa Monica Ca (1956)

    Google Scholar 

  13. Gaudioso, M., Paletta, G.: A heuristic for the periodic vehicle routing problem. Transp. Sci. 26(2), 86–92 (1992)

    Article  Google Scholar 

  14. Gendreau, M., Laporte, G., Séguin, R.: An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp. Sci. 29(2), 143–155 (1995)

    Article  Google Scholar 

  15. Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469–477 (1996)

    Article  Google Scholar 

  16. Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., Mendez, C.: Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transp. Res. Part C Emerg. Technol. 19(5), 751–765 (2011)

    Article  Google Scholar 

  17. Kenyon, A.S., Morton, D.P.: Stochastic vehicle routing with random travel times. Transp. Sci. 37(1), 69–82 (2003)

    Article  Google Scholar 

  18. Klapp, M.A., Erera, A.L., Toriello, A.: The dynamic dispatch waves problem for same-day delivery. Eur. J. Oper. Res. 271(2), 519–534 (2018)

    Article  MathSciNet  Google Scholar 

  19. Laporte, G., Louveaux, F., Mercure, H.: The vehicle routing problem with stochastic travel times. Transp. Sci. 26(3), 161–170 (1992)

    Article  Google Scholar 

  20. Laporte, G., Louveaux, F.V., Van Hamme, L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3), 415–423 (2002)

    Article  MathSciNet  Google Scholar 

  21. Las Fargeas, J., Hyun, B., Kabamba, P., Girard, A.: Persistent visitation with fuel constraints. Proc.-Soc. Behav. Sci. 54, 1037–1046 (2012)

    Article  Google Scholar 

  22. Marinaki, M., Marinakis, Y.: A glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demands. Expert Syst. Appl. 46, 145–163 (2016)

    Article  Google Scholar 

  23. Marinakis, Y., Iordanidou, G.R., Marinaki, M.: Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl. Soft Comput. 13(4), 1693–1704 (2013)

    Article  Google Scholar 

  24. Mendoza, J.E., Rousseau, L.M., Villegas, J.G.: A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints. J. Heuristics 22(4), 539–566 (2016)

    Article  Google Scholar 

  25. Mersheeva, V.: UAV routing problem for area monitoring in a disaster situation. Ph.D. thesis Alpen-Adria-Universität Klagenfurt Austria (2015)

    Google Scholar 

  26. Miranda, D.M., Conceição, S.V.: The vehicle routing problem with hard time windows and stochastic travel and service time. Expert Syst. Appl. 64, 104–116 (2016)

    Article  Google Scholar 

  27. Mor, A., Speranza, M.: Vehicle routing problems over time: a survey (2018)

    Google Scholar 

  28. Polychronis, G., Lalis, S.: Dynamic vehicle routing under uncertain travel costs and refueling opportunities. In: 5th International Conference on Vehicle Technology and Intelligent Transport Systems, pp. 52–63 (2019)

    Google Scholar 

  29. Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3–31 (2016)

    Article  MathSciNet  Google Scholar 

  30. Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W.: A path relinking algorithm for a multi-depot periodic vehicle routing problem. J. Heuristics 19(3), 497–524 (2013)

    Article  Google Scholar 

  31. Rei, W., Gendreau, M., Soriano, P.: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transp. Sci. 44(1), 136–146 (2010)

    Article  Google Scholar 

  32. Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energy-optimal routing for electric vehicles. In: AAAI, pp. 1402–1407 (2011)

    Google Scholar 

  33. Secomandi, N.: A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5), 796–802 (2001)

    Article  MathSciNet  Google Scholar 

  34. Taş, D., Gendreau, M., Dellaert, N., Van Woensel, T., De Kok, A.: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3), 789–799 (2014)

    Article  MathSciNet  Google Scholar 

  35. Taş, D., Dellaert, N., Van Woensel, T., De Kok, T.: Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40(1), 214–224 (2013)

    Article  MathSciNet  Google Scholar 

  36. Van Woensel, T., Kerbache, L., Peremans, H., Vandaele, N.: A vehicle routing problem with stochastic travel times. In: 4th Aegean International Conference on Analysis of Manufacturing Systems Location, Samos, Greece (2003)

    Google Scholar 

  37. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)

    Article  MathSciNet  Google Scholar 

  38. Voccia, S.A., Campbell, A.M., Thomas, B.W.: The same-day delivery problem for online purchases. Transp. Sci. 53(1), 167–184 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This research has been co-financed by the European Union and Greek national funds through the Operational Program Competitiveness, Entrepreneurship and Innovation, under the call RESEARCH - CREATE - INNOVATE, project PV-Auto-Scout, code T1EDK-02435.

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Thessaly, Volos, Greece

    Giorgos Polychronis & Spyros Lalis

Authors
  1. Giorgos Polychronis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Spyros Lalis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giorgos Polychronis .

Editor information

Editors and Affiliations

  1. Dublin City University, Dublin, Ireland

    Markus Helfert

  2. Department of Corporate Technology, Siemens AG, Munich, Germany

    Cornel Klein

  3. School of Business, Innovation Value Institute, Maynooth University, Maynooth, Kildare, Ireland

    Brian Donnellan

  4. Ford Research and Advanced Engineering, Dearborn, MI, USA

    Oleg Gusikhin

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Polychronis, G., Lalis, S. (2021). Dynamic Vehicle Routing Under Uncertain Energy Consumption and Energy Gain Opportunities. In: Helfert, M., Klein, C., Donnellan, B., Gusikhin, O. (eds) Smart Cities, Green Technologies and Intelligent Transport Systems. SMARTGREENS VEHITS 2019 2019. Communications in Computer and Information Science, vol 1217. Springer, Cham. https://doi.org/10.1007/978-3-030-68028-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68028-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68027-5

  • Online ISBN: 978-3-030-68028-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation