Matheuristics for the irregular bin packing problem with free rotations

[1]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[2]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

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

[4]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

[5]  Rym M'Hallah,et al.  A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems , 2002, Stud. Inform. Univ..

[6]  Alberto Caprara,et al.  Worst-case analysis of the subset sum algorithm for bin packing , 2004, Oper. Res. Lett..

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

[8]  Julia A. Bennell,et al.  The geometry of nesting problems: A tutorial , 2008, Eur. J. Oper. Res..

[9]  Julia A. Bennell,et al.  A tutorial in irregular shape packing problems , 2009, J. Oper. Res. Soc..

[10]  Matteo Fischetti,et al.  Mixed-integer programming models for nesting problems , 2009, J. Heuristics.

[11]  N. Chernov,et al.  Mathematical model and efficient algorithms for object packing problem , 2010, Comput. Geom..

[12]  Xiang Song,et al.  A beam search implementation for the irregular shape packing problem , 2010, J. Heuristics.

[13]  Ramón Alvarez-Valdés,et al.  A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing , 2010, Ann. Oper. Res..

[14]  Peter Ross,et al.  Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems , 2010, Ann. Oper. Res..

[15]  R. Alvarez-Valdes,et al.  A branch & bound algorithm for cutting and packing irregularly shaped pieces , 2013 .

[16]  Edmund K. Burke,et al.  An effective heuristic for the two-dimensional irregular bin packing problem , 2013, Annals of Operations Research.

[17]  Xiang Song,et al.  Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints , 2013, Eur. J. Oper. Res..

[18]  Xiang Song,et al.  Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem , 2014, J. Oper. Res. Soc..

[19]  Gabriela Ochoa,et al.  A unified hyper-heuristic framework for solving bin packing problems , 2014, Expert Syst. Appl..

[20]  J. M. Tamarit,et al.  Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts , 2015 .