Novel Hybrid Genetic Approach for Two Dimensional Guillotinable Cutting Problems

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, the authors undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Burke Benchmarks and the Beasley Benchmarks in order to support and to prove their approach and to evaluate the performance.

[1]  Mhand Hifi,et al.  The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems , 1997 .

[2]  Julia A. Bennell,et al.  Tools of mathematical modeling of arbitrary object packing problems , 2010, Ann. Oper. Res..

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[5]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[6]  Artur Lugmayr.  Media in the Ubiquitous Era: Ambient, Social and Gaming Media , 2011 .

[7]  T. M. Chan,et al.  Sequence based heuristics for two-dimensional bin packing problems , 2009 .

[8]  Michela Bertolotto,et al.  Using Multimedia and Virtual Reality for Web-Based Collaborative Learning on Multiple Platforms , 2008 .

[9]  M. Hifi,et al.  A recursive exact algorithm for weighted two-dimensional cutting , 1996 .

[10]  E. Hopper,et al.  Problem Generators for Rectangular packing problems , 2002, Stud. Inform. Univ..

[11]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[12]  Teng Hong-fei,et al.  Layout Optimization for the Dishes Installed on a Rotating Table——The Packing Problem With Equilibrium Behavioural Constraints , 1994 .

[13]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

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

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

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

[17]  Reinaldo Morabito,et al.  An AND/OR-graph Approach to the Container Loading Problem , 1994 .

[18]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

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

[20]  Nicole C. Krämer,et al.  Teaching Group Decision Making Skills to Emergency Managers via Digital Games , 2012 .

[21]  Krzysztof Fleszar,et al.  A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts , 2011, Comput. Oper. Res..

[22]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[23]  Daniele Vigo,et al.  Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..

[24]  J. A. Bland,et al.  Tabu search and design optimization , 1991, Comput. Aided Des..

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

[26]  Sergey Polyakovskiy,et al.  An agent-based approach to the two-dimensional guillotine bin packing problem , 2009, Eur. J. Oper. Res..

[27]  Suhaidi Hassan,et al.  Comprehensive Structure of Novel Voice Priority Queue Scheduling System Model for VoIP Over WLANs , 2011, Int. J. Adv. Pervasive Ubiquitous Comput..

[28]  Miltiadis D. Lytras,et al.  Ubiquitous and pervasive knowledge and learning management : semantics, social networking and new media to their full potential , 2007 .