IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v117y2002i1p151-16310.1023-a1021521523118.html
   My bibliography  Save this article

A Hybrid Algorithm for the Non-Guillotine Cutting Problem

Author

Listed:
  • Víctor Parada
  • Lorena Pradenas
  • Muricio Solar
  • Rodrigo Palma

Abstract

In this article, a meta-heuristic method to solve the non-guillotine cutting stock problem is proposed. The method is based on a combination between the basic principles of the constructive and evolutive methods. With an adequate management of the parameters involved, the method allows regulation of the solution quality to computational effort relationship. This method is applied to a particular case of cutting problems, with which the computational behaviors is evaluated. In fact, 1000 instances of the problem have been classified according to their combinatorial degree and then the efficiency and robustness of the method have been tested. The final results conclude that the proposed method generates an average error close to 2.18% with respect to optimal solutions. It has also been verified that the method yields solutions for all of the instances examined; something that has not been achieved with an exact constructive method, which was also implemented. Comparison of the running times demonstrates the superiority of the proposed method as compared with the exact method. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Víctor Parada & Lorena Pradenas & Muricio Solar & Rodrigo Palma, 2002. "A Hybrid Algorithm for the Non-Guillotine Cutting Problem," Annals of Operations Research, Springer, vol. 117(1), pages 151-163, November.
    • Handle: RePEc:spr:annopr:v:117:y:2002:i:1:p:151-163:10.1023/a:1021521523118
    DOI: 10.1023/A:1021521523118
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1021521523118
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1021521523118?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
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.

    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:spr:annopr:v:117:y:2002:i:1:p:151-163:10.1023/a:1021521523118. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.