| 引用本文: | 李建武, 李敏强.对遗传算法困难度测量的基因关联法的研究[J].控制理论与应用,2004,21(2):247~251.[点击复制] |
| LI Jian-wu, LI Min-qiang.Study on epistasis for measuring GA-hardness[J].Control Theory and Technology,2004,21(2):247~251.[点击复制] |
|
| 对遗传算法困难度测量的基因关联法的研究 |
| Study on epistasis for measuring GA-hardness |
| 摘要点击 1704 全文点击 1460 投稿时间：2002-07-22 修订日期：2003-04-21 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 2004,21(2):247-251 |
| 中文关键词 遗传算法 基因关联 遗传算法困难度 NK-模型 |
| 英文关键词 genetic algorithms epistasis GA-hardness NK-models |
| 基金项目 国家自然科学基金项目(70171002,69974026). |
|
| 中文摘要 |
| 针对基因关联测度法的本质及意义进行了详细的理论剖析和实证研究.首先分析了反映遗传算法基因关联程度的标准化的基因关联方差与基因关联相关系数,进一步归纳出两个基本定理,并给予了严格的数学证明.最后用一些初等函数及NNK-模型对这一方法进行了实证分析,实验结果表明,对于困难问题该方法能够给予准确的判别,而对于某些较为容易的问题可能产生误判. |
| 英文摘要 |
| Epistasis is an important index reflecting the extent of GA-Hardness. This paper is to analyze the essence of epistasis and its significance in measuring GA-hardness from both aspects of theory and practice. Based on analysis of the Euclidean normalization of the epistasis variance and the epistasis correlation coefficient, which reflect the extent of epistasis of GA, two theorems are formulated and proved. Then the method is verified by experiments using some elementary functions and NK-models. The obtained results show that the method can determine the difficult GA-hardness problems, however, it may classify some easy problems to a wrong category. |
|
|
|
|
|