Convergence time for the linkage learning genetic algorithm

檔案

日期

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, Y., & Goldberg, D. (2005). Convergence time for the linkage learning genetic algorithm. EVOLUTIONARY COMPUTATION, 13(3), 279–302. https://doi.org/10.1162/1063656054794806

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13352