What is it about?

This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and accurate way. A classification scheme is introduced and presented in a tabular form called TEA (Table of Evolutionary Algorithms). It distinguishes between different classes of evolutionary algorithms (e.g., genetic algorithms, ant systems) by enumerating the fundamental ingredients of each of these algorithms. At the end, possible uses of the TEA are illustrated on classical evolutionary algorithms.

Featured Image

Read the Original

This page is a summary of: , Journal of Heuristics, January 1999, Springer Science + Business Media,
DOI: 10.1023/a:1009625526657.
You can read the full text:

Read

Contributors

The following have contributed to this page