| 基于最小生成1-树动态候选集的蚁群算法 |
| |
| 引用本文： | 赵玲,刘三阳,寇晓丽. 基于最小生成1-树动态候选集的蚁群算法[J]. 计算机工程与应用, 2006, 42(34): 42-44 |
| |
| 作者姓名： | 赵玲 刘三阳 寇晓丽 |
| |
| 作者单位： | 西安电子科技大学,理学院,西安,710071;集美大学,理学院,福建,厦门,361021;西安电子科技大学,理学院,西安,710071 |
| |
| 摘 要： | 利用旅行商问题中最优路径和生成树之间的关系,论文将最小生成1-树的概念引入蚁群算法,并提出一种新的量度来构造动态候选集。通过数据实验,表明该算法不仅有效地防止了解的退化,而且提高了搜索精度,收敛性有了明显改善。
|
| 关 键 词： | 蚁群算法 最小生成1-树 旅行商问题 候选集 |
| 文章编号： | 1002-8331（2006）34-0042-03 |
| 收稿时间： | 2005-12-01 |
| 修稿时间： | 2005-12-01 |
Ant Colony Algorithm Based on Dynamic Candidate Sets of Minimum Spanning 1-tree |
| |
| ZHAO Ling,LIU San-yang,KOU Xiao-li. Ant Colony Algorithm Based on Dynamic Candidate Sets of Minimum Spanning 1-tree[J]. Computer Engineering and Applications, 2006, 42(34): 42-44 |
| |
| Authors: | ZHAO Ling LIU San-yang KOU Xiao-li |
| |
| Abstract: | 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. |
| |
| Keywords: | ant colony algorithm minimum spanning 1-tree traveling salesman problems(TSP) candidate sets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
