Authors
Anna V Kononova, Fabio Caraffini, Hao Wang, Thomas Bäck
Publication date
2020/8/31
Book
International Conference on Parallel Problem Solving from Nature
Pages
229-242
Publisher
Springer International Publishing
Description
In the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely an (existing) visual and an (updated) statistical (Anderson-Darling) test. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining …
Total citations
20212022202320246534
Scholar articles
AV Kononova, F Caraffini, H Wang, T Bäck - International Conference on Parallel Problem Solving …, 2020