Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsackproblem (2D-KP) consists of orthogonally packing a subset of the pieces within the container suchthat the sum of the values of the packed pieces is maximized. If the value of a piece is given by itsarea the objective is to maximize the covered area of the container. A genetic algorithm (GA) isproposed addressing the guillotine case of the 2D-KP as well as the non-guillotine case. Moreover,an orientation constraint may optionally be taken into account and the given piece set may beconstrained or unconstrained. The GA is subjected to an extensive test using well-knownbenchmark instances. In a comparison to recently published methods the GA yields competitiveresults.
展开▼
