A taxonomy of evolutionary algorithms in combinatorial optimization

作     者：Calégari, P Coray, G Hertz, A Kobler, D Kuonen, P 

作者机构：Swiss Fed Inst Technol Dept Math & Comp Sci CH-1015 Lausanne Switzerland 

出 版 物：《JOURNAL OF HEURISTICS》 (J Heuristics)

年 卷 期：1999年第5卷第2期

页      面：145-158页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Swiss National Science Fund  (21-45070.95/1) 

主　　题：evolutionary algorithms genetic algorithms taxonomy 

摘      要：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.