会议专题

PARALLEL IMPLEMENTATION OF ANT COLONY OPTIMIZATION ON MPP

An adaptive parallel ant colony algorithm (PACO) is presented. In the algorithm, we propose a strategy for information exchange between processors which make each processor choose its partner to communicate and update the pheromone adaptively. We also propose a method of adjusting the time interval of information exchange adaptively according to the diversity of the solutions so as to increase the ability of search and avoid early convergence. Experimental results show that our algorithm PACO has high convergence speed, high speedup and efficiency.

Ant colony optimization Parallel Diversity Traveling Salesman Problem

LING CHEN HAI-YING SUN SHU WANG

Department of Computer Science, Yangzhou University, Yangzhou 225009 National Key Lab of Novel Softw Department of Computer Science, Yangzhou University, Yangzhou 225009

国际会议

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

昆明

英文

981-986

2008-07-12(万方平台首次上网日期,不代表论文的发表时间)