Advertisement

Vehicle Routing for Fleets with Electric- and Combustion-Powered Vehicles

  • Herbert Kopfer
  • Kristian SchopkaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9855)

Abstract

Optimal transportation plans for fleets with electric-powered vehicles (EPVs) differ substantially from plans generated for fleets with combustion-powered vehicles (CPVs). The main reasons for this difference are the reduced range and payload of EPVs (compared to CPVs) as well as their increased efficiency. In this paper, transportation plans for CPVs and EPVs which must not be recharged during route fulfillment are analyzed by computational experiments. The advantages of CPVs with respect to totally driven distances, number of used vehicles and the ability to generate feasible plans are opposed to the advantages of EPVs with respect to \(CO_2\) emissions. Additionally it is shown that the specific drawbacks of CPVs and EPVs can be mitigated by exploiting the flexibility of a fleet which is composed of both, EPVs and CPVs.

Keywords

Vehicle routing Electric-powered vehicles versus combustion-powered vehicles Mixed vehicle fleet Energy consumption Reduction of \(CO_2\) emissions Adaptive large neighborhood search 

References

  1. 1.
    Clarke, G., Wright, W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)CrossRefGoogle Scholar
  2. 2.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Hiermann, G., Puchinger, J., Ropke, S., Hartl, R.F.: The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252, 995–1018 (2016)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simmulated annealing. Science 220(4598), 671–680 (1983)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Kopfer, H.W., Kopfer, H.: Emissions minimization vehicle routing problem in dependence of different vehicle classes. In: Kreowski, H.-J., Scholz-Reiter, B., Thoben, K.-D. (eds.) Dynamics in Logistics, pp. 49–58. Springer (2013)Google Scholar
  6. 6.
    Kopfer, H.W., Schönberger, J., Kopfer, H.: Reducing greenhouse gas emissions of a heterogeneous vehicle fleet. Flex. Serv. Manuf. J. 26(1–2), 221–248 (2014)CrossRefGoogle Scholar
  7. 7.
    Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Pelletier, S., Jabali, O., Laporte, G.: Goods distribution with electric vehicles: review and research perspectives. cirrelt.ca [PDF] (2014)Google Scholar
  9. 9.
    Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Potvin, J.-Y., Rousseau, J.-M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3), 331–340 (1993)CrossRefzbMATHGoogle Scholar
  11. 11.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)CrossRefGoogle Scholar
  12. 12.
    Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500–520 (2014)CrossRefGoogle Scholar
  13. 13.
    Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139–171 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–443. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  15. 15.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Vornhusen, B., Kopfer, H.: Emission vehicle routing problem with split delivery and a heterogeneous vehicle fleet. Comput. Logistics 9335, 76–90 (2015)CrossRefGoogle Scholar
  17. 17.
    Xiao, Y., Zhao, Q., Kaku, I., Xu, Y.: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput. Oper. Res. 39(7), 1419–1431 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    O.V.: So ermitteln Sie den \(CO_2\)-Fußabdruck. Verkehrs Rundschau 51-52/2010. Verlag Heinrich VogelGoogle Scholar
  19. 19.
    O.V.: Wie Machen sich Ihre Elektro-LKW in der Praxis? Verkehrs Rundschau 46/2015. Verlag Heinrich VogelGoogle Scholar
  20. 20.
  21. 21.
  22. 22.
  23. 23.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Chair of LogisticsUniversity of BremenBremenGermany

Personalised recommendations