当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Runtime analysis of evolutionary algorithms via symmetry arguments
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-11-04 , DOI: 10.1016/j.ipl.2020.106064 Benjamin Doerr
中文翻译:
通过对称参数对进化算法进行运行时分析
更新日期:2020-12-04
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-11-04 , DOI: 10.1016/j.ipl.2020.106064 Benjamin Doerr
We use an elementary argument building on group actions to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes an expected number of iterations to find any particular target search point. This bound is valid for all population sizes μ. Our result improves over the previous lower bound of valid for population sizes , .
中文翻译:
通过对称参数对进化算法进行运行时分析
我们使用基于群体行为的基本论证来证明Sutton和Witt(GECCO 2019)分析的无选择稳态遗传算法采用预期数量的 迭代以找到任何特定的目标搜索点。该界限对所有种群大小μ有效。我们的结果比以前的下限有所提高 适用于人口规模 , 。