Review of Vehicle Routing Problems: Models, Classification and Solving Algorithms

被引:79
作者
Zhang, Haifei [1 ,2 ]
Ge, Hongwei [1 ,2 ]
Yang, Jinlong [1 ,2 ]
Tong, Yubing [3 ]
机构
[1] Jiangnan Univ, Minist Educ, Key Lab Adv Proc Control Light Ind, Wuxi 214122, Jiangsu, Peoples R China
[2] Jiangnan Univ, Sch Artificial Intelligence & Comp Sci, Wuxi 214122, Jiangsu, Peoples R China
[3] Univ Penn, Dept Radiol, Med Image Proc Grp, Philadelphia, PA 19104 USA
关键词
ANT COLONY SYSTEM; VARIABLE NEIGHBORHOOD SEARCH; SOFT TIME WINDOWS; DIFFERENTIAL EVOLUTION ALGORITHM; REAL-TIME; SPLIT DELIVERIES; PROGRAMMING APPROACH; COLUMN GENERATION; LOCAL SEARCH; OPTIMIZATION;
D O I
10.1007/s11831-021-09574-x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
With the rapid development of logistics industry, vehicle scheduling is the key to the optimization of transportation links. Vehicle transportation route planning is becoming more and more important to reduce logistics costs. In recent decades, the research on VRP and related derivative problems has become more and more extensive. Based on the basic VRP, this paper classifies VRP according to its characteristics and practical application. It focuses on the analysis of VRP with capacity constraint, VRP with time window, VRP with demand splitting and dynamic VRP, and gives the unified description and mathematical model of each type of problem, and then analyzes the solution methods of each type of VRP Finally, combined with other types of VRP, the future research and development trend of VRP are given.
引用
收藏
页码:195 / 221
页数:27
相关论文
共 182 条
[21]   Scenario-based planning for partially dynamic vehicle routing with stochastic customers [J].
Bent, RW ;
Van Hentenryck, P .
OPERATIONS RESEARCH, 2004, 52 (06) :977-987
[22]   A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem [J].
Berbotto, Leonardo ;
Garcia, Sergio ;
Nogales, Francisco J. .
ANNALS OF OPERATIONS RESEARCH, 2014, 222 (01) :153-173
[23]   A new generation of vehicle routing research: Robust algorithms, addressing uncertainty [J].
Bertsimas, DJ ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1996, 44 (02) :286-304
[24]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1993, 41 (01) :60-76
[25]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615
[26]   Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time windows [J].
Bianchessi, Nicola ;
Irnich, Stefan .
TRANSPORTATION SCIENCE, 2019, 53 (02) :442-462
[27]  
BLANTON JL, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P452
[28]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[29]   The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints [J].
Bortfeldt, Andreas ;
Yi, Junmin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) :545-558
[30]   An improved ant system algorithm for the vehicle routing problem [J].
Bullnheimer, B ;
Hartl, RF ;
Strauss, C .
ANNALS OF OPERATIONS RESEARCH, 1999, 89 (0) :319-328