IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0245267.html
   My bibliography  Save this article

Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology

Author

Listed:
  • Nestor M Cid-Garcia
  • Yasmin A Rios-Solis

Abstract

We use the Positions and Covering methodology to obtain exact solutions for the two-dimensional, non-guillotine restricted, strip packing problem. In this classical NP-hard problem, a given set of rectangular items has to be packed into a strip of fixed weight and infinite height. The objective consists in determining the minimum height of the strip. The Positions and Covering methodology is based on a two-stage procedure. First, it is generated, in a pseudo-polynomial way, a set of valid positions in which an item can be packed into the strip. Then, by using a set-covering formulation, the best configuration of items into the strip is selected. Based on the literature benchmark, experimental results validate the quality of the solutions and method’s effectiveness for small and medium-size instances. To the best of our knowledge, this is the first approach that generates optimal solutions for some literature instances for which the optimal solution was unknown before this study.

Suggested Citation

  • Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2021. "Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology," PLOS ONE, Public Library of Science, vol. 16(1), pages 1-20, January.
    • Handle: RePEc:plo:pone00:0245267
    DOI: 10.1371/journal.pone.0245267
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0245267
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0245267&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0245267?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    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. 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.
    2. 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.
    3. Germán Pantoja-Benavides & David Álvarez-Martínez & Francisco Parreño Torres, 2024. "The Normalized Direct Trigonometry Model for the Two-Dimensional Irregular Strip Packing Problem," Mathematics, MDPI, vol. 12(15), pages 1-25, August.
    4. Kaizhi Chen & Jiahao Zhuang & Shangping Zhong & Song Zheng, 2020. "Optimization Method for Guillotine Packing of Rectangular Items within an Irregular and Defective Slate," Mathematics, MDPI, vol. 8(11), pages 1-16, November.
    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. 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.
    7. Bortfeldt, Andreas, 2006. "A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces," European Journal of Operational Research, Elsevier, vol. 172(3), pages 814-837, August.
    8. 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.
    9. Ö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.
    10. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    11. 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.
    12. Kenmochi, Mitsutoshi & Imamichi, Takashi & Nonobe, Koji & Yagiura, Mutsunori & Nagamochi, Hiroshi, 2009. "Exact algorithms for the two-dimensional strip packing problem with and without rotations," European Journal of Operational Research, Elsevier, vol. 198(1), pages 73-83, October.
    13. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    14. David Pisinger, 2007. "Denser Packings Obtained in O ( n log log n ) Time," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 395-405, August.
    15. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    16. Wu, Yu-Liang & Huang, Wenqi & Lau, Siu-chung & Wong, C. K. & Young, Gilbert H., 2002. "An effective quasi-human based heuristic for solving the rectangle packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 341-358, September.
    17. Zehetner, Dominik & Gansterer, Margaretha, 2022. "The collaborative batching problem in multi-site additive manufacturing," International Journal of Production Economics, Elsevier, vol. 248(C).
    18. Zhang, Xiangyi & Chen, Lu & Gendreau, Michel & Langevin, André, 2022. "A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 302(1), pages 259-269.
    19. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    20. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.

    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:plo:pone00:0245267. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.