| 新型的双种群蚁群算法 |
| |
| 引用本文： | 张晓伟,李笑雪. 新型的双种群蚁群算法[J]. 计算机工程与应用, 2011, 47(13): 39-41. DOI: 10.3778/j.issn.1002-8331.2011.13.012 |
| |
| 作者姓名： | 张晓伟 李笑雪 |
| |
| 作者单位： | 1.广东工程职业技术学院，广州 510520 2.河南财经政法大学 计算机与信息工程学院，郑州 450002 |
| |
| 摘 要： | 基于对蚂蚁种群中兵蚁和工蚁在觅食过程中合作关系的仿生，提出了一种改进型蚁群算法。在该算法中同时存在着兵蚁子种群与工蚁子种群两个种群，两个子种群并行搜索，通过兵蚁的分布来影响到工蚁的移动选择，以取得各蚂蚁子群体中解的多样性和收敛性之间的动态平衡。基于旅行商问题的实验证明，算法具有较好的全局搜索能力和收敛速度。
|
| 关 键 词： | 蚁群算法 旅行商问题 信息素 兵蚁 工蚁 |
| 修稿时间： | |
Novel dual population ant colony algorithm |
| |
| ZHANG Xiaowei,LI Xiaoxue. Novel dual population ant colony algorithm[J]. Computer Engineering and Applications, 2011, 47(13): 39-41. DOI: 10.3778/j.issn.1002-8331.2011.13.012 |
| |
| Authors: | ZHANG Xiaowei LI Xiaoxue |
| |
| Affiliation: | 1.Guangdong Polytechnic College，Guangzhou 510520，China 2.College of Computer and Information Engineering，Henan University of Economics & Law，Zhengzhou 450002，China |
| |
| Abstract: | A novel ant colony algorithm is proposed based on the bionics of cooperation relation between soldier ant and worker ant in the foraging process.Soldier ant population and worker ant population are designed to search problem solution by parallel way in proposed algorithm.The dynamic equilibrium between solution diversity and convergence speed is achieved by using the effect of the soldier ant’s distribution to worker ants’movement choice.Experimental results on traveling salesman problem show that proposed algorithm has a good global searching ability and high convergence speed. |
| |
| Keywords: | ant colony algorithm Traveling Salesman Problem（TSP） pheromone soldier ant worker ant |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
