On the design and analysis of evolutionary algorithms (Algorithm Engineering as a New Paradigm)
Year: 2001
Type: article
Abstract: Evolutionary algorithms are problem-independent randomized search heuristics.It is discussed when it is useful to work with such algorithms and it is argued why these search heuristics should be analyzed just as all other deterministic and randomized algorithms.Such an approach is started by analyzing a simple evolutionary algorithm on linear functions, quadratic functions, unimodal functions, and its behavior on plateaus of constant fitness.Furthermore, it is investigated what can be gained and lost by a dynamic variant of this algorithm.Finally, it is proved that crossover can decrease the run time of evolutionary algorithms significantly.
Source: 数理解析研究所講究録
Author: Ingo Wegener
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W417837755