| 求极小碰集的遗传算法 |
| |
| 引用本文： | 张楠,孙吉贵,赵相福,欧阳丹彤.求极小碰集的遗传算法[J].广西师范大学学报(自然科学版),2006,24(4):62-65. |
| |
| 作者姓名： | 张楠 孙吉贵 赵相福 欧阳丹彤 |
| |
| 作者单位： | 吉林大学,计算机科学与技术学院,吉林,长春,130012 |
| |
| 基金项目： | 国家自然科学基金
,
教育部新世纪优秀资助项目人才支持计划"
,
吉林省杰出青年科学基金 |
| |
| 摘 要： | 采用改进的遗传算法求解极小碰集问题。在标准遗传算法的基础上,引入了精英策略以提高算法的搜索效率;在进化过程中加入了极小化操作,使得得到的结果都是极小碰集。同时通过实例,验证了极小化操作的有效性。最后,将此算法与其他求极小碰集的算法进行了比较。
|
| 关 键 词： | 极小碰集 遗传算法 精英策略 |
| 文章编号： | 1001-6600（2006）04-0062-04 |
| 收稿时间： | 2006-05-31 |
| 修稿时间： | 2006年5月31日 |
Computing Minimal Hitting Sets with Genetic Algorithm |
| |
| ZHANG Nan,SUN Ji-gui,ZHAO Xiang-fu,OUYANG Dan-tong.Computing Minimal Hitting Sets with Genetic Algorithm[J].Journal of Guangxi Normal University(Natural Science Edition),2006,24(4):62-65. |
| |
| Authors: | ZHANG Nan SUN Ji-gui ZHAO Xiang-fu OUYANG Dan-tong |
| |
| Institution: | College of Computer Science and Technology,Jilin University,Changchun 130012,China |
| |
| Abstract: | In this paper,an improved genetic algorithm (called MGA) is used to compute minimal hitting sets.In order to improve the algorithm's efficiency,elite strategy was introduced based on the standard GA.At the same time,minimization operations were added during the evolution process so that the solutions gotten are all minimal hitting sets.Its validity was proved by different examples.Finally,comparisons were made between our algorithm and other approaches for computing the minimal hitting sets. |
| |
| Keywords: | minimal hitting set genetic algorithm elite strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
