IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v209y2011i3p219-227.html
   My bibliography  Save this article

A hybrid placement strategy for the three-dimensional strip packing problem

Author

Listed:
  • Allen, S.D.
  • Burke, E.K.
  • Kendall, G.

Abstract

This paper presents a hybrid placement strategy for the three-dimensional strip packing problem which involves packing a set of cuboids ('boxes') into a three-dimensional bin (parallelepiped) of fixed width and height but unconstrained length (the 'container'). The goal is to pack all of the boxes into the container, minimising its resulting length. This problem has potential industry application in stock cutting (wood, polystyrene, etc. - minimising wastage) and also cargo loading, as well as other applications in areas such as multi-dimensional resource scheduling. In addition to the proposed strategy a number of test results on available literature benchmark problems are presented and analysed. The results of empirical testing of the algorithm show that it out-performs other methods from the literature, consistently in terms of speed and solution quality-producing 28 best known results from 35 test cases.

Suggested Citation

  • Allen, S.D. & Burke, E.K. & Kendall, G., 2011. "A hybrid placement strategy for the three-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 209(3), pages 219-227, March.
    • Handle: RePEc:eee:ejores:v:209:y:2011:i:3:p:219-227
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00621-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    2. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.
    3. Hopper, E. & Turton, B. C. H., 2001. "An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 34-57, January.
    4. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    5. Faina, Loris, 1999. "An application of simulated annealing to the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 542-556, May.
    6. E. K. Burke & G. Kendall & G. Whitwell, 2004. "A New Placement Heuristic for the Orthogonal Stock-Cutting Problem," Operations Research, INFORMS, vol. 52(4), pages 655-671, August.
    7. Teodor Gabriel Crainic & Guido Perboli & Roberto Tadei, 2008. "Extreme Point-Based Heuristics for Three-Dimensional Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 368-384, August.
    8. Bortfeldt, Andreas & Mack, Daniel, 2007. "A heuristic for the three-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1267-1279, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sam D. Allen & Edmund K. Burke, 2012. "Data Structures for Higher-Dimensional Rectilinear Packing," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 457-470, August.
    2. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    3. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2012. "A reference length approach for the 3D strip packing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 37-47.
    4. Bortfeldt, Andreas, 2013. "A reduction approach for solving the rectangle packing area minimization problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 486-496.
    5. Andreas Bortfeldt & Sabine Jungmann, 2012. "A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint," Annals of Operations Research, Springer, vol. 196(1), pages 53-71, July.
    6. Kurpel, Deidson Vitorio & Scarpin, Cassius Tadeu & Pécora Junior, José Eduardo & Schenekemberg, Cleder Marcos & Coelho, Leandro C., 2020. "The exact solutions of several types of container loading problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 87-107.
    7. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    8. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    9. Thiago Queiroz & Flávio Miyazawa, 2014. "Order and static stability into the strip packing problem," Annals of Operations Research, Springer, vol. 223(1), pages 137-154, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sam D. Allen & Edmund K. Burke, 2012. "Data Structures for Higher-Dimensional Rectilinear Packing," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 457-470, August.
    2. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2012. "A reference length approach for the 3D strip packing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 37-47.
    3. Andreas Bortfeldt & Sabine Jungmann, 2012. "A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint," Annals of Operations Research, Springer, vol. 196(1), pages 53-71, July.
    4. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    5. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    6. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.
    7. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    8. 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.
    9. Toffolo, Túlio A.M. & Esprit, Eline & Wauters, Tony & Vanden Berghe, Greet, 2017. "A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 526-538.
    10. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    11. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    12. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    13. 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.
    14. Sławomir Bąk & Jacek Błażewicz & Grzegorz Pawlak & Maciej Płaza & Edmund K. Burke & Graham Kendall, 2011. "A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 15-25, February.
    15. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    16. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    17. Zhu, Wenbin & Huang, Weili & Lim, Andrew, 2012. "A prototype column generation strategy for the multiple container loading problem," European Journal of Operational Research, Elsevier, vol. 223(1), pages 27-39.
    18. 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.
    19. Tian, Tian & Zhu, Wenbin & Lim, Andrew & Wei, Lijun, 2016. "The multiple container loading problem with preference," European Journal of Operational Research, Elsevier, vol. 248(1), pages 84-94.
    20. Wei, Lijun & Tian, Tian & Zhu, Wenbin & Lim, Andrew, 2014. "A block-based layer building approach for the 2D guillotine strip packing problem," European Journal of Operational Research, Elsevier, vol. 239(1), pages 58-69.

    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:eee:ejores:v:209:y:2011:i:3:p:219-227. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.