When the Plus Strategy Outperforms the Comma Strategyand When Not
When the Plus Strategy Outperforms the Comma Strategyand When Not
复制标题
当加号策略优于逗号策略时以及何时不优于逗号策略
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
T. Storch
中科院分区：
文献类型：
--
作者：
J. Jägersküpper;T. Storch
偶尔也会有关于是否使用精英选择的长期辩论。在本文中，简单的（1，λ）EA和{1 + λ）EA操作{0，l}n进行了比较，通过严格的运行时分析。结果是，只有λ的值是n的对数才是有趣的。一个说明性的功能，新开发的证明方法表明，（1，λ）EA -其中λ是对数n -优于（1 + λ）EA的任何λ。对于较小的后代群体的（1，λ）EA是低效的，每个功能与一个唯一的最佳值，而较大的λ的两个随机搜索算法的行为几乎等同。
Occasionally there have been long debates on whether to use elitist selection or not. In the present paper the simple (1, lambda) EA and {1 + lambda) EA operating on {0, l}n are compared by means of a rigorous runtime analysis. It turns out that only values for lambda that are logarithmic in n are interesting. An illustrative function is presented for which newly developed proof methods show that the (1, lambda) EA - where lambda is logarithmic in n - outperforms the (1 + lambda) EA for any lambda. For smaller offspring populations the (1, lambda) EA is inefficient on every function with a unique optimum, whereas for larger lambda the two randomized search heuristics behave almost equivalently.