Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/324393
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE DE ESTADUAL DE CAMPINASpt_BR
dc.typeArtigopt_BR
dc.titlePacking Circles Within Circular Containers: A New Heuristic Algorithm For The Balance Constraints Caseen
dc.contributor.authorOliveirapt_BR
dc.contributor.authorWashington Alves de; Salles Netopt_BR
dc.contributor.authorLuiz Leduino de; Morettipt_BR
dc.contributor.authorAntonio Carlos; Reispt_BR
dc.contributor.authorEdnei Felixpt_BR
unicamp.authorUniversidade Estadual de Campinas Faculdade de Ciências Aplicadas, Limeira SP, Brazilpt_BR
unicamp.author.externalUniversidade Federal de São Paulo Instituto de Ciência e Tecnologia, São José dos Campos SP, Brazilpt_BR
unicamp.author.externalUniversidade Tecnológica Federal do Paraná Departamento de Matemática, Ponta Grossa PR, Brazilpt_BR
dc.subjectPacking Problemen
dc.subjectLayout Optimization Problemen
dc.subjectNonidentical Circlesen
dc.subjectHeuristic Algorithmen
dc.description.abstractIn this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard problem, which justifies heuristics methods for its resolution in larger instances. The main feature of our heuristic is based on the selection of the next circle to be placed inside the container according to the position of the system's center of mass. Our approach has been tested on a series of instances up to 55 circles and compared with the literature. Computational results show good performance in terms of solution quality and computational time for the proposed algorithm.en
dc.relation.ispartofPesquisa Operacionalpt_BR
dc.publisherSociedade Brasileira de Pesquisa Operacionalpt_BR
dc.date.issued2016pt_BR
dc.identifier.citationPesquisa Operacional. Sociedade Brasileira De Pesquisa Operacional, v. 36, n. 2, p. 279 - 300pt_BR
dc.language.isoInglespt_BR
dc.description.volume36pt_BR
dc.description.issuenumber2pt_BR
dc.description.firstpage279pt_BR
dc.description.lastpage300pt_BR
dc.rightsabertopt_BR
dc.sourceScielopt_BR
dc.identifier.issn0101-7438pt_BR
dc.identifier.idScieloS0101-74382016000200279pt_BR
dc.identifier.urlhttp://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000200279pt_BR
dc.date.available2017-08-30T17:36:13Z-
dc.date.accessioned2017-08-30T17:36:13Z-
dc.description.provenanceMade available in DSpace on 2017-08-30T17:36:13Z (GMT). No. of bitstreams: 1 S0101-74382016000200279.pdf: 773138 bytes, checksum: 7e778586fe906a74fd27638c653af38a (MD5) Previous issue date: 2016en
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/324393-
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
S0101-74382016000200279.pdf755.02 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.