Please use this identifier to cite or link to this item:
Type: Artigo
Title: Packing Circles Within Circular Containers: A New Heuristic Algorithm For The Balance Constraints Case
Author: Oliveira
Washington Alves de; Salles Neto
Luiz Leduino de; Moretti
Antonio Carlos; Reis
Ednei Felix
Abstract: In 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.
Subject: Packing Problem
Layout Optimization Problem
Nonidentical Circles
Heuristic Algorithm
Editor: Sociedade Brasileira de Pesquisa Operacional
Citation: Pesquisa Operacional. Sociedade Brasileira De Pesquisa Operacional, v. 36, n. 2, p. 279 - 300
Rights: aberto
Date Issue: 2016
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.