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 条
[1]   On solving periodic re-optimization dynamic vehicle routing problems [J].
AbdAllah, Abdel Monaem F. M. ;
Essam, Daryl L. ;
Sarker, Ruhul A. .
APPLIED SOFT COMPUTING, 2017, 55 :1-12
[2]  
Akhand MAH, 2017, INT J ADV COMPUT SC, V8, P288
[3]   Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem [J].
Akpinar, Sener .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 61 :28-38
[4]   The dynamic multiperiod vehicle routing problem with probabilistic information [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 48 :31-39
[5]  
Aleman Rafael E., 2010, International Journal of Metaheuristics, V1, P55, DOI 10.1504/IJMHEUR.2010.033123
[6]   An adaptive memory algorithm for the split delivery vehicle routing problem [J].
Aleman, Rafael E. ;
Zhang, Xinhui ;
Hill, Raymond R. .
JOURNAL OF HEURISTICS, 2010, 16 (03) :441-473
[7]   Short Term Strategies for a Dynamic Multi-Period Routing Problem [J].
Angelelli, E. ;
Bianchessi, N. ;
Mansini, R. ;
Speranza, M. G. .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2009, 17 (02) :106-119
[8]  
Angelelli E, 2002, VEHICLE ROUTING PROB
[9]  
[Anonymous], 2018, ANN OPER RES
[10]   A tabu search algorithm for the split delivery vehicle routing problem [J].
Archetti, C ;
Speranza, MG ;
Hertz, A .
TRANSPORTATION SCIENCE, 2006, 40 (01) :64-73