Improved K-Means Algorithm for Capacitated Clustering Problem

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 clu...

Full description

Bibliographic Details
Main Author: Geetha, S. (author)
Other Authors: Poonthalir, G. (author), Vanathi, P. T. (author)
Format: article
Language:eng
Published: 2009
Subjects:
Combinatorial optimization problem
Capacitated Clustering Problem
Centroids
K-means algorithm
Online Access:https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/282
Country:Brazil
Oai:oai:infocomp.dcc.ufla.br:article/282

Internet

https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/282

Similar Items