Abstract: Packing problems arise in a wide variety of application
areas. The basic problem is that of determining an efficient arrangement
of different objects in a region without any overlap and
with minimal wasted gap between shapes. This paper presents a
novel population based approach for optimizing arrangement of irregular
shapes. In this approach, each shape is coded as an agent and
the agents' reproductions and grouping policies results in arrangements
of the objects in positions with least wasted area between
them. The approach is implemented in an application for cutting
sheets and test results on several problems from literature are presented.