Convergence time for the linkage learning genetic algorithm
檔案
- 000231590200001.pdf (261.6 KB, Adobe PDF)
日期
2005-09-01
類型
系所
期刊名稱
EVOLUTIONARY COMPUTATION
卷期與頁次
第 13 卷第 3 期,頁 279–302
ISSN
1063-6560
語言
英文
摘要
This paper identifies the sequential behavior of the linkage learning genetic algorithm, introduces the tightness time model for a single building block, and develops the connection between the sequential behavior and the tightness time model. By integrating the first-building-block model based on the sequential behavior, the tightness time model, and the connection between these two models, a convergence time model is constructed and empirically verified. The proposed convergence time model explains the exponentially growing time required by the linkage learning genetic algorithm when solving uniformly scaled problems.