| 遗传算法求解最大团问题研究 |
| |
| 引用本文： | 胡能发,唐为萍. 遗传算法求解最大团问题研究[J]. 湖北大学学报(自然科学版), 2011, 33(2): 256-259,264 |
| |
| 作者姓名： | 胡能发 唐为萍 |
| |
| 作者单位： | 1. 韩山师范学院数学与信息技术系,广东潮州,521041
2. 韩山师范学院生物系,广东潮州,521041 |
| |
| 摘 要： | 最大团问题是NP难解的,用遗传算法求解的关键是如何设计有效的评估函数.首先从理论上分析编码规则及适应函数对个体进化的影响,提出个体基因适应函数和个体适应函数多重评估方法,并设计求解算法.数值实验表明,算法具有较好的通用性和较高的性能.
|
| 关 键 词： | 最大团 最大独立集 遗传算法 适应函数 邻接表 |
Research on using genetic algorithm to solve MCP |
| |
| HU Nengfa,TANG Weipin. Research on using genetic algorithm to solve MCP[J]. Journal of Hubei University(Natural Science Edition), 2011, 33(2): 256-259,264 |
| |
| Authors: | HU Nengfa TANG Weipin |
| |
| Affiliation: | HU Nengfa,TANG Weipin(1.Department of Mathematics and Information Technology,Hanshan Teachers College,Chaozhou 521041,China;2.Department of Biology,Hanshan Teachers College,Chaozhou 521041,China) |
| |
| Abstract: | Maximum clique was NP difficult problem,and it was the key problem that how to design effective fitness function based on using genetic algorithm to solve the problem.It analyzed the coding rule and the fitness function theoretically to the individual evolution influence,proposed the individual gene fitness function and the individual fitness function multiple comment the evaluation method,and designed the solution algorithm.The value experiment indicated the algorithm had the good versatility and the high performance. |
| |
| Keywords: | maximum clique most greatly independent collection genetic algorithm fitness function |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
