IDEAS home Printed from https://ideas.repec.org/a/anm/alpnmr/v11y2023i2p125-136.html
   My bibliography  Save this article

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

Author

Listed:
  • Özge Köksal
  • Ergün Eroğlu

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.

Suggested Citation

  • Özge Köksal & Ergün Eroğlu, 2023. "Solution Approach to Cutting Stock Problems Using Iterative Trim Loss Algorithm and Monte-Carlo Simulation," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 11(2), pages 125-136, December.
    • Handle: RePEc:anm:alpnmr:v:11:y:2023:i:2:p:125-136
    DOI: https://doi.org/10.17093/alphanumeric.1293487
    as

    Download full text from publisher

    File URL: https://www.alphanumericjournal.com/media/Issue/volume-11-issue-2-2023/solution-approach-to-cutting-stock-problems-using-iterative_2RdS6ws.pdf
    Download Restriction: no
    File URL: https://alphanumericjournal.com/article/solution-approach-to-cutting-stock-problems-using-iterative-trim-loss-algorithm-and-monte-carlo-simulation
    Download Restriction: no
    File URL: https://libkey.io/https://doi.org/10.17093/alphanumeric.1293487?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    Combinatorial Optimization; Cutting Stock Problems; NP-Hard;
    All these keywords.

    JEL classification:

    • C46 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Specific Distributions

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:anm:alpnmr:v:11:y:2023:i:2:p:125-136. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Bahadir Fatih Yildirim (email available below). General contact details of provider: https://www.alphanumericjournal.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.