×

Column generation technique for solving two-dimensional cutting stock problems: method of stripe approach. (English) Zbl 1145.65039

Summary: We consider two-dimensional cutting stock problems where single rectangular stocks have to be cut into some smaller rectangular so that the number of stocks needed to satisfy the demands is minimum. In this paper we focus our study to the problem where the stocks have to be cut with guillotine cutting type and fixed orientation of finals.
We formulate the problem as an integer programming, where the relaxation problem is solved by column generation technique. New pattern generation is formulated based on method of stripe. In obtaining the integer solution, we round down the optimal solution of the relaxation problem and then we derive an extra mixed integer programming for satisfying the unmet demands. The optimal solution of the original problem is the combination of the round-down solution and the optimal solution of the extra mixed integer programming. A numerical example of the problem is given in the end of this paper.

MSC:

65K05 Numerical mathematical programming methods
90C10 Integer programming
90C11 Mixed integer programming
90C06 Large-scale problems in mathematical programming
PDFBibTeX XMLCite