| 最大团问题的改进蚁群算法求解 |
| |
| 引用本文： | 陈荣.最大团问题的改进蚁群算法求解[J].微处理机,2011,32(1):64-66. |
| |
| 作者姓名： | 陈荣 |
| |
| 作者单位： | 陕西广播电视大学,西安,710068 |
| |
| 摘 要： | 为了更好的解决最大团问题,提出一种改进的蚁群算法。通过提取图的顶点信息,将图用信息素模型来表示;根据最大团问题的约束条件利用蚁群构造极大团,并进行实时的全局信息素更新和局部信息素更新,直到找到最大团。实验结果表明,算法能较好的实现最大团问题,算法性能高于通用的蚁群算法。
|
| 关 键 词： | 最大团 蚁群 信息素模型 局部 |
Improved Ant Colony Algorithm for Maximum Clique Problem |
| |
| CHEN Rong.Improved Ant Colony Algorithm for Maximum Clique Problem[J].Microprocessors,2011,32(1):64-66. |
| |
| Authors: | CHEN Rong |
| |
| Affiliation: | CHEN Rong(Shannxi Radio & TV University,Xi'an 710068,China) |
| |
| Abstract: | In order to solve maximum clique problem better,an improved ant colony algorithm is proposed.By extracting vertex information of the graph,the graph is represented by pheromone trail.According to the constraints of maximum clique problem,larger clique is constructed by ant colony,and updating global pheromone information and local pheromone information real-time,until finding the maximum clique.Experimental results show that this method can achieve maximum clique problem and the performance is higher than t... |
| |
| Keywords: | Maximum Clique Ant Colony Pheromone Trail Local |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
