Differential evolution algorithm with local search for capacitated vehicle routing problem

被引:47
作者
Teoh, Boon Ean [1 ]
Ponnambalam, S. G. [1 ,2 ]
Kanagaraj, G. [3 ]
机构
[1] Monash Univ Malaysia, Sch Engn, Selangor, Malaysia
[2] Monash Univ Malaysia, Adv Engn Platform, Selangor, Malaysia
[3] Thiagarajar Coll Engn, Dept Mech Engn, Madurai, Tamil Nadu, India
关键词
capacitated vehicle routing problem; CVRP; differential evolution; evolutionary algorithm; local search; metaheuristic; ANT COLONY OPTIMIZATION; HYBRID GENETIC ALGORITHM; PARTICLE SWARM OPTIMIZATION; VARIABLE NEIGHBORHOOD SEARCH; TABU SEARCH; DELIVERY PROBLEM; SIMULTANEOUS PICKUP; SPLIT DELIVERIES; MEMETIC ALGORITHM; META-HEURISTICS;
D O I
10.1504/IJBIC.2015.072260
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an improved differential evolution algorithm with local search (DELS) for solving the capacitated vehicle routing problem (CVRP). The CVRP is a classical vehicle routing problem with additional constraint where the capacity of the vehicle travelling on a specific route cannot exceed the maximum vehicle capacity. Local search procedures help to explore new search areas and refine the solutions found. The proposed algorithm is tested on CVRP instances described by Augerat et al. and Christofides and Eilon. The proposed DELS approach generate quality solutions for the benchmark problems tested and are comparable to the algorithms reported in the literature.
引用
收藏
页码:321 / 342
页数:22
相关论文
共 50 条
[41]   An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem [J].
Francesco Cavaliere ;
Emilio Bendotti ;
Matteo Fischetti .
Mathematical Programming Computation, 2022, 14 :749-779
[42]   An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem [J].
Cavaliere, Francesco ;
Bendotti, Emilio ;
Fischetti, Matteo .
MATHEMATICAL PROGRAMMING COMPUTATION, 2022, 14 (04) :749-779
[43]   A tabu search algorithm for the vehicle routing problem [J].
Barbarosoglu, G ;
Ozgur, D .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (03) :255-270
[44]   Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows [J].
Brandao, Jose .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 120 :146-159
[45]   An Ant Colony Algorithm for Capacitated Vehicle Routing Problem [J].
Ni, Qiu-ping ;
Tang, Yuan-xiang ;
Shi, Li-yao .
3RD INTERNATIONAL CONFERENCE ON SOCIAL SCIENCE AND MANAGEMENT (ICSSM 2017), 2017, :570-575
[46]   Applying Genetic Algorithm for Capacitated Vehicle Routing Problem [J].
Ren, Chunyu .
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ELECTRONIC & MECHANICAL ENGINEERING AND INFORMATION TECHNOLOGY (EMEIT-2012), 2012, 23
[47]   A heuristic algorithm for the asymmetric capacitated vehicle routing problem [J].
Vigo, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 89 (01) :108-126
[48]   Improved Genetic Algorithm for Capacitated Vehicle Routing Problem [J].
Ren, Chunyu .
SUSTAINABLE DEVELOPMENT OF URBAN INFRASTRUCTURE, PTS 1-3, 2013, 253-255 :1459-1462
[49]   Solving Capacitated Vehicle Routing Problem Using Meerkat Clan Algorithm [J].
Mahmood, Noor .
INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2022, 19 (04) :689-694
[50]   Using the Ant Colony Optimization Algorithm for the Capacitated Vehicle Routing Problem [J].
Stodola, Petr ;
Mazal, Jan ;
Podhorec, Milan ;
Litvaj, Ondrej .
PROCEEDINGS OF THE 2014 16TH INTERNATIONAL CONFERENCE ON MECHATRONICS (MECHATRONIKA 2014), 2014, :503-510