The consistent electric-Vehicle routing problem with backhauls and charging management

被引:24
作者
Nolz, Pamela C. [1 ,3 ]
Absi, Nabil [2 ]
Feillet, Dominique [2 ]
Seragiotto, Clovis [3 ]
机构
[1] St Polten Univ Appl Sci, Campus Pl 1, A-3100 St Polten, Austria
[2] Univ Clermont Auvergne, Mines St Etienne, CNRS, UMR 6158,LIMOS,Ctr CMP, F-13541 Gardanne, France
[3] AIT Austrian Inst Technol, Ctr Energy, Giefinggasse 4, A-1210 Vienna, Austria
基金
欧盟地平线“2020”;
关键词
Distribution; Metaheuristics; Transportation; Combinatorial optimization; TIME WINDOWS; SEARCH; FLEET;
D O I
10.1016/j.ejor.2022.01.024
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a consistent vehicle routing problem for the delivery of parcels with electric vehicles. Stemming from a real-world problem, we assume that vehicles can only be charged with electricity between their delivery tours in the morning and their pickup tours in the afternoon. For this purpose, a charging station with a limited amount of charging slots is available at the depot. We aim at generating a set of vehicle routes that are driver- and time-consistent and efficiently use limited charging resources, while optimizing the sum of vehicle fixed cost, vehicle/driver operating time, arrival time consistency and driver consistency. We present a mathematical model to describe the problem in detail. For solving the real-world problem, a template-based Adaptive Large Neighborhood Search is developed, complemented with constraint programming for charging management and quadratic programming for delivery and pickup trip scheduling. Computational experiments for different settings and scenarios, based on data from an Austrian parcel delivery company, are presented and analysed. (C) 2022 The Authors. Published by Elsevier B.V.
引用
收藏
页码:700 / 716
页数:17
相关论文
共 33 条
[1]   Satisfiability tests and time-bound adjustments for cumulative scheduling problems [J].
Baptiste, P ;
Le Pape, C ;
Nuijten, W .
ANNALS OF OPERATIONS RESEARCH, 1999, 92 (0) :305-333
[2]   The role of operational research in green freight transportation [J].
Bektas, Tolga ;
Ehmke, Jan Fabian ;
Psaraftis, Harilaos N. ;
Puchinger, Jakob .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (03) :807-823
[3]   A multi-period dial-a-ride problem with driver consistency [J].
Braekers, Kris ;
Kovacs, Attila A. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 94 :355-377
[4]   The electric two-echelon vehicle routing problem [J].
Breunig, U. ;
Baldacci, R. ;
Hartl, R. F. ;
Vidal, T. .
COMPUTERS & OPERATIONS RESEARCH, 2019, 103 :198-210
[5]   A path-based solution approach for the Green Vehicle Routing Problem [J].
Bruglieri, M. ;
Mancini, S. ;
Pezzella, E. ;
Pisacane, O. .
COMPUTERS & OPERATIONS RESEARCH, 2019, 103 :109-122
[6]   Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector [J].
Campelo, Pedro ;
Neves-Moreira, Fabio ;
Amorim, Pedro ;
Almada-Lobo, Bernardo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) :131-145
[7]   The electric vehicle routing problem with time windows, partial recharges and satellite customers [J].
Cortes-Murcia, David L. ;
Prodhon, Caroline ;
Afsar, H. Murat .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2019, 130 :184-206
[8]   Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows [J].
Desaulniers, Guy ;
Errico, Fausto ;
Irnich, Stefan ;
Schneider, Michael .
OPERATIONS RESEARCH, 2016, 64 (06) :1388-1405
[9]  
Echeverri L. C., 2019, 13 METAHEURISTICS IN
[10]  
European Commission, 2020, EUR STRAT LOW EM MOB