Improving the vector generation strategy of Differential Evolution for large-scale optimization

被引:36
作者
Segura, Carlos [1 ]
Coello Coello, Carlos A. [2 ]
Hernandez-Diaz, Alfredo G. [3 ]
机构
[1] Ctr Res Math CIMAT, Area Comp Sci, Guanajuato 36240, Guanajuato, Mexico
[2] Natl Polytech Inst, Ctr Res & Adv Studies, Dept Comp Sci, Evolutionary Computat Grp, Mexico City 07300, DF, Mexico
[3] Pablo de Olavide Univ, Dept Econ Quantitat Methods & Econ Hist, Seville, Spain
关键词
Differential evolution; Diversity preservation; Global numerical optimization; Large-scale optimization; Vector generation strategy; CONTROL PARAMETERS; CROSSOVER;
D O I
10.1016/j.ins.2015.06.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Differential Evolution is an efficient metaheuristic for continuous optimization that suffers from the curse of dimensionality. A large amount of experimentation has allowed researchers to find several potential weaknesses in Differential Evolution. Some of these weaknesses do not significantly affect its performance when dealing with low-dimensional problems, so the research community has not paid much attention to them. The aim of this paper is to provide a better insight into the reasons of the curse of dimensionality and to propose techniques to alleviate this problem. Two different weaknesses are revisited and schemes for dealing with them are devised. The schemes increase the diversity of trial vectors and improve on the exploration capabilities of Differential Evolution. Some important mathematical properties induced by our proposals are studied and compared against those of related schemes. Experimentation with a set of problems with up to 1000 dimensions and with several variants of Differential Evolution shows that the weaknesses analyzed significantly affect the performance of Differential Evolution when used on high-dimensional optimization problems. The gains of the proposals appear when highly exploitative schemes are used. Our proposals allow for high-quality solutions with small populations, meaning that the most significant advantages emerge when dealing with large-scale optimization problems, where the benefits of using small populations have previously been shown. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:106 / 129
页数:24
相关论文
共 60 条
[1]  
Abbass HA, 2002, IEEE C EVOL COMPUTAT, P831, DOI 10.1109/CEC.2002.1007033
[2]  
[Anonymous], 1995, technical report tr-95-012
[3]  
[Anonymous], 2001, P INT JOINT C ART IN
[4]  
[Anonymous], IEEE T EVOLUT COMPUT
[5]  
[Anonymous], HDB OPTIMIZATION, DOI DOI 10.1007/978-3-642-30504-7-17
[6]  
[Anonymous], IEEE C EV COMP
[7]  
Arabas J, 2011, IEEE SYMP DIFF EVOL, P49, DOI 10.1109/SDE.2011.5952057
[8]  
Brest J., 2010, IEEE C EV COMP, P1
[9]  
Brest J., 2012, 2012 IEEE C EV COMP, P1
[10]   Population size reduction for the differential evolution algorithm [J].
Brest, Janez ;
Maucec, Mirjam Sepesy .
APPLIED INTELLIGENCE, 2008, 29 (03) :228-247