Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

Abstract : The cutting stock problem is that of finding a cutting of stock material to meet demands for small pieces of prescribed dimensions while minimising the amount of waste. Because changing over from one cutting pattern to another involves significant setups, an auxiliary problem is to minimise the number of different patterns that are used. The pattern minimisation problem is significantly more complex, but it is of great practical importance. In this paper, we propose an integer programming formulation for the problem that involves an exponential number of binary variables and associated columns, each of which corresponds to selecting a fixed number of copies of a specific cutting pattern. The integer program is solved using a column generation approach where the subproblem is a nonlinear integer program that can be decomposed into multiple bounded integer knapsack problems. At each node of the branch-and-bound tree, the linear programming relaxation of our formulation is made tighter by adding super-additive inequalities. Branching rules are presented that yield a balanced tree. Incumbent solutions are obtained using a rounding heuristic. The resulting branch-and-price-and-cut procedure is used to produce optimal or approximately optimal solutions for a set of real-life problems.
Type de document :
Article dans une revue
Operations Research, INFORMS, 2000, 45 (5), pp.915-926
Liste complète des métadonnées

https://hal.inria.fr/inria-00342639
Contributeur : François Vanderbeck <>
Soumis le : jeudi 27 novembre 2008 - 19:29:26
Dernière modification le : jeudi 11 janvier 2018 - 06:21:22

Identifiants

  • HAL Id : inria-00342639, version 1

Collections

IMB

Citation

François Vanderbeck. Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem. Operations Research, INFORMS, 2000, 45 (5), pp.915-926. 〈inria-00342639〉

Partager

Métriques

Consultations de la notice

75