Advertisement

An Industrial Cutting Stock Problem

  • Luciano Muller Nicoletti
  • Gautier Stauffer
  • Jean-Philippe Vial
Part of the Advances in Computational Management Science book series (AICM, volume 4)

Abstract

The formulation of an industrial cutting stock problem often differs from the standard model. We present here the result of a feasibility study for an existing paper mill. The code is based on a column generation scheme to solve the linear relaxation and on heuristics to reconstruct integral feasible solutions. The results are compared with the current manual implementation at the factory. The approach allows an 85% reduction of the optimality gap in average.

Keywords

Production Plan Knapsack Problem Query Point Linear Relaxation Cutting Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Z. Degraeve and L. Schrage (1999). Optimal integer solutions to industrial cutting stock problems, INFORMS Journal on Computing11, pp. 406–419,CrossRefGoogle Scholar
  2. [2]
    O. du Merle (1995). Interior points and cutting planes: development and implementation of methods for convex optimization and large scale structured linear programming, Ph. D. Thesis, Department of Management Studies, University of Geneva, Geneva, Switzerland.Google Scholar
  3. [3]
    P. C. Gilmore, et R. E. Gomory (1961). A linear programming approach to the cutting-stock problem, Operations Research9, pp. 849–859.CrossRefGoogle Scholar
  4. [4]
    P. C. Gilmore, et R. E. Gomory (1963). A linear programming approach to the cutting-stock problem-Part II, Operations Research11, pp. 863–888.CrossRefGoogle Scholar
  5. [5]
    J.-L. Goffin, A. Haurie et J.-Ph. Vial (1992). Decomposition and nondifferentiable optimization with the projective algorithm. Management Science31, pp. 284–302.CrossRefGoogle Scholar
  6. [6]
    J. Gondzio, O. du Merle, R. Sarkissian and J.-P. Vial (1996). AC-CPM - A Library for Convex Optimization Based on an Analytic Center Cutting Plane Method, European Journal of Operational Research94, pp. 206–211.CrossRefGoogle Scholar
  7. [7]
    CPLEX (1999). ILOG CPLEX 6.5 Reference Manual.Google Scholar
  8. [8]
    O. Marcotte (1985). The cutting stock problem and integer rounding, Math, programming33,pp. 88–92.Google Scholar
  9. [9]
    O. Peton (2000). An Interface for ACCPM, Logilab Working Paper, Department of Management Studies, University of Geneva, Geneva, Switzerland.Google Scholar
  10. [10]
    F. Vanderbeck (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems, Math. programming86, pp. 565–594.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Luciano Muller Nicoletti
  • Gautier Stauffer
  • Jean-Philippe Vial

There are no affiliations available

Personalised recommendations