Abstract
After an outline of the history of evolutionary algorithms, a new (µ, k, λ, p) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it is richer in the number of features than the meanwhile old (µ, λ) and (µ+λ) versions. Finally, all important theoretically proven facts about evolution strategies are briefly summarized and some of many open questions concerning evolutionary algorithms in general are pointed out.
Cite
CITATION STYLE
Schwefel, H. P., & Rudolph, G. (1995). Contemporary evolution strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 929, pp. 893–907). Springer Verlag. https://doi.org/10.1007/3-540-59496-5_351
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
