A least wasted first heuristic algorithm for the rectangular packing problem

The rectangular packing problem is to pack a number of rectangles into a single large rectangular sheet so as to maximize the total area covered by the rectangles packed. The paper first presents a least wasted first strategy which evaluates the positions used by the rectangles. Then a random local search is introduced to improve the results and a least wasted first heuristic algorithm (LWF) is further developed to find a desirable solution. Twenty-one rectangular-packing instances are tested by the algorithm developed, the experimental results show that the presented algorithm can achieve an optimal solution within reasonable time and is fairly efficient for dealing the rectangular packing problem. LWF still performs well when it is extended to solve zero-waste and non-zero-waste strip packing instances.

[1]  Ansheng Deng,et al.  A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..

[2]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for a two-dimensional non-guillotine cutting problem , 2007, Eur. J. Oper. Res..

[3]  Andreas Bortfeldt,et al.  A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces , 2006, Eur. J. Oper. Res..

[4]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[5]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[6]  Xian Cheng,et al.  A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem , 2008, Comput. Oper. Res..

[7]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[8]  Duanbing Chen,et al.  A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..

[9]  Jens Egeblad,et al.  Heuristic approaches for the two- and three-dimensional knapsack packing problem , 2009, Comput. Oper. Res..

[10]  Cihan H. Dagli,et al.  New approaches to nesting rectangular patterns , 1997, J. Intell. Manuf..

[11]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[12]  Daniele Vigo,et al.  An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..

[13]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[14]  Chak-Kuen Wong,et al.  An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..

[15]  B. Kröger.  Guillotineable bin packing: A genetic approach , 1995 .

[16]  Defu Zhang,et al.  A Meta-heuristic Algorithm for the Strip Rectangular Packing Problem , 2005, ICNC.

[17]  Daniele Vigo,et al.  Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..

[18]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[19]  Ramón Alvarez-Valdés,et al.  A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems , 2005, J. Oper. Res. Soc..

[20]  John E. Beasley.  A population heuristic for constrained two-dimensional non-guillotine cutting , 2004, Eur. J. Oper. Res..

[21]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[22]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[23]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..