IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v24y2007i04ns0217595907001334.html
   My bibliography  Save this article

A New Heuristic Algorithm For Constrained Rectangle-Packing Problem

Author

Listed:
  • DUANBING CHEN

    (College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, China)

  • WENQI HUANG

    (College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, China)

Abstract

The constrained rectangle-packing problem is the problem of packing a subset of rectangles into a larger rectangular container, with the objective of maximizing the layout value. It has many industrial applications such as shipping, wood and glass cutting, etc. Many algorithms have been proposed to solve it, for example, simulated annealing, genetic algorithm and other heuristic algorithms. In this paper a new heuristic algorithm is proposed based on two strategies: the rectangle selecting strategy and the rectangle packing strategy. We have applied the algorithm to 21 smaller, 630 larger and other zero-waste instances. The computational results demonstrate that the integrated performance of the algorithm is rather satisfying and the algorithm developed is fairly efficient for solving the constrained rectangle-packing problem.

Suggested Citation

  • Duanbing Chen & Wenqi Huang, 2007. "A New Heuristic Algorithm For Constrained Rectangle-Packing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(04), pages 463-478.
    • Handle: RePEc:wsi:apjorx:v:24:y:2007:i:04:n:s0217595907001334
    DOI: 10.1142/S0217595907001334
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595907001334
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595907001334?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. Lei Wang & Aihua Yin, 2016. "A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 416-444, August.
    2. Hakim Akeb & Mhand Hifi, 2010. "A hybrid beam search looking-ahead algorithm for the circular packing problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 101-130, August.
    3. Lorena Pradenas & Marco Fuentes & Víctor Parada, 2020. "Optimizing waste storage areas in health care centers," Annals of Operations Research, Springer, vol. 295(1), pages 503-516, December.
    4. Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung, 2016. "A hybrid algorithm based on variable neighbourhood for the strip packing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 513-530, August.
    5. Defu Zhang & Lijun Wei & Stephen C. H. Leung & Qingshan Chen, 2013. "A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 332-345, May.
    6. Wei, Lijun & Hu, Qian & Lim, Andrew & Liu, Qiang, 2018. "A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 270(2), pages 448-474.

    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:wsi:apjorx:v:24:y:2007:i:04:n:s0217595907001334. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.