A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants

被引：201
作者：
Elshaer, Raafat [1 ]
Awad, Hadeer [1 ]
机构：
[1] Zagazig Univ, Fac Engn, Ind Engn Dept, Zagazig, Egypt
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2020年 / 140卷
关键词：
Metaheuristics; Vehicle Routing Problem; Taxonomic review; VARIABLE NEIGHBORHOOD SEARCH; ITERATED LOCAL SEARCH; PARTICLE SWARM OPTIMIZATION; ANT COLONY OPTIMIZATION; SOFT TIME WINDOWS; HYBRID GENETIC ALGORITHM; META-HEURISTIC ALGORITHM; BEES MATING OPTIMIZATION; FROG LEAPING ALGORITHM; TABU SEARCH;
D O I：
10.1016/j.cie.2019.106242
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics for solving the problem and its variants. As extension to that work, this paper serves two-fold objectives: first, classifying the VRP and its variants solved using metaheuristic algorithms; second, investigating the contribution of each metaheuristic algorithm in solving the VRP problems. Based on a metaheuristic classification, we classify 299 VRP articles published between 2009 and 2017. The results are analyzed to reveal the usage trends of the algorithms and the solved VRP variants for showing the ones that are most popular, and those that are promising topics for future research.
引用
收藏
页数：19
相关论文
共 325 条
[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]   Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem [J].
Abdulkader, Mohamed M. S. ;
Gajpal, Yuvraj ;
ElMekkawy, Tarek Y. .
APPLIED SOFT COMPUTING, 2015, 37 :196-203
[3]   A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[4]   Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) :380-387
[5]   Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem [J].
Akpinar, Sener .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 61 :28-38
[6]   The dynamic multiperiod vehicle routing problem with probabilistic information [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 48 :31-39
[7]   Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation [J].
Alfredo Bula, Gustavo ;
Prodhon, Caroline ;
Augusto Gonzalez, Fabio ;
Afsar, H. Murat ;
Velasco, Nubia .
JOURNAL OF HAZARDOUS MATERIALS, 2017, 324 :472-480
[8]   A novel comprehensive macroscopic model for time-dependent vehicle routing problem with multi-alternative graph to reduce fuel consumption: A case study [J].
Alinaghian, Mehdi ;
Naderipour, Mansoureh .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 :210-222
[9]   Selective vehicle routing problems under uncertainty without recourse [J].
Allahviranloo, Mandieh ;
Chow, Joseph Y. J. ;
Recker, Will W. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 62 :68-88
[10]   A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem [J].
Allahyari, Somayeh ;
Salari, Majid ;
Vigo, Daniele .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (03) :756-768
12345678910