关键词: 多种群, 异类种群, 相似度, 蚁群算法

Abstract: To overcome the problems of searching speed, running time, and earlier premature of traditional multiple ant colonies algorithm, ?an improved algorithm is proposed. This algorithm introduces more than one type of ant colonies with different pheromone updating mechanisms. These different types of ant colonies have different searching traits. They can cooperate smoothly each other. Every ant colony adaptively chooses suitable information exchangeable object from more than one potential selected ant colonies, determines the best pheromone exchanging strategy from a variety of options through similarity coefficient among every ant colonies. By this way, the balance between the diversity and convergence of every ant colony is kept desirable. A series of TSP experiments show that this algorithm can generate solutions with better quality and faster speed.

Key words: multiple ant colonies, heterogeneous colonies, similarity, ant colony algorithm