Solving One-Dimensional Cutting Stock Problems with Multiple Stock Material Lengths Using Cutting Plane Approach

For exactly solving the one-dimensional cutting stock problem (CSP) with several stock material lengths, a cutting plane approach (CPA) is proposed. This work is a continuation of [12] where firstly column generation technique and CPA have been combined for the CSP with identical stock material pieces. In order to ensure efficient implementation of the generation problems in case of no and of additional cutting planes, some modifications of known methods have been performed. The efficiency of the algorithm is demonstrated by extensive numerical results.

[1]  Christoph Nitsche,et al.  Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..

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

[3]  Guntram Scheithauer,et al.  A branch&bound algorithm for solving one-dimensional cutting stock problems exactly , 1995 .

[4]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..

[5]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[6]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[7]  Gerhard Wäscher,et al.  Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Odile Marcotte.  An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[12]  Guntram Scheithauer,et al.  The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .

[13]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[14]  Gleb Belov,et al.  Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..