A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Completely Derandomized Self-Adaptation in Evolution Strategies
2001
Evolutionary Computation
This paper puts forward two useful methods for self-adaptation of the mutation distribution -the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation distributions are developed. Applying arbitrary, normal mutation distributions is equivalent to applying a general, linear problem encoding. The underlying objective
doi:10.1162/106365601750190398
pmid:11382355
fatcat:xa472ewwdzhqxdlsedgsk34eom