|
|||||
|
|
| 一种求解最大独立集的自学习进化算法 | |
| 引用本文： | 丁根宏,李勤丰,李尤丰.一种求解最大独立集的自学习进化算法[J].河海大学学报(自然科学版),2008,36(6):863-866. |
| 作者姓名： | 丁根宏 李勤丰 李尤丰 |
| 作者单位： | 1. 河海大学理学院,江苏,南京,210098 2. 金陵科技学院基础部,江苏,南京,210001 3. 金陵科技学院信息技术学院,江苏,南京,210001 |
| 摘 要： | 为了求解最大独立集问题,通过对求解最大团问题EA/G算法的分析,从初始解选取、种群的构成、遗传策略等方面对EA/G算法进行了改进,提出了自学习进化算法,并在DIMACS基准图上进行了大量的实验.实验结果表明,该算法运算结果比EA/G算法所求结果有很好的改善. |
| 关 键 词： | 遗传算法 EA/G算法 最大独立集 最大团 自学习进化算法 |
| 修稿时间： | 2008/11/27 0:00:00 |
Self-learning evolution algorithm for the maximum independent set |
|
| DING Gen-hong,LI Qin-feng,LI You-feng.Self-learning evolution algorithm for the maximum independent set[J].Journal of Hohai University (Natural Sciences ),2008,36(6):863-866. | |
| Authors: | DING Gen-hong LI Qin-feng LI You-feng |
| Institution: | DING Gen-hong1,LI Qin-feng2,LI You-feng3 |
| Abstract: | In order to solve the problems concerning the maximum independent set, the EA/G algorithm was improved by analyzing the algorithm for the solutions to the maximum clique problems from the aspects of selecting the initial solution,constructing populations and genetic strategies.A self-learning evolution algorithm was put forward.After abundant experiments were performed on DIMACS benchmark.The experimental results show that the results obtained by the self-learning evolution algorithm are much better than those by the EA/G algorithm. |
| Keywords: | genetic algorithm EA/G algorithm maximum independent set maximum clique self-learning evolution algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《河海大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《河海大学学报(自然科学版)》下载免费的PDF全文 | |