How to analyse evolutionary algorithms

被引：71
作者：
Beyer, HG [1 ]
Schwefel, HP [1 ]
Wegener, I [1 ]
机构：
[1] Univ Dortmund, FB Informat, D-44221 Dortmund, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2002年 / 287卷 / 01期
关键词：
D O I：
10.1016/S0304-3975(02)00137-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Many variants of evolutionary algorithms have been designed and applied. The experimental knowledge is immense. The rigorous analysis of evolutionary algorithms is difficult, but such a theory can help to understand, design, and teach evolutionary algorithms. In this survey, first the history of attempts to analyse evolutionary algorithms is described and then new methods for continuous as well as discrete search spaces are presented and discussed. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：101 / 130
页数：30
相关论文
共 90 条
[1]  
Alander J. T., 1994, Proceedings of the Second Finnish Workshop on Genetic Algorithms and Their Applications (2FWGA), P1
[2]  
[Anonymous], MAXIMUM ENTROPY FORM
[3]  
Arnold D.V., 2001, P FDN GENETIC ALGORI, V6, P127
[4]  
ARNOLD DV, 2001, THESIS U DORTMUND DO
[5]  
ARNOLD DV, IN PRESS THEORET COM
[6]  
ARNOLD DV, IN PRESS J COMPUT OP
[7]  
BACK T, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P2
[8]  
Back T., 1997, Handbook of evolutionary computation
[9]  
BELEW RK, 1991, P 4 INT C GEN ALG IC
[10]  
Beyer H.-G., 2013, THEORY EVOLUTION STR
123456789