摘要
为了更好的解决最大团问题,提出一种改进的蚁群算法。通过提取图的顶点信息,将图用信息素模型来表示;根据最大团问题的约束条件利用蚁群构造极大团,并进行实时的全局信息素更新和局部信息素更新,直到找到最大团。实验结果表明,算法能较好的实现最大团问题,算法性能高于通用的蚁群算法。
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 the common ant colony algorithms.
出处
《微处理机》
2011年第1期64-66,共3页
Microprocessors
关键词
最大团
蚁群
信息素模型
局部
Maximum Clique
Ant Colony
Pheromone Trail
Local
