Clustering search algorithm for the capacitated centered clustering problem

@article{Chaves2010ClusteringSA,
  title={Clustering search algorithm for the capacitated centered clustering problem},
  author={Antonio Augusto Chaves and Luiz Antonio Nogueira Lorena},
  journal={Computers & OR},
  year={2010},
  volume={37},
  pages={552-558}
}
The Capacitated Centred Clustering Problem (CCCP) consists in partitioning a set of n points into p disjoint clusters with a known capacity. Each cluster is specified by a centroid. The objective is to minimize the total dissimilarity within each cluster, such that a given capacity limit of the cluster is not exceeded. This paper presents a solution procedure for the CCCP, using the hybrid metaheuristic Clustering Search (CS), whose main idea is to identify promising areas of the search space… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS