A reduction approach for solving the rectangle packing area minimization problem

A reduction approach for solving the rectangle packing area minimization problem

0.00 Avg rating0 Votes
Article ID: iaor20126796
Volume: 224
Issue: 3
Start Page Number: 486
End Page Number: 496
Publication Date: Feb 2013
Journal: European Journal of Operational Research
Authors:
Keywords: heuristics
Abstract:

In the rectangle packing area minimization problem (RPAMP) we are given a set of rectangles with known dimensions. We have to determine an arrangement of all rectangles, without overlapping, inside an enveloping rectangle of minimum area. The paper presents a generic approach for solving the RPAMP that is based on two algorithms, one for the 2D Knapsack Problem (KP), and the other for the 2D Strip Packing Problem (SPP). In this way, solving an instance of the RPAMP is reduced to solving multiple SPP and KP instances. A fast constructive heuristic is used as SPP algorithm while the KP algorithm is instantiated by a tree search method and a genetic algorithm alternatively. All these SPP and KP methods have been published previously. Finally, the best variants of the resulting RPAMP heuristics are combined within one procedure. The guillotine cutting condition is always observed as an additional constraint. The approach was tested on 15 well‐known RPAMP instances (above all MCNC and GSRC instances) and new best solutions were obtained for 10 instances. The computational effort remains acceptable. Moreover, 24 new benchmark instances are introduced and promising results are reported.

Reviews

Required fields are marked *. Your email address will not be published.