An Industrial Cutting Stock Problem
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.
KeywordsProduction Plan Knapsack Problem Query Point Linear Relaxation Cutting Pattern
Unable to display preview. Download preview PDF.
- 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
- CPLEX (1999). ILOG CPLEX 6.5 Reference Manual.Google Scholar
- O. Marcotte (1985). The cutting stock problem and integer rounding, Math, programming33,pp. 88–92.Google Scholar
- O. Peton (2000). An Interface for ACCPM, Logilab Working Paper, Department of Management Studies, University of Geneva, Geneva, Switzerland.Google Scholar