A study on rotation invariance in differential evolution

被引:26
作者
Caraffini, Fabio [1 ]
Neri, Ferrante [2 ]
机构
[1] De Montfort Univ, Sch Comp Sci & Informat, Inst Artificial Intelligence, Leicester, Leics, England
[2] Univ Nottingham, Sch Comp Sci, ASAP Grp, Nottingham, England
关键词
Epistasis; Separability; Rotational invariance; Differential evolution; OPTIMIZATION; ADAPTATION; CROSSOVER; DESIGN;
D O I
10.1016/j.swevo.2018.08.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Epistasis is the correlation between the variables of a function and is a challenge often posed by real-world optimisation problems. Synthetic benchmark problems simulate a highly epistatic problem by performing a so-called problem's rotation. Mutation in Differential Evolution (DE) is inherently rotational invariant since it simultaneously perturbs all the variables. On the other hand, crossover, albeit fundamental for achieving a good performance, retains some of the variables, thus being inadequate to tackle highly epistatic problems. This article proposes an extensive study on rotational invariant crossovers in DE. We propose an analysis of the literature, a taxonomy of the proposed method and an experimental setup where each problem is addressed in both its non-rotated and rotated version. Our experimental study includes 280 problems over five different levels of dimensionality and nine algorithms. Numerical results show that 1) for a fixed quota of transferred design variables, the exponential crossover displays a better performance, on both rotated and non-rotated problems, in high dimensions while the binomial crossover seems to be preferable in low dimensions; 2) the rotational invariant mutation DE/current-to-rand is not competitive with standard DE implementations throughout the entire set of experiments we have presented; 3) DE crossovers that perform a change of coordinates to distribute the moves over the components of the offspring offer high-performance results on some problems. However, on average the standard DE/rand/1/exp appears to achieve the best performance on both rotated and non-rotated testbeds.
引用
收藏
页数:20
相关论文
共 54 条
[1]   Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy [J].
Al-Dabbagh, Rawaa Dawoud ;
Neri, Ferrante ;
Idris, Norisma ;
Baba, Mohd Sapiyan .
SWARM AND EVOLUTIONARY COMPUTATION, 2018, 43 :284-311
[2]  
Anik MTA, 2013, 2013 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN ELECTRICAL ENGINEERING (ICAEE 2013), P235, DOI 10.1109/ICAEE.2013.6750339
[3]  
[Anonymous], 201311 ZHENGZH U
[4]  
[Anonymous], 2010, RR6829 INRIA
[5]  
[Anonymous], 2010, TECH REP
[6]  
Awad N.H., 2016, Technical Report, DOI DOI 10.1007/S00366-020-01233-2
[7]  
Back Thomas., 1996, EVOLUTIONARY ALGORIT
[8]   A survey on metaheuristics for stochastic combinatorial optimization [J].
Bianchi L. ;
Dorigo M. ;
Gambardella L.M. ;
Gutjahr W.J. .
Natural Computing, 2009, 8 (2) :239-287
[9]  
Brest J, 2015, ADAPT LEARN OPTIM, V18, P53, DOI 10.1007/978-3-319-14400-9_2
[10]   Differential Evolution with Rotation-Invariant Mutation and Competing-Strategies Adaptation [J].
Bujok, Petr ;
Tvrdik, Josef ;
Polakova, Radka .
2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, :2253-2258