IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v309y2022i1d10.1007_s10479-021-04226-6.html
   My bibliography  Save this article

A hybrid metaheuristic for the two-dimensional strip packing problem

Author

Listed:
  • Stéphane Grandcolas

    (Aix Marseille University, Université de Toulon, CNRS, LIS)

  • Cyril Pain-Barre

    (Aix Marseille University, Université de Toulon, CNRS, LIS)

Abstract

In this paper we present a hybrid metaheuristic approach called PVS (Progress and Verify Strategy) for the two-dimensional strip packing problem (2SPP). PVS relies on two procedures: a local search algorithm that delivers satisfying placements of the items on the horizontal axis, and an exact procedure that searches for the positions of the items on the vertical axis. This last one explores all the possibilities, starting with the most promising ones, and can be stopped at any moment. PVS follows a specific anytime strategy which continuously improves the current solution until it is provably optimal or a given time limit is reached. Experimental results show that the method is competitive on moderate-sized instances compared to the best known approaches.

Suggested Citation

  • Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
    • Handle: RePEc:spr:annopr:v:309:y:2022:i:1:d:10.1007_s10479-021-04226-6
    DOI: 10.1007/s10479-021-04226-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04226-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-021-04226-6?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.

    References listed on IDEAS

    as
    1. Nicos Christofides & Charles Whitlock, 1977. "An Algorithm for Two-Dimensional Cutting Problems," Operations Research, INFORMS, vol. 25(1), pages 30-44, February.
    2. Sándor P. Fekete & Jörg Schepers, 2004. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 353-368, May.
    3. G Belov & G Scheithauer & E A Mukhacheva, 2008. "One-dimensional heuristics adapted for two-dimensional rectangular strip packing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 823-832, June.
    4. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    5. Clautiaux, Francois & Carlier, Jacques & Moukrim, Aziz, 2007. "A new exact method for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1196-1211, 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. 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.
    8. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
    9. 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.
    10. Richard Korf & Michael Moffitt & Martha Pollack, 2010. "Optimal rectangle packing," Annals of Operations Research, Springer, vol. 179(1), pages 261-295, September.
    11. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    12. Silvano Martello & Michele Monaci & Daniele Vigo, 2003. "An Exact Approach to the Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 310-319, August.
    Full references (including those not matched with items on IDEAS)

    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. 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. 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.
    3. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
    4. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    5. Rosephine G. Rakotonirainy & Jan H. Vuuren, 2021. "The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 467-495, June.
    6. 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.
    7. 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.
    8. 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.
    9. Kaiyuan Liu & Hongyu Zhang & Chong Wang & Hui Li & Yongquan Chen & Qiong Chen, 2023. "Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins," Mathematics, MDPI, vol. 11(23), pages 1-22, November.
    10. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2014. "An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints," Operations Research, INFORMS, vol. 62(5), pages 1126-1141, October.
    11. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    12. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2020. "The Vehicle Routing Problem with Stochastic Two-Dimensional Items," Transportation Science, INFORMS, vol. 54(2), pages 453-469, March.
    13. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
    14. Clautiaux, Francois & Carlier, Jacques & Moukrim, Aziz, 2007. "A new exact method for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1196-1211, December.
    15. 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.
    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. 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.
    18. Selma Khebbache-Hadji & Christian Prins & Alice Yalaoui & Mohamed Reghioui, 2013. "Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows," 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. 21(2), pages 307-336, March.
    19. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.
    20. Côté, J.F. & Guastaroba, G. & Speranza, M.G., 2017. "The value of integrating loading and routing," European Journal of Operational Research, Elsevier, vol. 257(1), pages 89-105.

    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:annopr:v:309:y:2022:i:1:d:10.1007_s10479-021-04226-6. 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: 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.