A New Hybrid Ant Colony Algorithm for Clustering Problem
Shang Gao, Zhang Zaiyue, Zhang Xiaoru, Cungen Cao · 2008
The known mathematical model for clustering problems is given in this paper. With the K-Means algorithm, the simulated annealing algorithm and a novel hybrid ant colony algorithm is integrated with the K-means algorithm to solve clustering problems. The advantages and shortages of K-Means algorithm, simulated annealing algorithm and the hybrid ant colony algorithm are then analyzed, so that effectiveness of the hybrid ant colony algorithm would be illustrated through results.