TL;DR本文通过提出多个变量漂移定理,证明了使用一种新的 (1+1)- 型算法以及具有适应性变异强度的做法来解决 OneMax 问题所需的运行时间为 n ln (n) - cn ± o (n),并在固定预算视角下找到相对于已有算法最优解约高 13%。
Abstract
It has been observed that some working principles of evolutionary algorithms,
in particular, the influence of the parameters, cannot be understood from
results on the asymptotic order of the runtime, but only from more precise
results. In this work, we complement the emerging topic of