A Compound Sinusoidal Differential Evolution algorithm for continuous optimization Check

被引:21
作者
Draa, Amer [1 ]
Chettah, Khadidja [1 ]
Talbi, Hichem [1 ]
机构
[1] Constantine 2 Univ, NTIC Fac, MISC Lab, Ali Mendjeli, Algeria
关键词
Parameter setting; Compound Sinusoidal Differential Evolution; Continuous optimization; Opposition-based learning; Multi-start algorithm; GLOBAL OPTIMIZATION; PARAMETER; MUTATION;
D O I
10.1016/j.swevo.2018.10.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a new variant of the Sinusoidal Differential Evolution (SinDE) algorithm, we call it the OCSinDE for Opposition-based Compound SinDE. It is based on the use of a compound sinusoidal formula for adjusting the scaling factor and crossover rate values of the Differential Evolution (DE) algorithm. In addition, Opposition-Based Learning (OBL) and a restart mechanism are adopted to boost the algorithm's exploration ability and avoid stagnation. The proposed approach has been tested on the reference black-box optimization benchmarking framework, BBOB, and compared to the standard DE algorithm, six variants of the original SinDE, and seven state-of-the-art differential evolution algorithms. Further comparisons to other state-of-the-art algorithms, including the famous multi-start CMAES, have been conducted. The obtained results have proven that the proposed OCSinDE does not only eliminate the effort dedicated to set the F and CR parameters, but is also very effective in terms of search performance; it outperformed the SinDE variants, many DE algorithms, the CMAES, and other metaheuristics.
引用
收藏
页数:28
相关论文
共 64 条
[1]  
Abbass HA, 2002, IEEE C EVOL COMPUTAT, P831, DOI 10.1109/CEC.2002.1007033
[2]  
Abbass HA, 2001, IEEE C EVOL COMPUTAT, P207, DOI 10.1109/CEC.2001.934391
[3]   Opposition-based learning in the shuffled differential evolution algorithm [J].
Ahandani, Morteza Alinia ;
Alavi-Rad, Hosein .
SOFT COMPUTING, 2012, 16 (08) :1303-1337
[4]   Population set-based global optimization algorithms:: some modifications and numerical studies [J].
Ali, MM ;
Törn, A .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (10) :1703-1725
[5]  
[Anonymous], 2011, J. Comput. Inf. Syst.
[6]  
[Anonymous], 2009, PARTICLE SWARM OPTIM
[7]  
[Anonymous], 2001, Estimation of distribution algorithms: A new tool for evolutionary computation
[8]  
[Anonymous], 2012, TECH REP
[9]  
Auger A., 2009, Technical Report 2009/20
[10]  
Awad N., 2016, SWARM EVOLUT COMPUT, V39, P141