摘要
针对度约束最小生成树问题,借鉴人体免疫系统的适应能力和蚁群算法的全局寻优能力,提出了一种基于免疫—蚁群算法的求解方法。该算法采用Prüfer数对树进行编码及度的改进,利用免疫算法和蚁群算法的融合提高算法的执行速度和进化效率。实验结果表明,用该算法解决度约束最小生成树问题是有效的。
A new immune-ant colony algorithm is presented for the degree-constrained minimum spanning tree problem. The algorithm used the ability of adaptation of human＇s immune system for reference and the ability of searching the global optimization of ant algorithm. Pruefer number is used to code the tree and improve its degree. The algorithm＇s speed and evolutionary efficiency is enhanced by the combined of immune-ant colony algorithm. The experiment results show that this algorithm is effective on solving degree-constrained minimum spanning tree problem.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第3期694-696,699,共4页
Computer Engineering and Design
关键词
度约束
最小生成树
免疫系统
Prüfer数
免疫—蚁群算法
degree-constrained
minimum spanning tree
immune system
Prtifer number
immune-ant colony algorithm
