Calégari, Patrice; Coray, Giovanni; Hertz, Alain; Kuonen, Pierre A taxonomy of evolutionary algorithms in combinatorial optimization. (English) Zbl 1071.90572 J. Heuristics 5, No. 2, 145-158 (1999). Summary: 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. Cited in 11 Documents MSC: 90C59 Approximation methods and heuristics in mathematical programming 90C27 Combinatorial optimization Keywords:evolutionary algorithms; genetic algorithms; taxonomy PDFBibTeX XMLCite \textit{P. Calégari} et al., J. Heuristics 5, No. 2, 145--158 (1999; Zbl 1071.90572) Full Text: DOI