Multi-dimensional bin packing problems with guillotine constraints

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. That is, there should exist a series of face parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a box and no box has been intersected by a cut. The unrestricted problem is known to be NP-hard. In this paper we present a generalization of a constructive algorithm for the multi-dimensional bin packing problem, with and without the guillotine constraint, based on constraint programming.

[1]  Víctor Parada,et al.  A comparative numerical analysis for the guillotine two-dimensional cutting problem , 2000, Ann. Oper. Res..

[2]  Gleb Belov.  Problems, Models and Algorithms in One- and Two-Dimensional Cutting , 2003 .

[3]  Cláudio Alves,et al.  A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..

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

[5]  Mats Carlsson,et al.  Sweep synchronization as a global propagation mechanism , 2006, Comput. Oper. Res..

[6]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[7]  Daniele Vigo,et al.  Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem , 2007, TOMS.

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

[9]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[10]  Antoine Jouglet,et al.  A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..

[11]  Sándor P. Fekete,et al.  A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..

[12]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[13]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

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

[15]  Mhand Hifi,et al.  COnstrained Two-Dimensional Cutting Stock Problems a Best-First Branch-and-Bound Exact Algorithm , 1997 .

[16]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[17]  Mhand Hifi.  An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock , 1997, Comput. Oper. Res..

[18]  Gleb Belov,et al.  One-dimensional relaxations and LP bounds for orthogonal packing , 2009, Int. Trans. Oper. Res..

[19]  Mats Carlsson,et al.  Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint , 2001, CP.

[20]  Sándor P. Fekete,et al.  An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..

[21]  Guntram Scheithauer.  Algorithms for the Container Loading Problem , 1992 .

[22]  Antoine Jouglet,et al.  A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems , 2008, WEA.

[23]  Roberto Baldacci,et al.  A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem , 2007, Eur. J. Oper. Res..

[24]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[25]  A. Bagchi,et al.  Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..

[26]  David Pisinger,et al.  Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem , 2007, INFORMS J. Comput..