Title of article
Clustering searchalgorithmforthecapacitatedcenteredclusteringproblem
Author/Authors
Antonio AugustoChaves، نويسنده , , LuizAntonioNogueiraLorena، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
552
To page
558
Abstract
The capacitatedcenteredclusteringproblem(CCCP)consistsinpartitioningasetof n points into p disjoint
clusters withaknowncapacity.Eachclusterisspecifiedbyacentroid.Theobjectiveistominimizethe
total dissimilaritywithineachcluster,suchthatagivencapacitylimitoftheclusterisnotexceeded.This
paper presentsasolutionprocedurefortheCCCP,usingthehybridmetaheuristicclusteringsearch(CS),
whose mainideaistoidentifypromisingareasofthesearchspacebygeneratingsolutionsthrougha
metaheuristic andclusteringthemintogroupsthatarethenfurtherexploredwithlocalsearchheuristics.
Computational resultsintestproblemsoftheliteratureshowthattheCSfoundasignificantnumberof
new best-knownsolutionsinreasonablecomputationaltimes.
Keywords
Clustering search algorithm , Hybrid metaheuristics , Clustering problems
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927669
Link To Document