A comparative numerical analysis for the guillotine two-dimensional cutting problem

In this work, the behavior of four algorithms in the resolution of the two-dimensional constrained guillotine cutting problem is analyzed. This problem is concerned about the way a set of pieces should be cut from a plate of greater dimensions, considering guillotine cutting and a constrained number of times a piece can be cut from the plate. In this study three combinatorial and two heuristic methods are considered. In the combinatorial methods from the set of pieces, a minimum loss layout is constructively generated based on Wang's algorithm. In addition, an evolutionary and an annealing type approach are considered. All of these models have been implemented on a high performance Silicon Graphics machine. Performance of each algorithm is analyzed both in terms of percentage waste and running time. In order to do that, a set of 1000 instances are classified according to their combinatorial degree and subsequently evaluated.

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

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

[3]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998 .

[4]  Arlindo Gomes de Alvarenga,et al.  Exact solutions for constrained two-dimensional cutting problems , 1995 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Reinaldo Morabito,et al.  An and—or-graph approach for two-dimensional cutting problems , 1992 .

[7]  JoséFernando Oliveira,et al.  An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .

[8]  A. Bagchi,et al.  Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..

[9]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[10]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998, Comput. Oper. Res..

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

[12]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[13]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[14]  Francis J. Vasko.  A computational improvement to Wang's two-dimensional cutting stock algorithm , 1989 .

[15]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[16]  Anthony I. Hinxman,et al.  Problem Reduction and the Two-Dimensional Trim-Loss Problem , 1976, AISB.

[17]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..