IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i3p402-415.html
   My bibliography  Save this article

Applying triple-block patterns in solving the two-dimensional bin packing problem

Author

Listed:
  • Yi-Ping Cui
  • Yi Yao
  • Defu Zhang

Abstract

This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set of rectangular items are packed using guillotine patterns into bins of the same size, such that the number of bins used is minimized. Both oriented and non-oriented items are considered. The algorithm considers a novel combination of three procedures. The first is a pattern-generation procedure that generates a set of triple-block patterns on each call. The second is a plan-generation procedure that uses some of these patterns to compose the solution. The third is a plan-improvement procedure that solves an integer linear programming model over a given set of patterns generated previously to improve the solution. According to the computational results, the heuristic can obtain very good solution quality. For some classes of instances, the gap to lower bound is reduced by more than 30% compared to algorithms recently published.

Suggested Citation

  • Yi-Ping Cui & Yi Yao & Defu Zhang, 2018. "Applying triple-block patterns in solving the two-dimensional bin packing problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(3), pages 402-415, March.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:3:p:402-415
    DOI: 10.1057/s41274-016-0148-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-016-0148-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-016-0148-5?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. Gardeyn, Jeroen & Wauters, Tony, 2022. "A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints," European Journal of Operational Research, Elsevier, vol. 301(2), pages 432-444.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:69:y:2018:i:3:p:402-415. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.