Abstract: We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment.
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.