The electric vehicle routing problem with energy consumption uncertainty

被引:158
作者
Pelletier, Samuel [1 ]
Jabali, Ola [2 ]
Laporte, Gilbert [1 ]
机构
[1] HEC Montreal, 3000 Chemin Cote St Catherine, Montreal, PQ H3T 2A7, Canada
[2] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, Piazza Leonardo da Vinci 32, I-20133 Milan, Italy
基金
加拿大自然科学与工程研究理事会;
关键词
Electric vehicle routing; Robust optimization; City logistics; Metaheuristics; PLUG-IN HYBRID; ROBUST OPTIMIZATION; BATTERY DEGRADATION; TIME WINDOWS; DEMAND; COMPETITIVENESS; EMISSIONS;
D O I
10.1016/j.trb.2019.06.006
中图分类号
F [经济];
学科分类号
02 ;
摘要
Compared with conventional freight vehicles, electric freight vehicles create less local pollution and are thus generally perceived as a more sustainable means of goods distribution. In urban areas, such vehicles must often perform the entirety of their delivery routes without recharging. However, their energy consumption is subject to a fair amount of uncertainty, which is due to exogenous factors such as the weather and road conditions, endogenous factors such as driver behaviour, and several energy consumption parameters that are difficult to measure precisely. Hence we propose a robust optimization framework to take into account these energy consumption uncertainties in the context of an electric vehicle routing problem. The objective is to determine minimum cost delivery routes capable of providing strong guarantees that a given vehicle will not run out of charge during its route. We formulate the problem as a robust mixed integer linear program and solve small instances to optimality using robust optimization techniques. Furthermore, we develop a two-phase heuristic method based on large neighbourhood search to solve larger instances of the problem, and we conduct several numerical tests to assess the quality of the methodology. The computational experiments illustrate the trade-off between cost and risk, and demonstrate the influence of several parameters on best found solutions. Furthermore, our heuristic identifies 42 new best solutions when tested on instances of the closely related robust capacitated vehicle routing problem. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:225 / 255
页数:31
相关论文
共 62 条
[51]   AN EXCHANGE HEURISTIC FOR ROUTEING PROBLEMS WITH TIME WINDOWS [J].
POTVIN, JY ;
ROUSSEAU, JM .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (12) :1433-1446
[52]   Energy-Optimized Routing of Electric Vehicles in Urban Delivery Systems [J].
Preis, Henning ;
Frank, Stefan ;
Nachtigall, Karl .
OPERATIONS RESEARCH PROCEEDINGS 2012, 2014, :583-588
[53]  
Quak H., 2017, P EUR COMM 7 FRAM PR
[54]   An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows [J].
Ropke, Stefan ;
Pisinger, David .
TRANSPORTATION SCIENCE, 2006, 40 (04) :455-472
[55]   Strategic planning of electric logistics fleet networks: A robust location-routing approach [J].
Schiffer, Maximilian ;
Walther, Grit .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2018, 80 :31-42
[56]   The electric location routing problem with time windows and partial recharging [J].
Schiffer, Maximilian ;
Walther, Grit .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (03) :995-1013
[57]   The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations [J].
Schneider, Michael ;
Stenger, Andreas ;
Goeke, Dominik .
TRANSPORTATION SCIENCE, 2014, 48 (04) :500-520
[58]  
Shaw P, 1998, LECT NOTES COMPUT SC, V1520, P417
[59]   A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty [J].
Sungur, Ilgaz ;
Ordonez, Fernando ;
Dessouky, Maged .
IIE TRANSACTIONS, 2008, 40 (05) :509-523
[60]  
Tretvik T., 2017, P EUR COMM 7 FRAM PR