@inproceedings{fcbf7dd611e14541bc33a77df069b211,
title = "On the runtime analysis of fitness sharing mechanisms",
abstract = "Fitness sharing is a popular diversity mechanism implementing the idea that similar individuals in the population have to share resources and thus, share their fitnesses. Previous runtime analyses of fitness sharing studied a variant where selection was based on populations instead of individuals. We use runtime analysis to highlight the benefits and dangers of the original fitness sharing mechanism on the well-known test problem TwoMax, where diversity is crucial for finding both optima. In contrast to population-based sharing, a (2+1) EA in the original setting does not guarantee finding both optima in polynomial time; however, a (μ+1) EA with μ ≥ 3 always succeeds in expected polynomial time. We further show theoretically and empirically that large offspring populations in (μ+λ) EAs can be detrimental as overpopulation can make clusters of search points go extinct.",
keywords = "Diversity mechanisms, Evolutionary computation, Fitness sharing, Runtime analysis",
author = "Oliveto, {Pietro S.} and Dirk Sudholt and Christine Zarges",
year = "2014",
doi = "10.1007/978-3-319-10762-2_92",
language = "English",
isbn = "9783319107615",
volume = "8672",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "932--941",
editor = "Thomas Bartz-Beielstein and Branke, {J{\"u}rgen } and Bogdan Filipi{\v c} and JIm Smith",
booktitle = "Parallel Problem Solving from Nature – PPSN XIII",
note = "13th International Conference on Parallel Problem Solving from Nature – PPSN XIII ; Conference date: 13-09-2014 Through 17-09-2014",
}