Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. Key words: Packing of circles and spheres, models, algorithms, nonlinear programming.

• Type: Journal
• Year: 2008
• Where: COR
• Authors: Ernesto G. Birgin, F. N. C. Sobral
• Keywords: COR 2008, Fixed Set, Problems, Smallest Object