IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_8.html
   My bibliography  Save this book chapter

Heuristic Search for a Real-World 3D Stock Cutting Problem

In: Operations Research Proceedings 2019

Author

Listed:
  • Katerina Klimova

    (Satalia)

  • Una Benlic

    (East China Jiaotong University)

Abstract

Stock cutting is an important optimisation problem which can be found in many industries. The aim of the problem is to minimize the cutting waste, while cutting standard-sized pieces from sheets or rolls of a given material. We consider an application of this problem arising from the packing industry, where the problem is extended from the standard one or two dimensional definition into the three dimensional problem. The purpose of this work is to help businesses determine the sizes of boxes to purchase so as to minimize the volume of empty space of their packages. Given the size of a real-world problem instances, we present an effective Adaptive Large Neighbourhood Search heuristic that is able to decrease the volume of empty space by an average of 22% compared to the previous approach used by the business.

Suggested Citation

  • Katerina Klimova & Una Benlic, 2020. "Heuristic Search for a Real-World 3D Stock Cutting Problem," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 63-69, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_8
    DOI: 10.1007/978-3-030-48439-2_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-030-48439-2_8. 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.