摘要
基于对蚂蚁种群中兵蚁和工蚁在觅食过程中合作关系的仿生,提出了一种改进型蚁群算法。在该算法中同时存在着兵蚁子种群与工蚁子种群两个种群,两个子种群并行搜索,通过兵蚁的分布来影响到工蚁的移动选择,以取得各蚂蚁子群体中解的多样性和收敛性之间的动态平衡。基于旅行商问题的实验证明,算法具有较好的全局搜索能力和收敛速度。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第13期39-41,共3页
Computer Engineering and Applications
基金
国家自然科学基金No.70701013~~
关键词
蚁群算法
旅行商问题
信息素
兵蚁
工蚁
ant colony algorithm
Traveling Salesman Problem（TSP）
pheromone
soldier ant
worker ant
