Multiple Ant Colony Algorithm Combining Community Relationship Network

• Published in: Arabian journal for science and engineering Vol. 47; no. 8; pp. 10531 - 10546
• Main Authors: Zhao, Jiabo, You, Xiaoming, Duan, Qianqian, Liu, Sheng
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 2022; Springer Nature B.V
• Subjects: Algorithms; Ant colony optimization; Ants; Combinatorial analysis; Computer Engineering and Computer Science; Engineering; Exploration; Feedback loops; Humanities and Social Sciences; Modularity; multidisciplinary; Pheromones; Populations; Research Article-Computer Engineering and Computer Science; Science; Segments; Traveling salesman problem; TSP; Community detection; Modularity; Route relation network; Ant colony algorithm
• ISSN: 2193-567X; 1319-8025; 2191-4281
• DOI: 10.1007/s13369-022-06579-x

Ant colony algorithm can better deal with combinatorial optimization problems, but it is still difficult to balance the solution accuracy and convergence speed facing large-scale TSP. Nowadays, most scholars focus on the route information of better ants for improvement, while ignoring the route information of general ants with a large base. So, this study proposes the multiple ant colony algorithm combining community relationship network (CACO) by collecting route information of all ants and constructing a route relationship network to improve the accuracy of the solution. The network is divided into a number of small communities that reflect the affinity of multiple colony ants to different cities through community detection with modularity. Within the communities, CACO use the excellent roue exploration ability of the ant colony algorithm to identify high-quality route segments, integrating the pheromones of high-quality segments in the communities to provide pheromone feedback to the multiple colony ants for better route exploration. The three parts of route information collection, community detection and pheromone feedback form a feedback loop, which keeps cycling when multiple populations ants explore, and each cycle will drive the result closer to the optimal solution. Meanwhile, CACO proposes a mutual assistance strategy to improve the exploration ability of multiple colony ants by complementing each other according to the different states of superior and inferior populations. To test the performance of CACO, 28 TSP instances are compared with the well-known improved algorithms are compared and results show CACO outperforms other improved algorithms significantly, especially in large-scale TSP.