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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Z. Degraeve and L. Schrage (1999). Optimal integer solutions to industrial cutting stock problems, INFORMS Journal on Computing11, pp. 406–419,
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.
P. C. Gilmore, et R. E. Gomory (1961). A linear programming approach to the cutting-stock problem, Operations Research9, pp. 849–859.
P. C. Gilmore, et R. E. Gomory (1963). A linear programming approach to the cutting-stock problem-Part II, Operations Research11, pp. 863–888.
J.-L. Goffin, A. Haurie et J.-Ph. Vial (1992). Decomposition and nondifferentiable optimization with the projective algorithm. Management Science31, pp. 284–302.
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.
CPLEX (1999). ILOG CPLEX 6.5 Reference Manual.
O. Marcotte (1985). The cutting stock problem and integer rounding, Math, programming33,pp. 88–92.
O. Peton (2000). An Interface for ACCPM, Logilab Working Paper, Department of Management Studies, University of Geneva, Geneva, Switzerland.
F. Vanderbeck (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems, Math. programming86, pp. 565–594.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nicoletti, L.M., Stauffer, G., Vial, JP. (2002). An Industrial Cutting Stock Problem. In: Zaccour, G. (eds) Decision & Control in Management Science. Advances in Computational Management Science, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3561-1_16
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3561-1_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4995-0
Online ISBN: 978-1-4757-3561-1
eBook Packages: Springer Book Archive