PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE

AUTOR(ES)

Oliveira, Washington Alves de, Salles Neto, Luiz Leduino de, Moretti, Antonio Carlos, Reis, Ednei Felix

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

2016-08

RESUMO

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.

Documentos Relacionados

• A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM
• A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM
• Métodos estocásticos de otimização global para empacotar círculos em elipses
• A GRASP ALGORITHM FOR THE CONTAINER LOADING PROBLEM WITH MULTI-DROP CONSTRAINTS
• Geometric packing constraints in egg phosphatidylcholine vesicles.