DMCA
Completely Derandomized Self-Adaptation in Evolution Strategies (2001)
Cached
Download Links
by
Nikolaus Hansen
,
Andreas Ostermeier
| Venue: | Evolutionary Computation |
| Citations: | 543 - 55 self |
BibTeX
@ARTICLE{Hansen01completelyderandomized,
author = {Nikolaus Hansen and Andreas Ostermeier},
title = {Completely Derandomized Self-Adaptation in Evolution Strategies},
journal = {Evolutionary Computation},
year = {2001},
volume = {9},
pages = {159--195}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
