On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine 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, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper's benchmarks in order to support and to prove their approach and to evaluate the performance.

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

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

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

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

[5]  Stathes Hadjiefthymiades,et al.  Intelligent Technologies and Techniques for Pervasive Computing , 2013 .

[6]  Sawsan Alshattnawi,et al.  Utilizing Cloud Computing in Developing a Mobile Location-Aware Tourist Guide System , 2013, Int. J. Adv. Pervasive Ubiquitous Comput..

[7]  Marie-Aude Aufaure,et al.  Context-Based Grouping and Recommendation in MANETs , 2013 .

[8]  Tao Gao,et al.  The Detection and Realization of Data Matrix Code by Accurate Locating , 2014, Int. J. Adv. Pervasive Ubiquitous Comput..

[9]  Umakant P. Kulkarni,et al.  Design of Context Aware Recommendation Engine for Cell Phone using Bayesian Network, Fuzzy Logic, and Rough Set Theory , 2012, Int. J. Adv. Pervasive Ubiquitous Comput..

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

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

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

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

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

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

[16]  Xiaoguang Wang,et al.  Direct Self-Control Strategy for Axial Flux Ironless Permanent Magnet Synchronous Motors Based on Duty Ratio Control , 2013, Int. J. Adv. Pervasive Ubiquitous Comput..

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

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

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

[20]  Mao Shaoqing,et al.  Multimedia Content Elements Supply , 2013, Int. J. Adv. Pervasive Ubiquitous Comput..

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

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

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

[24]  Liu Hongcong.  Four Degrees of Freedom Robot Arm, Low-Cost Competition in the Design and Development , 2013, Int. J. Adv. Pervasive Ubiquitous Comput..

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

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

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

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

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

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

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

[32]  Florence Gaunet,et al.  A Navigational Aid for Blind Pedestrians Designed with User- and Activity-Centered Approaches , 2010 .