基于超顶点交流策略的并行蚁群算法  

Parallel Ant Colony Algorithm with the Information Exchange Based on Super Vertexes

作　　者：章春芳[1] 

机构地区：[1]南京林业大学信息科学技术学院,江苏南京210037

出　　处：《江南大学学报（自然科学版）》2007年第6期895-899,共5页Joural of Jiangnan University (Natural Science Edition)　

摘　　要：通过分析影响并行蚁群算法性能的诸多因素,以提高算法效率减少通信量为主旨,提出了1种基于超顶点交流策略的并行蚁群算法.在该算法中,处理机之间交流的内容不再是最优解或信息素矩阵,而是由若干个顶点组合成的超顶点,从而改变了计算粒度;其次,又提出了1种更忠实于真实蚁群信息系统的基于信息素递减的信息素更新方法,减少了最优解对蚂蚁后选择路径上信息素的影响.通过对TSP进行的实验表明,与其他交流策略的并行蚁群算法相比,该算法有较强的全局收敛性和更快的寻优速度.In order to improve the performance of parallel ant colony algorithms, an adaptive parallel ant colony algorithm with the information exchange based on super vertexes of a certain characteristic is proposed. The content of information exchange is the super vertexs composed of several vertexes, no longer being the best solutions or the matrix of pheromone. A new formula updating pheromone based on pheromone descending is introduced, which can reduce the influence of pheromone on subsequent ants. The algorithm is applied to the TSP on the massive parallel processors Shengteng 1800. The comparison between traditional ACO and other parallel ant colony algorithm demonstrates that the algorithm brings higher global convergence and speed of optimization.

关 键 词：超顶点 信息交流 信息素 并行蚁群算法 

分 类 号：TP37[自动化与计算机技术—计算机系统结构]