Infeasibility and structural bias in differential evolution

被引:78
作者
Caraffini, Fabio [1 ]
Kononova, Anna V. [2 ,3 ]
Corne, David [2 ]
机构
[1] De Montfort Univ, Sch Comp Sci & Informat, Inst Artificial Intelligence, Leicester LE1 9BH, Leics, England
[2] Heriot Watt Univ, Dept Comp Sci, Edinburgh EH14 4AS, Midlothian, Scotland
[3] Hogesch Rotterdam, Sch Commun Media & Informat Technol, Rotterdam, Netherlands
关键词
Structural bias; Algorithmic design; Differential evolution; Population-based algorithms; Optimisation; PARTICLE SWARM OPTIMIZATION; CONVERGENCE; ALGORITHMS;
D O I
10.1016/j.ins.2019.05.019
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Structural bias is a recently identified property of optimisation algorithms, causing them to favour certain regions of the search space over others, independently of the objective function. Since structural bias can adversely affect the progress of optimisation, a better understanding of it is needed in order to inform the theory and practice of algorithm design. For example, it is generally accepted that larger populations are favoured when solution quality is paramount and time constraints are permissive. However, common variants of both Genetic Algorithms and Particle Swarm Optimisation have been found to exhibit structural bias that increases with population size. Herein we investigate structural bias in popular variants of Differential Evolution (DE), and attempt to identify which algorithm features trigger its emergence. In particular, we focus on the (often overlooked) constraint handling mechanism. Our results suggest that DE is generally robust to structural bias. Only one of the variants studied - DE/current-to-best/1/bin - shows clear signs of bias, however this is mitigated by a judicious choice of constraint handling technique. These findings contribute towards explaining the widespread success of DE in algorithm comparison studies; its robustness to structural bias represents the absence of a factor that may confound other algorithms. (C) 2019 Published by Elsevier Inc.
引用
收藏
页码:161 / 179
页数:19
相关论文
共 50 条
[1]   Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[2]  
[Anonymous], INTRO EVOLUTIONARY C
[3]  
[Anonymous], 2000, P MENDEL BRNO CZECH
[4]   Population size reduction for the differential evolution algorithm [J].
Brest, Janez ;
Maucec, Mirjam Sepesy .
APPLIED INTELLIGENCE, 2008, 29 (03) :228-247
[5]   Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems [J].
Brest, Janez ;
Greiner, Saso ;
Boskovic, Borko ;
Mernik, Marjan ;
Zumer, Vijern .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :646-657
[6]  
Burke E.K., 2019, Handbook of Metaheuristics. International Series in Operations Research & Management Science, V272, P453, DOI [10.1007/978-3-319-91086-414, DOI 10.1007/978-3-319-91086-414]
[7]  
Caraffini F., 2019, INFEASIBILITY STRUCT
[8]  
Caraffini F., 2016, JYVASKYLA STUDIES CO
[9]   A study on rotation invariance in differential evolution [J].
Caraffini, Fabio ;
Neri, Ferrante .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 50
[10]   Structural Bias in Differential Evolution: a Preliminary Study [J].
Caraffini, Fabio ;
Kononova, Anna V. .
14TH INTERNATIONAL GLOBAL OPTIMIZATION WORKSHOP (LEGO), 2019, 2070