Journal of Heuristics

, Volume 5, Issue 2, pp 145–158

A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization

Authors

  • Patrice Calégari
    • Department of Mathematics and Computer ScienceSwiss Federal Institute of Technology
  • Giovanni Coray
    • Department of Mathematics and Computer ScienceSwiss Federal Institute of Technology
  • Alain Hertz
    • Department of Mathematics and Computer ScienceSwiss Federal Institute of Technology
  • Daniel Kobler
    • Department of Mathematics and Computer ScienceSwiss Federal Institute of Technology
  • Pierre Kuonen
    • Department of Mathematics and Computer ScienceSwiss Federal Institute of Technology
Article

DOI: 10.1023/A:1009625526657

Cite this article as:
Calégari, P., Coray, G., Hertz, A. et al. Journal of Heuristics (1999) 5: 145. doi:10.1023/A:1009625526657

Abstract

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.

evolutionary algorithmsgenetic algorithmstaxonomy

Copyright information

© Kluwer Academic Publishers 1999