- Alphanumeric Journal
- Cilt: 11 Sayı: 2
- Solution Approach to Cutting Stock Problems Using Iterative Trim Loss Algorithm and Monte-Carlo Simu...
Solution Approach to Cutting Stock Problems Using Iterative Trim Loss Algorithm and Monte-Carlo Simulation
Authors : Özge Köksal, Ergün Eroğlu
Pages : 125-136
Doi:10.17093/alphanumeric.1293487
View : 32 | Download : 66
Publication Date : 2023-12-31
Article Type : Research
Abstract :Cutting Stock Problems are the most studied NP-Hard combinatorial problems among optimization problems. An One-dimensional Cutting Stock Problem (1-CSP), which aims to create cutting patterns to minimize trim loss, is one of the best known optimization problems. The difficulty of the solution stages and the lack of a definite solution method that can be applied to all problems have caused these problems to attract a lot of attention by researchers. This study includes a hybrid solution algorithm combined with iterative trim loss algorithm and Monte Carlo simulations, and a comparative study of the method with the solution methods in the literature, for the solution of orders to be obtained with minimum cutting loss from the same type of stocks.Keywords : Combinatorial Optimization, NP-Hard, Cutting Stock Problems