Solution Approach to Cutting Stock Problems Using Iterative Trim Loss Algorithm and Monte-Carlo Simulation

Özge Köksal and Ergün Eroğlu

Alphanumeric Journal, 2023, vol. 11, issue 2, 125-136

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; Cutting Stock Problems; NP-Hard (search for similar items in EconPapers)
JEL-codes: C46 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.alphanumericjournal.com/media/Issue/vo ... terative_2RdS6ws.pdf (application/pdf)
https://alphanumericjournal.com/article/solution-a ... nte-carlo-simulation (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:anm:alpnmr:v:11:y:2023:i:2:p:125-136

DOI: 10.17093/alphanumeric.1293487

Access Statistics for this article

More articles in Alphanumeric Journal from Bahadir Fatih Yildirim
Bibliographic data for series maintained by Bahadir Fatih Yildirim ().