Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing

We present algorithms for the following three-dimensional (3D) guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. We consider the case where the items have fixed orientation and the case where orthogonal rotations around all axes are allowed. For the unbounded 3D knapsack problem, we extend the recurrence formula proposed by [1] for the rectangular knapsack problem and present a dynamic programming algorithm that uses reduced raster points. We also consider a variant of the unbounded knapsack problem in which the cuts must be staged. For the 3D cutting stock problem and its variants in which the bins have different sizes (and the cuts must be staged), we present column generation-based algorithms. Modified versions of the algorithms for the 3D cutting stock problems with stages are then used to build algorithms for the 3D strip packing problem and its variants. The computational tests performed with the algorithms described in this paper indicate that they are useful to solve instances of moderate size.

[1]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[2]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[3]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

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

[5]  Klaus Jansen,et al.  An asymptotic approximation algorithm for 3D-strip packing , 2006, SODA '06.

[6]  Guntram Scheithauer.  Equivalence and Dominance for Problems of Optimal Packing of Rectangles , 1995 .

[7]  Klaus Jansen,et al.  On strip packing With rotations , 2005, STOC '05.

[8]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[9]  Daniele Vigo,et al.  Models and Bounds for Two-Dimensional Level Packing Problems , 2004, J. Comb. Optim..

[10]  Yoshiko Wakabayashi,et al.  Three-dimensional packings with rotations , 2009, Comput. Oper. Res..

[11]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[12]  Yoshiko Wakabayashi,et al.  A note on the approximability of cutting stock problems , 2007, Eur. J. Oper. Res..

[13]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[14]  Reinaldo Morabito,et al.  An effective recursive partitioning approach for the packing of identical rectangles in a rectangle , 2010, J. Oper. Res. Soc..

[15]  Günther R. Raidl,et al.  Models and algorithms for three-stage two-dimensional bin packing , 2007, Eur. J. Oper. Res..

[16]  Klaus Jansen,et al.  Approximation Algorithms for 3D Orthogonal Knapsack , 2007, Journal of Computer Science and Technology.

[17]  Ramón Alvarez-Valdés,et al.  A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems , 2002, OR Spectr..

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

[19]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[20]  Guochuan Zhang,et al.  Harmonic algorithm for 3-dimensional strip packing problem , 2007, SODA '07.

[21]  János Csirik,et al.  An on-line algorithm for multidimensional bin packing , 1993, Oper. Res. Lett..

[22]  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..

[23]  J. C. Herz,et al.  Recursive computational procedure for two-dimensional stock cutting , 1972 .

[24]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[25]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..