In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize cost of production associated with total length cut objects (waste) and inventory costs related items. A mathematical model is presented heuristically solved by a column generation method. Computational tests were performed using Weighted Sum method, ε-Constraint method variat...

In this paper we study the two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and ins...

We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized version of the so-called 1/V/D/R cutting-stock problem. Cutting-stock problems are encountered often in industrial environments and the ability to address them efficiently usually results in large economic benefits. Traditionally linear-programmingbased techniques have been utilized to address such...

When making wood board production, defects on board will influence the machining process automation degree. Therefore, how to fast, accurately remove of wood defects and realize optimal combination cutting stock problem has always been a research hotspot in the field of wood processing. According to the decayed wood board, the paper designed the one dimensional optimization cutting stock combin...

In this paper, we compare the computational results of cutting pattern of Category II in One Dimensional Cutting Stock Problem in view of first order sustainable trim introduced by Powar et al, with the cutting pattern developed by Gradisar. The comparison has been carried over on the data taken by Gradisar by using the upper limit of the stock length as mentioned in the constraint and observed...

One dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which has many applications in, e.g., steel, paper and fiber industries. To define an instance of 1D-CSP, we are given sufficient number of stock rolls which have the same length L, and m types of products with given lengths (l1, l2, . . . , lm) and demands (d1, d2, . . . , dm). A cu...

Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...

Many methods exist for solving the one-dimensional cutting stock optimization problem with usable leftovers (CSPUL), but none of them consider the excessive generation of usable leftovers (UL) in stock after several consecutiveorders. To highlight this problem, the COLA method for solving the CSPUL [1] was selected. We performed experiments that showed how UL in stock continuously grow when the...