PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE
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 resolu...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000200279&lng=en&tlng=en |
id |
doaj-73f8afdb697545a19a12920a1ce41fc3 |
---|---|
record_format |
Article |
spelling |
doaj-73f8afdb697545a19a12920a1ce41fc32020-11-25T01:46:34ZengSociedade Brasileira de Pesquisa OperacionalPesquisa Operacional1678-514236227930010.1590/0101-7438.2016.036.02.0279S0101-74382016000200279PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASEWashington Alves de OliveiraLuiz Leduino de Salles NetoAntonio Carlos MorettiEdnei Felix ReisABSTRACT 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.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000200279&lng=en&tlng=enpacking problemlayout optimization problemnonidentical circlesheuristic algorithm |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Washington Alves de Oliveira Luiz Leduino de Salles Neto Antonio Carlos Moretti Ednei Felix Reis |
spellingShingle |
Washington Alves de Oliveira Luiz Leduino de Salles Neto Antonio Carlos Moretti Ednei Felix Reis PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE Pesquisa Operacional packing problem layout optimization problem nonidentical circles heuristic algorithm |
author_facet |
Washington Alves de Oliveira Luiz Leduino de Salles Neto Antonio Carlos Moretti Ednei Felix Reis |
author_sort |
Washington Alves de Oliveira |
title |
PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE |
title_short |
PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE |
title_full |
PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE |
title_fullStr |
PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE |
title_full_unstemmed |
PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE |
title_sort |
packing circles within circular containers: a new heuristic algorithm for the balance constraints case |
publisher |
Sociedade Brasileira de Pesquisa Operacional |
series |
Pesquisa Operacional |
issn |
1678-5142 |
description |
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. |
topic |
packing problem layout optimization problem nonidentical circles heuristic algorithm |
url |
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000200279&lng=en&tlng=en |
work_keys_str_mv |
AT washingtonalvesdeoliveira packingcircleswithincircularcontainersanewheuristicalgorithmforthebalanceconstraintscase AT luizleduinodesallesneto packingcircleswithincircularcontainersanewheuristicalgorithmforthebalanceconstraintscase AT antoniocarlosmoretti packingcircleswithincircularcontainersanewheuristicalgorithmforthebalanceconstraintscase AT edneifelixreis packingcircleswithincircularcontainersanewheuristicalgorithmforthebalanceconstraintscase |
_version_ |
1725018658168635392 |