How to analyse evolutionary algorithms

Many variants of evolutionary algorithms have been designed and applied. The experimental knowledge is immense. The rigorous analysis of evolutionary algorithms is difficult, but such a theory can help to understand, design, and teach evolutionary algorithms. In this survey, first the history of attempts to analyse evolutionary algorithms is described and then new methods for continuous as well as discrete search spaces are presented and discussed.

Authors

• Hans-Georg Beyer
• Hans-Paul Schwefel
• Ingo Wegener

Keywords

No keywords are indexed for this paper.