A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems

Abstract. In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem. We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory process, we compare three rounding procedures, rounding up, truncated branch and bound and the solution of a residual problem.We have coded and tested all the combinations of algorithms and rounding procedures. The computational results obtained on a set of randomly generated test problems show their relative efficiency and allow the potential user to choose from among them, according to the available computing time.

[1]  Jan Riehme,et al.  The solution of two-stage guillotine cutting stock problems having extremely varying order demands , 1996 .

[2]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[3]  Vassilis Zissimopoulos,et al.  An approximation algorithm for solving unconstrained two-dimensional knapsack problems , 1995 .

[4]  Two-dimensional Cutting Stock with Multiple Stock Sizes , 1991 .

[5]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[6]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

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

[8]  Reinaldo Morabito,et al.  The cutting stock problem in a hardboard industry: a case study , 1998, Comput. Oper. Res..

[9]  Sándor P. Fekete,et al.  A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems , 1997, ESA.

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

[11]  Alan Farley.  Practical adaptations of the Gilmore-Gomory approach to cutting stock problems , 1988 .

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

[13]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .