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

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

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...

Full description

Bibliographic Details
Main Authors: Özge Köksal, Ergün Eroğlu
Format: Article
Language:English
Published: Istanbul University 2023-12-01
Series:Alphanumeric Journal
Subjects:
combinatorial optimization
cutting stock problems
np-hard
Online Access: http://alphanumericjournal.com/media/Issue/volume-11-issue-2-2023/solution-approach-to-cutting-stock-problems-using-iterative_2RdS6ws.pdf

Similar Items

Similar Items