An Industrial Cutting Stock Problem
STAUFFER, Gautier
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
STAUFFER, Gautier
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Chapitre d'ouvrage
This item was published in
Decision & Control in Management Science, Decision & Control in Management Science. 2002, vol. 4, p. 299-313
Springer
English 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 ...Read more >
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.Read less <
English Keywords
Production Plan
Knapsack Problem
Query Point
Linear Relaxation
Cutting Pattern
Origin
Hal imported