Exact algorithms for the two-dimensional strip packing problem with and without rotations

We propose exact algorithms for the 2-dimensional strip packing problem (2SP) with and without 90 degrees rotations. We first focus on the perfect packing problem (PP), which is a special case of 2SP, wherein all given rectangles are required to be packed without wasted space, and design branch-and-bound algorithms introducing several branching rules and bounding operations. A combination of these rules yields an algorithm that is especially efficient for feasible instances of PP. We then propose several methods of applying the PP algorithms to 2SP. Our algorithms succeed in efficiently solving benchmark instances of PP with up to 500 rectangles and those of 2SP with up to 200 rectangles. They are often faster than existing exact algorithms specially tailored for problems without rotations.

[1]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[2]  Wallace Kit-Sang Tang,et al.  Strip-packing using hybrid genetic approach , 2004, Eng. Appl. Artif. Intell..

[3]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[4]  Duanbing Chen,et al.  An efficient heuristic algorithm for rectangle-packing problem , 2007, Simul. Model. Pract. Theory.

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

[6]  Manuel Iori,et al.  Metaheuristic Algorithms for the Strip Packing Problem , 2003 .

[7]  Toshihide Ibaraki,et al.  Local search algorithms for the rectangle packing problem with general spatial costs , 2003, Math. Program..

[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]  Ansheng Deng,et al.  A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..

[11]  Ramón Alvarez-Valdés,et al.  Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..

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

[13]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[14]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

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

[16]  C.J.H. Mann,et al.  Handbook of Approximation: Algorithms and Metaheuristics , 2008 .

[17]  Justin Zobel,et al.  Using random sampling to build approximate tries for efficient string sorting , 2004, JEAL.

[18]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[19]  Philip S. Yu,et al.  Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.

[20]  Panos M. Pardalos,et al.  Optimization and Industry: New Frontiers , 2011 .

[21]  Joe Marks,et al.  Exhaustive approaches to 2D rectangular perfect packings , 2004, Inf. Process. Lett..

[22]  Hiroshi Nagamochi,et al.  Practical Algorithms for Two-Dimensional Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[23]  Joe Marks,et al.  New heuristic and interactive approaches to 2D rectangular strip packing , 2005, JEAL.

[24]  S. Imahori,et al.  Improved local search algorithms for the rectangle packing problem with general spatial costs , 2004, Eur. J. Oper. Res..

[25]  Lijun Wei,et al.  A least wasted first heuristic algorithm for the rectangular packing problem , 2009, Comput. Oper. Res..

[26]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[29]  De-fu Zhang,et al.  An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem , 2007 .

[30]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[31]  K. Dowsland.  Some experiments with simulated annealing techniques for packing problems , 1993 .

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

[33]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

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