An improved genetic algorithm for the orthogonal packing of rectangles

The orthogonal packing problem of rectangles consists of orthogonal packing a fixed set of items onto a rectangular object while minimizing the used object space. The problem is an optimization problem and finds many practical applications. This paper presents an effective genetic algorithm of the orthogonal packing of rectangles. The algorithm improves the quality of the packing pattern by evaluating the packing positions and placing the rectangle in the position that possible creates relatively larger reusable space. And for optimizing the packing pattern quickly, this algorithm presents an approach for the implementation of the mutation operator that generates offspring based on the packing pattern of the parent. Two numerical examples prove the validity of the algorithm.