Evolution strategies – A comprehensive introduction

被引：899

作者：

Hans-Georg Beyer

Hans-Paul Schwefel

机构：

[1] University of Dortmund,Department of Computer Science XI

来源：

Natural Computing | 2002年 / 1卷 / 1期

关键词：

computational intelligence; Darwinian evolution; design principles for genetic operators; evolutionary computation; evolution strategies; optimization;

D O I：

10.1023/A:1015059928466

中图分类号：

学科分类号：

摘要：

This article gives a comprehensive introduction into one of the main branches of evolutionary computation – the evolution strategies (ES) the history of which dates back to the 1960s in Germany. Starting from a survey of history the philosophical background is explained in order to make understandable why ES are realized in the way they are. Basic ES algorithms and design principles for variation and selection operators as well as theoretical issues are presented, and future branches of ES research are discussed.

引用

页码：3 / 52

页数：49

共 30 条

[21]

Mühlenbein H(undefined)-ES on the parabolic ridge undefined undefined undefined-undefined

[22]

Mahnig T(undefined)Analysis of a simple ES on the “parabolic ridge” undefined undefined undefined-undefined

[23]

Oyman AI(undefined)On linear convergence of a class of random search algorithms undefined undefined undefined-undefined

[24]

Beyer H-G(undefined)How mutation and selection solve long-path problems in polynomial expected time undefined undefined undefined-undefined

[25]

Oyman AI(undefined)Evolving artificial neural networks undefined undefined undefined-undefined

[26]

Beyer H-G(undefined)undefined undefined undefined undefined-undefined

[27]

Schwefel H-P(undefined)undefined undefined undefined undefined-undefined

[28]

Rappl G(undefined)undefined undefined undefined undefined-undefined

[29]

Rudolph G(undefined)undefined undefined undefined undefined-undefined

[30]

Yao X(undefined)undefined undefined undefined undefined-undefined

← 1 2 3 →