Improved K-Means Algorithm for Capacitated Clustering Problem

  title={Improved K-Means Algorithm for Capacitated Clustering Problem},
  author={S. G EETHA},
  • S. G EETHA
  • Published 2009
The Capacitated Clustering Problem (CCP) partitions a set of n items (eg. customer orders) into k disjoint clusters with known capacity. During clustering the items with shortest assigning paths from centroids are grouped together. The summation of grouped items should not exceed the capacity of cluster. All clusters have uniform capacity. The CCP is NP-Complete and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for the best item in a set of… CONTINUE READING
7 Citations
16 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 16 references

Solving the capacitated clustering problem with genetic algorithms

  • H. M. Shieh, M. D. May
  • Journal of the Chinese Institute of Industrial…
  • 2001
Highly Influential
3 Excerpts

An adaptive tabu search algorithm for the capacitated clustering problem

  • P. M. Franca, N. M. Sosa, V. Pureza
  • International Transactions in Operational…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…