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

被引:1
作者
Surendra Reddy Kancharla
Gitakrishnan Ramadurai
机构
[1] Indian Institute of Technology Madras,Department of Civil Engineering
关键词
Electric vehicle routing; Energy minimization; Adaptive large neighborhood search;
D O I
10.1007/s40890-018-0063-3
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 25 条
  • [1] Barth M(2004)Modal emissions model for heavy-duty diesel vehicles Transp Res Rec J Transp Res Board 1880 10-20
  • [2] Scora G(2016)Exact algorithms for electric vehicle-routing problems with time windows Oper Res 64 1388-1405
  • [3] Younglove T(2012)A green vehicle routing problem Transp Res Part E Logist Transp Rev 48 100-114
  • [4] Desaulniers 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-128
  • [5] Errico F(2014)Routing fleets with multiple driving ranges: is it possible to use greener fleet configurations? Appl Soft Comput 21 84-94
  • [6] Irnich S(2016)Partial recharge strategies for the electric vehicle routing problem with time windows Transp Res Part C Emerg Technol 65 111-127
  • [7] Schneider M(2006)An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transp Sci 40 455-472
  • [8] Erdoğan S(2014)The electric vehicle-routing problem with time windows and recharging stations Transp Sci 48 500-520
  • [9] Miller-Hooks E(1987)Algorithms for the vehicle routing and scheduling problems with time window constraints Oper Res 35 254-265
  • [10] Felipe Á(2012)A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands Decis Support Syst 54 758-767