摘要
提出一种基于异类蚁群的双种群蚁群(Dual Population Ant Colony Algorithm Basedon Heterogeneous Ant Colonies,DPACBH)算法,算法将两种信息素更新机制不同的蚁群分别独立进行进化求解,并定期交换优良解和信息来改善解的多样性,增强跳出局部最优的能力,使算法更容易收敛到全局最优解。以TSP(Travel Salesman Problem)问题为例所进行的计算表明,该算法比基本双种群蚁群算法具有更好的收敛速度和准确性。
An algorithm of heterogeneous dual population ant colony is presented.This algorithm is based on two ant colonies using different kinds of pheromone updating mechanism,and improves the diversity of the solutions by periodically exchanging them between the two colonies.Experimental results on traveling salesman problem show that the method presented in this paper has a better global searching ability,higher convergence speed and solution diversity than that of classical ant colony algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第27期36-38,共3页
Computer Engineering and Applications
基金
国家青年科学基金(No.60803088)
关键词
双种群
异类
蚁群算法
旅行商问题
dual population ant colony
heterogeneous ant colonies
ant colony algorithm
traveling salesman problem
