IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v9y2010i1p104-124.html
   My bibliography  Save this article

A cooperative algorithm for constrained two-staged two-dimensional cutting problems

Author

Listed:
  • Mhand Hifi
  • Toufik Saadi

Abstract

In this paper, we propose a cooperative algorithm for approximately solving the two-staged two-dimensional cutting stock problem (2TDC). We solve 2TDC by considering three key features: a search strategy, a fast filling procedure (FP) and a tighter complementary upper bound. Firstly, the search strategy uses a beam-search method which considers both priority and total cost evaluation operators. Secondly, the FP is used for improving the quality of the obtained results. Finally, a tighter upper bound is applied for refining the selected paths. The method is analysed computationally on a set of instances of the literature and compared to the results provided by several algorithms of the literature. Encouraging results have been obtained.

Suggested Citation

  • Mhand Hifi & Toufik Saadi, 2010. "A cooperative algorithm for constrained two-staged two-dimensional cutting problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 9(1), pages 104-124.
    • Handle: RePEc:ids:ijores:v:9:y:2010:i:1:p:104-124
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=34363
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijores:v:9:y:2010:i:1:p:104-124. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.