Um método heurístico baseado em programação dinâmica para o problema de corte bidimensional guilhotinado restrito

In this paper we study a particular case of two-dimensional cutting problems named constrained guillotine cutting (CGC). The CGC is an NP-hard problem that appears in different industrial processes of cutting rectangular plates, such as in the glass and circuit board industries. To solve the problem we present a variation of the exact method of CHRISTOFIDES & HADJICONSTANTINOU (1995), based on a state space relaxation of a dynamic programming formulation of the CGC, a procedure of subgradient optimization type, and a feasibility heuristic. The result is a method without guarantee of optimality, however, faster and able to solve larger problems than the exact method of Christofides and Hadjiconstantinou. The computational performance of the approach is evaluated solving several examples of the literature as well as randomly generated examples, and comparing the solutions obtained with the ones of Christofides and Hadjiconstantinou’s method and the well-known heuristic of WANG (1983).

[1]  Mhand Hifi.  An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock , 1997, Comput. Oper. Res..

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

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

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

[5]  Gerhard Wäscher,et al.  Cutting and packing , 1995, Eur. J. Oper. Res..

[6]  Nicos Christofides,et al.  An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .

[7]  Harald Dyckhoff,et al.  Cutting and packing in production and distribution : a typology and bibliography , 1992 .

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

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

[10]  Reinaldo Morabito,et al.  Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach , 1996 .

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

[12]  Reinaldo Morabito,et al.  Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems , 1995 .

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

[14]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[15]  Mhand Hifi,et al.  An efficient approach for large-scale two-dimensional guillotine cutting stock problems , 1998, J. Oper. Res. Soc..

[16]  Harald Dyckhoff,et al.  Classification of Real World Trim Loss Problems , 1988 .

[17]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[18]  J. C. Herz,et al.  Recursive computational procedure for two-dimensional stock cutting , 1972 .

[19]  Behrokh Khoshnevis,et al.  A cutting stock procedure for printed circuit board production , 1997 .