The two dimensional circle packing problems consists in placing a given set of circles in a container without overlap. The problem is known to be NP-hard in general. It is encountered in many industries (textile, glass, wood, paper, etc). Several algorithms have been proposed in the literature, including the packing of circles of different radii in a rectangular container [1], the packing of circles of equal radii into a circular container [2], the packing of circles of different radii into a circular container [3,4]. These algorithms are all evaluated by using some test data created by hands. There are few instances in these data and a limited number of circles in each instance.
展开▼
