Advertisement

An Adaptive Large Neighborhood Search Approach for Electric Vehicle Routing with Load-Dependent Energy Consumption

  • Surendra Reddy Kancharla
  • Gitakrishnan Ramadurai
Original Article

Abstract

Electric vehicles are gaining popularity day-by-day aided by growing pollution concerns with fossil fuel vehicles. Many logistics companies have already started testing electric vehicles for deliveries in cities. However, electric vehicles have issues such as range anxiety and long recharge times. These issues have to be considered in routing electric vehicles to avoid inefficient routes. One of the important factors that affects the amount of battery consumed is load carried by the vehicle. Considering loads will significantly affect the routes determined in the electric vehicle routing problem (EVRP). Most previous studies solved EVRP with distance minimization as the objective. We have considered load of vehicle in the power estimation function to calculate the energy requirement. An adaptive large neighborhood search (ALNS) with special operators particular to this problem structure is presented. ALNS was tested on 56 benchmark instances and it found better solutions for 14 instances and for 15 instances the solutions matched the best-known solution.

Keywords

Electric vehicle routing Energy minimization Adaptive large neighborhood search 

Notes

Acknowledgements

The authors acknowledge the opportunity provided by the 4th Conference of the Transportation Research Group of India (4th CTRG) held at IIT Bombay, Mumbai, India between 17th December, 2017 and 20th December, 2017 to present the work that forms the basis of this manuscript.

References

  1. 1.
    Barth M, Scora G, Younglove T (2004) Modal emissions model for heavy-duty diesel vehicles. Transp Res Rec J Transp Res Board 1880:10–20CrossRefGoogle Scholar
  2. 2.
    Conrad RG, Figliozzi MA (2011) The recharging vehicle routing problem. In: IIE annual conference. Proceedings, institute of industrial and systems engineers (IISE), p 1Google Scholar
  3. 3.
    Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper Res 64(6):1388–1405MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Erdoğan S, Miller-Hooks E (2012) A green vehicle routing problem. Transp Res Part E Logist Transp Rev 48(1):100–114CrossRefGoogle Scholar
  5. 5.
    Felipe Á, Ortuño MT, Righini G, Tirado G (2014) A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp Res Part E Logist Transp Rev 71:111–128CrossRefGoogle Scholar
  6. 6.
    Juan AA, Goentzel J, Bektaş T (2014) Routing fleets with multiple driving ranges: is it possible to use greener fleet configurations? Appl Soft Comput 21:84–94CrossRefGoogle Scholar
  7. 7.
    Keskin M, Çatay B (2016) Partial recharge strategies for the electric vehicle routing problem with time windows. Transp Res Part C Emerg Technol 65:111–127CrossRefGoogle Scholar
  8. 8.
    Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472CrossRefGoogle Scholar
  9. 9.
    Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transp Sci 48(4):500–520CrossRefGoogle Scholar
  10. 10.
    Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Suzuki Y (2012) A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands. Decis Support Syst 54(1):758–767CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Civil EngineeringIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations