Solving binary cutting stock problems by column generation and branch-and-bound

We present an algorithm for the binary cutting stock problem that employs both column generation and branch-and-bound to obtain optimal integer solutions. We formulate a branching rule that can be incorporated into the subproblem to allow column generation at any node in the branch-and-bound tree. Implementation details and computational experience are discussed.

[1]  Odile Marcotte The cutting stock problem and integer rounding , 1985, Math. Program..

[2]  Ellis L. Johnson Modelling and strong linear programs for mixed integer programming , 1989 .

[3]  Constantine Goulimis Optimal solutions for the cutting stock problem , 1990 .

[4]  Hartmut Stadtler,et al.  A one-dimensional cutting stock problem in the aluminium industry and its solution , 1990 .

[5]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[6]  A. A. Farley A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[7]  George L. Nemhauser,et al.  Functional description of MINTO : a mixed integer optimizer , 1991 .

[8]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[9]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

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

[11]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

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

[13]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[14]  R. W. Haessler,et al.  Cutting stock problems and solution procedures , 1991 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Ellis L. Johnson,et al.  A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

[17]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

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

[19]  Gary M. Roodman Near-optimal solutions to one-dimensional cutting stock problems , 1986, Comput. Oper. Res..

[20]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[21]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .