Dynamic reproductive ant colony algorithm based on piecewise clustering

Abstract

To address the lack of convergence speed and diversity of Ant Colony Optimization (ACO), a dynamic reproductive ant colony algorithm based on piecewise clustering (RCACS) is proposed to optimize the problems. First, the data is segmented by the clustering algorithm, and the exit and entrance of each cluster are obtained by the nearest neighbor strategy. The algorithm traversed all points of the cluster to find an unclosed shortest path according to the exit and entrance. Many fragment paths eventually merge into a full TSP. This strategy can accelerate the convergence speed of the algorithm and help it get higher accuracy. Second, when the algorithm stagnates, the dynamic regeneration mechanism based on feature transfer will transfer the excellent features of the mother-ants to the child-ants, so that it can further explore the neighborhood of the current optimal solution and help the algorithm jump out of the local optimum. From the results of simulation experiments and the rank-sum test, it can be found that the improved algorithm can effectively improve the diversity and accuracy of the algorithm, especially when solving large-scale problems.