%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft36
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHMQ
%@secondarymark A1_ADMINISTRAÇÃO,_CIÊNCIAS_CONTÁBEIS_E_TURISMO A1_ARQUITETURA_E_URBANISMO A2_CIÊNCIA_DA_COMPUTAÇÃO B1_ENGENHARIAS_I B1_ENGENHARIAS_II A2_ENGENHARIAS_III B1_ENGENHARIAS_IV A1_INTERDISCIPLINAR B1_MATEMÁTICA_/_PROBABILIDADE_E_ESTATÍSTICA
%@issn 0305-0548
%@usergroup administrator
%@usergroup banon
%@usergroup simone
%3 clustering search.pdf
%X The capacitated centered 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 by generating solutions through a metaheuristic and clustering them into groups that are then further explored with local search heuristics. Computational results in test problems of the literature show that the CS found a significant number of new best-known solutions in reasonable computational times.
%@mirrorrepository sid.inpe.br/mtc-m19@80/2009/08.21.17.02.53
%8 Mar
%N 3
%T Clustering search algorithm for the capacitated centered clustering problem
%@secondarytype PRE PI
%K Clustering problems, Clustering search algorithm, Hybrid metaheuristics.
%@group LAC-CTE-INPE-MCT-BR
%@group LAC-CTE-INPE-MCT-BR
%@copyholder SID/SCD
%@secondarykey INPE--PRE/
%2 sid.inpe.br/mtc-m19@80/2009/12.09.13.10.36
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%B Computers and Operations Research
%P 552-558
%4 sid.inpe.br/mtc-m19@80/2009/12.09.13.10
%D 2010
%V 37
%@doi 10.1016/j.cor.2008.09.011
%A Chaves, Antonio Augusto,
%A Lorena, Luiz Antonio Nogueira,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP