A framework for the description of evolutionary algorithms

被引:73
作者
Hertz, A [1 ]
Kobler, D [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Dept Math, CH-1015 Lausanne, Switzerland
关键词
optimisation; population-based methods; evolutionary algorithms;
D O I
10.1016/S0377-2217(99)00435-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Evolutionary algorithms (EA) are optimisation techniques inspired from natural evolution processes. They handle a population of individuals that evolve with the help of information exchange procedures. Each individual may also evolve independently. Periods of co-operation alternate with periods of self-adaptation. We define a terminology and give a general framework for the description of the main features of any particular evolutionary algorithm. Such a description does not provide, nor does it replace, algorithm pseudo-codes. The aim is to develop tools that may help understanding the "philosophy" of such methods. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 40 条
[1]  
[Anonymous], P 3 INT C SIM AD BEH
[2]  
[Anonymous], 1994, BELGIAN J OPERATIONS
[3]  
[Anonymous], 1991, Handbook of genetic algorithms
[4]  
BEASLEY J, 1996, EUR J OPER RES, V94, P393
[5]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[6]  
Blazewicz J., 1993, SCHEDULING COMPUTER
[7]   A taxonomy of evolutionary algorithms in combinatorial optimization [J].
Calégari, P ;
Coray, G ;
Hertz, A ;
Kobler, D ;
Kuonen, P .
JOURNAL OF HEURISTICS, 1999, 5 (02) :145-158
[8]  
CALEGARI P, 1997, 9702 ORWP
[9]  
Cantu-Paz E, 1995, SUMMARY RES PARALLEL
[10]  
CHU PC, 1996, GENETIC ALGORITHM MU