Article ID Journal Published Year Pages File Type
476118 Computers & Operations Research 2010 10 Pages PDF
Abstract

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton–Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/∼egbirgin/packing/.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,