基于最小生成1-树动态候选集的蚁群算法

Ant Colony Algorithm Based on Dynamic Candidate Sets of Minimum Spanning 1-tree

利用旅行商问题中最优路径和生成树之间的关系,论文将最小生成1-树的概念引入蚁群算法,并提出一种新的量度来构造动态候选集。通过数据实验,表明该算法不仅有效地防止了解的退化,而且提高了搜索精度,收敛性有了明显改善。

In light of the relationship between the optimal TSP tours and spanning trees,the minimum spanning 1-tree and a new measurement are introduced into the ant colony algorithm to construct dynamic candidate sets.Computational tests show that the improved algorithm not only avoids the degradation of solution quality ,but also improves the precision and convergence.