期刊
THEORETICAL COMPUTER SCIENCE
卷 561, 期 -, 页码 37-56出版社
ELSEVIER
DOI: 10.1016/j.tcs.2014.10.028
关键词
Evolutionary dynamic optimisation; Diversity mechanisms; Runtime analysis; Populations
资金
- EPSRC [EP/H028900/1]
- Engineering and Physical Sciences Research Council [EP/H028900/1] Funding Source: researchfish
- EPSRC [EP/H028900/1] Funding Source: UKRI
Evolutionary dynamic optimisation has become one of the most active research areas in evolutionary computation. We consider the BALANCE function for which the poor expected performance of the (1 + 1) EA at low frequencies of change has been shown in the literature. We analyse the impact of populations and diversity mechanisms towards the robustness of evolutionary algorithms with respect to frequencies of change. We rigorously prove that there exists a sufficiently low frequency of change such that the (mu + 1) EA without diversity requires exponential time with overwhelming probability for sublinear population sizes. The same result also holds if the algorithm is equipped with a genotype diversity mechanism. Furthermore we prove that a crowding mechanism makes the performance of the (mu + 1) EA much worse (i.e., it is inefficient for any population size). On the positive side we prove that, independently of the frequency of change, a fitness-diversity mechanism turns the runtime from exponential to polynomial. Finally, we show how a careful use of fitness-sharing together with a crowding mechanism is effective already with a population of size 2. We shed light through experiments when our theoretical results do not cover the whole parameter range. (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据