Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 36-38.DOI: 10.3778/j.issn.1002-8331.2009.27.012

• 研究、探讨 • Previous Articles     Next Articles

Dual population ant colony algorithm based on heterogeneous ant colonies

HE Xue-li1,ZHANG Peng2,3,MA Miao1,LIN Jie2,HUANG Xin4   

  1. 1.School of Computer Science,Shaanxi Normal University,Xi’an 710062,China
    2.Department of Information Management and Information System,Tongji University,Shanghai 200092,China
    3.Department of Information Engineering,Xi’an University of Technology,Xi’an 710048,China
    4.School of Economic and Management,Tongji University,Shanghai 200092,China
  • Received:2008-11-03 Revised:2009-01-19 Online:2009-09-21 Published:2009-09-21
  • Contact: HE Xue-li

基于异类蚁群的双种群蚁群算法

何雪莉1,张 鹏2,3,马 苗1,林 杰2,黄 鑫4   

  1. 1.陕西师范大学 计算机科学学院,西安 710062
    2.同济大学 信息管理与信息系统系,上海 200092
    3.西安理工大学 信息工程系,西安 710048
    4.同济大学 经济与管理学院,上海 200092
  • 通讯作者: 何雪莉

Abstract: 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.

Key words: dual population ant colony, heterogeneous ant colonies, ant colony algorithm, traveling salesman problem

摘要: 提出一种基于异类蚁群的双种群蚁群(Dual Population Ant Colony Algorithm Based on Heterogeneous Ant Colonies,DPACBH)算法,算法将两种信息素更新机制不同的蚁群分别独立进行进化求解,并定期交换优良解和信息来改善解的多样性,增强跳出局部最优的能力,使算法更容易收敛到全局最优解。以TSP(Travel Salesman Problem)问题为例所进行的计算表明,该算法比基本双种群蚁群算法具有更好的收敛速度和准确性。

关键词: 双种群, 异类, 蚁群算法, 旅行商问题

CLC Number: