IDEAS home Printed from https://ideas.repec.org/a/ids/ijpdev/v10y2010i1-2-3p217-240.html
   My bibliography  Save this article

An improved heuristic and an exact algorithm for the 2D strip and bin packing problem

Author

Listed:
  • Abdelghani Bekrar
  • Imed Kacem
  • Chengbin Chu
  • Cherif Sadfi

Abstract

In this paper, we consider a two-dimensional (2D) packing problem. It consists of packing a given set of rectangular items either into a strip with a fixed width and infinite height or into identical bins. This problem has industrial applications such as cutting glass and Very-Large-Scale Integration (VLSI) design. The guillotine constraint is imposed in this paper. For this problem, we propose some strategies to improve the Shelf Heuristic Filling (SHF) introduced by Ben Messaoud et al. (2003). In a second part, we present a branch-and-bound algorithm for the 2D Strip Packing (2SP) problem that uses a new lower bound and the improved heuristic. All our algorithms are tested on generated and literature-based instances and give good results compared to the existing algorithms.

Suggested Citation

  • Abdelghani Bekrar & Imed Kacem & Chengbin Chu & Cherif Sadfi, 2010. "An improved heuristic and an exact algorithm for the 2D strip and bin packing problem," International Journal of Product Development, Inderscience Enterprises Ltd, vol. 10(1/2/3), pages 217-240.
    • Handle: RePEc:ids:ijpdev:v:10:y:2010:i:1/2/3:p:217-240
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=29994
    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.

    Citations

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


    Cited by:

    1. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    2. Krzysztof Fleszar, 2016. "An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 703-720, November.
    3. François Clautiaux & Antoine Jouglet & Aziz Moukrim, 2013. "A New Graph-Theoretical Model for the Guillotine-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 72-86, February.

    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:ijpdev:v:10:y:2010:i:1/2/3:p:217-240. 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=36 .

    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.