TY - JOUR
T1 - On the Benefits and Risks of Using Fitness Sharing for Multimodal Optimisation
AU - Oliveto, Pietro S.
AU - Sudholt, Dirk
AU - Zarges, Christine
N1 - Funding Information:
The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under Grant Agreement No. 618091 (SAGE) and by the EPSRC under Grant Agreement No. EP/M004252/1.
Funding Information:
The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under Grant Agreement No. 618091 (SAGE) and by the EPSRC under Grant Agreement No. EP/M004252/1 .
Publisher Copyright:
© 2018 The Author(s)
PY - 2019/6/14
Y1 - 2019/6/14
N2 - Fitness sharing is a well-known diversity mechanism inspired by the idea that individuals in the population that are close to each other have to share their fitnesses in a similar way to how species in nature occupying the same ecological environment have to share resources. Thus, by derating the fitness of close individuals one hopes to encourage the population to spread out more. Previous runtime analyses of fitness sharing studied a variant where selection was based on populations instead of individuals. We study the conventional fitness sharing mechanism based on individuals and use runtime analysis to highlight its benefits and dangers on the well-known bimodal test problem TWOMAX, where diversity is crucial for finding both optima. In contrast to population-based sharing, a (2+1) evolutionary algorithm (EA) with conventional fitness sharing does not guarantee to find both optima in polynomial time even when problem specific knowledge is used to estimate the distance between individuals; however, a (μ+1) EA with μ≥3 always succeeds in expected polynomial time. We further show theoretically and empirically that large offspring populations in (μ+λ) EA s can be detrimental as creating too many offspring in one particular area of the search space can make all individuals in this area go extinct. We conclude the paper with an empirical study indicating that similar conclusions may be drawn when using the genotypic distance that has to be relied upon when no problem specific knowledge is available.
AB - Fitness sharing is a well-known diversity mechanism inspired by the idea that individuals in the population that are close to each other have to share their fitnesses in a similar way to how species in nature occupying the same ecological environment have to share resources. Thus, by derating the fitness of close individuals one hopes to encourage the population to spread out more. Previous runtime analyses of fitness sharing studied a variant where selection was based on populations instead of individuals. We study the conventional fitness sharing mechanism based on individuals and use runtime analysis to highlight its benefits and dangers on the well-known bimodal test problem TWOMAX, where diversity is crucial for finding both optima. In contrast to population-based sharing, a (2+1) evolutionary algorithm (EA) with conventional fitness sharing does not guarantee to find both optima in polynomial time even when problem specific knowledge is used to estimate the distance between individuals; however, a (μ+1) EA with μ≥3 always succeeds in expected polynomial time. We further show theoretically and empirically that large offspring populations in (μ+λ) EA s can be detrimental as creating too many offspring in one particular area of the search space can make all individuals in this area go extinct. We conclude the paper with an empirical study indicating that similar conclusions may be drawn when using the genotypic distance that has to be relied upon when no problem specific knowledge is available.
KW - Evolutionary computation
KW - Diversity mechanisms
KW - Fitness sharing
KW - Multimodal optimisation
KW - Runtime analysis
UR - http://www.scopus.com/inward/record.url?scp=85050395281&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2018.07.007
DO - 10.1016/j.tcs.2018.07.007
M3 - Article
SN - 0304-3975
VL - 773
SP - 53
EP - 70
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -