IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v96y2000i1p245-25410.1023-a1018915922011.html
   My bibliography  Save this article

A comparative numerical analysis for the guillotine two-dimensional cutting problem

Author

Listed:
  • Victor Parada
  • Rodrigo Palma
  • Daniel Sales
  • Arlindo Gómes

Abstract

In this work, the behavior of four algorithms in the resolution of the two-dimensional constrained guillotine cutting problem is analyzed. This problem is concerned about the way a set of pieces should be cut from a plate of greater dimensions, considering guillotine cutting and a constrained number of times a piece can be cut from the plate. In this study three combinatorial and two heuristic methods are considered. In the combinatorial methods from the set of pieces, a minimum loss layout is constructively generated based on Wang's algorithm. In addition, an evolutionary and an annealing type approach are considered. All of these models have been implemented on a high performance Silicon Graphics machine. Performance of each algorithm is analyzed both in terms of percentage waste and running time. In order to do that, a set of 1000 instances are classified according to their combinatorial degree and subsequently evaluated. Copyright Kluwer Academic Publishers 2000

Suggested Citation

  • Victor Parada & Rodrigo Palma & Daniel Sales & Arlindo Gómes, 2000. "A comparative numerical analysis for the guillotine two-dimensional cutting problem," Annals of Operations Research, Springer, vol. 96(1), pages 245-254, November.
    • Handle: RePEc:spr:annopr:v:96:y:2000:i:1:p:245-254:10.1023/a:1018915922011
    DOI: 10.1023/A:1018915922011
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018915922011
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018915922011?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. David Pisinger & Mikkel Sigurd, 2007. "Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 36-51, February.
    2. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.

    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:96:y:2000:i:1:p:245-254:10.1023/a:1018915922011. 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.