DocumentCode :
623452
Title :
Common grounding optimization for CVRP
Author :
Wanfeng Liu ; Xia Li ; Naili Luo ; Xiaohong Chen
Author_Institution :
Coll. of Inf. Eng., Shenzhen Univ., Shenzhen, China
fYear :
2013
fDate :
19-21 June 2013
Firstpage :
1755
Lastpage :
1758
Abstract :
In this paper, a new evolutionary algorithm called common grounding optimization (CGO) is proposed for capacitated vehicle routing problem (CVRP). The algorithm consists of three main operations: common ground seeking, encapsulating, and iterated local search (ILS). The algorithm is population-based with all the individual solutions eventually converge to the same optimal value. Experimental results show that the novel algorithm can solve the CVRP with better solutions in very short time.
Keywords :
evolutionary computation; iterative methods; search problems; vehicle routing; CVRP; ILS operation; capacitated vehicle routing problem; common ground seeking operation; common grounding optimization; encapsulating operation; evolutionary algorithm; iterated local search operation; population-based algorithm; Grounding; Optimization; Routing; Search problems; Sociology; Statistics; Vehicles; common grounding optimization; evolutionary algorithm; iterated local search; vehicle routing problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Electronics and Applications (ICIEA), 2013 8th IEEE Conference on
Conference_Location :
Melbourne, VIC
Print_ISBN :
978-1-4673-6320-4
Type :
conf
DOI :
10.1109/ICIEA.2013.6566652
Filename :
6566652
Link To Document :
بازگشت