Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

The two dimensional orthogonal rectangular strip packing problem is a common NP-hard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform existing heuristic methods as well as many metaheuristics from the literature. Here, we propose a modification to the original bidirectional best-fit heuristic whereby combinations of pairs of rectangles are considered generating improved results over standard benchmark sets.

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

[2]  Marco A. Boschetti,et al.  An Exact Algorithm for the Two-Dimensional Strip-Packing Problem , 2010, Oper. Res..

[3]  Graham Kendall,et al.  A squeaky wheel optimisation methodology for two-dimensional strip packing , 2011, Comput. Oper. Res..

[4]  Gleb Belov,et al.  One-dimensional heuristics adapted for two-dimensional rectangular strip packing , 2008, J. Oper. Res. Soc..

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

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

[7]  William B. Dowsland.  On a Research Bibliography for Cutting and Packing Problems , 1992 .

[8]  Ansheng Deng,et al.  A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..

[9]  Ender Özcan,et al.  BIDIRECTIONAL BEST-FIT APPROACH FOR ORTHOGONAL RECTANGULAR STRIP PACKING , 2009 .

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

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

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

[13]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[14]  Hugo Terashima-Marín,et al.  Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems , 2005, GECCO '05.

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

[16]  Shuangyuan Yang,et al.  A simple randomized algorithm for two-dimensional strip packing , 2013, Comput. Oper. Res..

[17]  Mhand Hifi,et al.  Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithm , 2000 .

[18]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

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

[20]  Hugo Terashima-Marín,et al.  Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  A. Ramesh Babu,et al.  Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms , 1999 .

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

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

[25]  Andrew Lim,et al.  A skyline heuristic for the 2D rectangular packing and strip packing problems , 2011, Eur. J. Oper. Res..

[26]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

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

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

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

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

[31]  Cihan H. Dagli,et al.  New approaches to nesting rectangular patterns , 1997, J. Intell. Manuf..

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

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

[34]  José A. Moreno-Pérez,et al.  GRASP-VNS hybrid for the Strip Packing Problem , 2004, Hybrid Metaheuristics.

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

[36]  Ender Özcan,et al.  Bidirectional best-fit heuristic for orthogonal rectangular strip packing , 2009, Ann. Oper. Res..

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

[38]  Ramón Alvarez-Valdés,et al.  A branch and bound algorithm for the strip packing problem , 2009, OR Spectr..

[39]  Mhand Hifi,et al.  Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm , 1997 .

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

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

[42]  Pearl Y. Wang,et al.  Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study , 2001 .

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

[44]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[45]  Mutsunori Yagiura,et al.  The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio , 2010, Comput. Oper. Res..