Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16d.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP7W/36HKB5H
Repositorysid.inpe.br/mtc-m19@80/2009/12.09.13.10   (restricted access)
Last Update2009:12.09.13.10.35 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m19@80/2009/12.09.13.10.36
Metadata Last Update2018:06.05.04.35.59 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1016/j.cor.2008.09.011
ISSN0305-0548
Citation KeyChavesLore:2010:ClSeAl
TitleClustering search algorithm for the capacitated centered clustering problem
Year2010
MonthMar
Access Date2024, Apr. 27
Secondary TypePRE PI
Number of Files1
Size564 KiB
2. Context
Author1 Chaves, Antonio Augusto
2 Lorena, Luiz Antonio Nogueira
Resume Identifier1
2 8JMKD3MGP5W/3C9JHMQ
Group1 LAC-CTE-INPE-MCT-BR
2 LAC-CTE-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalComputers and Operations Research
Volume37
Number3
Pages552-558
Secondary MarkA1_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
History (UTC)2010-02-24 21:20:51 :: simone -> banon ::
2010-02-24 21:21:47 :: banon -> administrator ::
2010-05-11 01:00:20 :: administrator -> simone ::
2010-07-05 14:54:45 :: simone -> banon ::
2010-07-12 21:04:18 :: banon -> administrator :: 2010
2018-06-05 04:35:59 :: administrator -> marciana :: 2010
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsClustering problems
Clustering search algorithm
Hybrid metaheuristics
AbstractThe 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.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Clustering search algorithm...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Fileclustering search.pdf
User Groupadministrator
banon
simone
Visibilityshown
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Mirror Repositorysid.inpe.br/mtc-m19@80/2009/08.21.17.02.53
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/mtc-m19@80/2009/08.21.17.02
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage e-mailaddress electronicmailaddress format isbn label lineage mark nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)marciana
update 


Close