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

来源：

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION | 2015年 / 7卷 / 05期

关键词：

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

共 133 条

[1] A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].