A New Hybrid Ant Colony Algorithm for Clustering Problem

  • Authors:

  • Gao Shang;Zhang Zaiyue;Zhang Xiaoru;Cao Cungen

  • Affiliations:

  • -;-;-;-

  • Venue:
  • ETTANDGRS '08 Proceedings of the 2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing - Volume 01
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.