×

zbMATH — the first resource for mathematics

Theoretical aspects of evolutionary algorithms. (English) Zbl 0986.68137
Orejas, Fernando (ed.) et al., Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2076, 64-78 (2001).
Summary: Randomized search heuristics like simulated annealing and evolutionary algorithms are applied successfully in many different situations. However, the theory on these algorithms is still in its infancy. Here it is discussed how and why such a theory should be developed. Afterwards, some fundamental results on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms.
For the entire collection see [Zbl 0967.00069].

MSC:
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
PDF BibTeX XML Cite
Full Text: Link