An efficient heuristic algorithm for rectangle-packing problem

Abstract Rectangle-packing problem involves many industrial applications, such as shipping, timber cutting, very large scale integration (VLSI) floor planning, and so on. This problem has shown to be NP hard, and many algorithms such as genetic algorithm, simulated annealing and other heuristic algorithms are presented to solve it. Based on the wisdom and experience of human being, an efficient heuristic algorithm is proposed in this paper. Two group benchmarks are used to test the performance of the produced algorithm, 19 instances of first group and 3 instances of second group having achieved optimal solutions. The experimental results demonstrate that the presented algorithm is rather efficient for solving the rectangle-packing problem.

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

[2]  Ansheng Deng,et al.  A Hybrid Heuristic Algorithm for the Rectangular Packing Problem , 2005, International Conference on Computational Science.

[3]  Joseph Y.-T. Leung,et al.  Packing Squares into a Square , 1990, J. Parallel Distributed Comput..

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

[5]  Marvin D. Troutt,et al.  Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..

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

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

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

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

[10]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[11]  Y. Li,et al.  Greedy algorithms for packing unequal circles into a rectangular container , 2005, J. Oper. Res. Soc..

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

[13]  Wenqi Huang,et al.  Two personification strategies for solving circles packing problem , 1999 .

[14]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

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

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