DocumentCode
418996
Title
Convergence time for the linkage learning genetic algorithm
Author
Chen, Ying-ping ; Goldberg, David E.
Author_Institution
Dept. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, IL, USA
Volume
1
fYear
2004
fDate
19-23 June 2004
Firstpage
39
Abstract
This paper identifies the sequential behavior of the linkage learning genetic algorithm (LLGA), introduces the tightness time model for a single building block, and develops the connection between sequential behavior and the tightness time model. By integrating the first building-block model based on sequential behavior, the tightness time model, and the connection between these two models, a convergence time model is then constructed and empirically verified. The proposed convergence time model explains the exponentially growing time required by LLGA when solving uniformly scaled problems.
Keywords
computational complexity; convergence; genetic algorithms; learning (artificial intelligence); search problems; building-block model; convergence time; linkage learning genetic algorithm; sequential behavior; single building block; tightness time model; uniformly scaled problems; Algorithm design and analysis; Biological cells; Computer science; Convergence; Couplings; Genetic algorithms; Genetic engineering; Learning systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1330835
Filename
1330835
Link To Document