A new heuristic algorithm for two-dimensional defective stock guillotine cutting stock problem with multiple stock sizes

Original scientific papers This paper mainly addresses a two-dimensional defective stocks guillotine cutting stock problem where stock of different sizes is available. Herein a new heuristic algorithm which is based on tree is proposed to discuss this problem. In particular, such an algorithm consists of two parts: the first part is an initial solution of the cutting stock problem where there are no defects on the stocks; the second part is the final optimization solution which is set up on the basis of the first part and takes the defects into consideration. This paper also evaluates the performance of the proposed algorithm. The experimental results demonstrate the effectiveness of the algorithm for the two-dimensional defective stocks cutting stock problem and show that the algorithm can improve not only the utilization rate of stocks, but also the reuse rate of remainders by reducing the fragmentation of remainders.

[1]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[2]  Liu Yang,et al.  Heuristic for the rectangular strip packing problem with rotation of items , 2013, Comput. Oper. Res..

[3]  Hiroshi Nagamochi,et al.  Exact algorithms for the two-dimensional strip packing problem with and without rotations , 2009, Eur. J. Oper. Res..

[4]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[5]  Mhand Hifi,et al.  A parallel algorithm for constrained two-staged two-dimensional cutting problems , 2012, Comput. Ind. Eng..

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

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

[8]  Cláudio Alves,et al.  Arc-flow model for the two-dimensional guillotine cutting stock problem , 2010, Comput. Oper. Res..

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

[10]  U. Twisselmann.  Cutting rectangles avoiding rectangular defects , 1999 .

[11]  Pedro M. Castro,et al.  Scheduling inspired models for two-dimensional packing problems , 2011, Eur. J. Oper. Res..

[12]  Guntram Scheithauer,et al.  Guillotine cutting of defective boards , 1988 .

[13]  José M. Valério de Carvalho,et al.  An integer programming model for two- and three-stage two-dimensional cutting stock problems , 2010, Eur. J. Oper. Res..

[14]  Mhand Hifi,et al.  Exact algorithms for the guillotine strip cutting/packing problem , 1998, Comput. Oper. Res..

[15]  Yoshiko Wakabayashi,et al.  Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation , 2008, Eur. J. Oper. Res..

[16]  Graham Kendall,et al.  A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem , 2009, INFORMS J. Comput..

[17]  Susan G. Hahn.  On the Optimal Cutting of Defective Sheets , 1968, Oper. Res..

[18]  David Pisinger,et al.  The two-dimensional bin packing problem with variable bin sizes and costs , 2005, Discret. Optim..

[19]  Vassilios S. Vassiliadis,et al.  Two-dimensional stock cutting and rectangle packing: binary tree model representation for local search optimization methods , 2005 .

[20]  Liu Yang,et al.  Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction , 2013 .

[21]  Andrea Lodi,et al.  Exact algorithms for the two-dimensional guillotine knapsack , 2012, Comput. Oper. Res..

[22]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[23]  Kwang Mong Sim,et al.  A two-stage intelligent search algorithm for the two-dimensional strip packing problem , 2011, Eur. J. Oper. Res..