On the Asymptotic Behavior of Multirecombinant Evolution Strategies


The performance of (==;)-ESs (Evolution Strategies) in the asymptotic limit for N ! 1 and ! 1 is investigated. The conjecture made by Schwefel that the maximum performance of such strategies scales like ln(==) will be proved. Furthermore, it will be shown that an optimally tuned (==;)-ES performs exactly times faster than an optimally tuned (1+1)-ES, if the… (More)
DOI: 10.1007/3-540-61723-X_976


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics