IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v145y2013i2p511-530.html
   My bibliography  Save this article

Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints

Author

Listed:
  • de Queiroz, Thiago A.
  • Miyazawa, Flávio K.

Abstract

In the oriented Two-Dimensional Strip Packing Problem (2SP), one has to pack a set of rectangular items into a rectangular strip and minimizes the overall strip height used to pack all items. This paper deals with the 2SP under two practical situations. In the first, feasible packings must respect the load balancing and the multi-drop constraints. That is, the center of gravity of the packing at each moment must lie in a safety region, even after a subset of items is unloaded. In the second situation, the load balancing constraint is combined with the load bearing constraint. In a packing that respect the load bearing constraint, the bearing capacity of each item must be respected. That is, there is a maximum tolerable weight that each item can bear. For both situations, we present approximate 0–1 integer linear programming models and heuristics, based on level-packing algorithms and packing on corner points. The level-packing heuristic has an asymptotic approximation ratio bounded by 1.75, when the number of orders is bounded by a constant. The heuristics have proven to be helpful when combined with the integer models. In addition, many computational experiments validate the integer models and show that they are suitable to deal with problems where the number of possible positions to arrange the items in the bin is small.

Suggested Citation

  • de Queiroz, Thiago A. & Miyazawa, Flávio K., 2013. "Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 511-530.
    • Handle: RePEc:eee:proeco:v:145:y:2013:i:2:p:511-530
    DOI: 10.1016/j.ijpe.2013.04.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313001965
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.04.032?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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Michel Gendreau & Manuel Iori & Gilbert Laporte & Silvano Martello, 2006. "A Tabu Search Algorithm for a Routing and Container Loading Problem," Transportation Science, INFORMS, vol. 40(3), pages 342-350, August.
    6. Imai, Akio & Sasaki, Kazuya & Nishimura, Etsuko & Papadimitriou, Stratos, 2006. "Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 373-389, June.
    7. 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.
    8. 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.
    9. Andreas Bortfeldt & Gerhard Wäscher, 2012. "Container Loading Problems - A State-of-the-Art Review," FEMM Working Papers 120007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    10. 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.
    11. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.
    12. Manuel Iori & Juan-José Salazar-González & Daniele Vigo, 2007. "An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Transportation Science, INFORMS, vol. 41(2), pages 253-264, May.
    13. Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2008. "Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation," European Journal of Operational Research, Elsevier, vol. 191(1), pages 61-85, November.
    14. 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.
    15. 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)

    Citations

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


    Cited by:

    1. 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.
    2. Çalık, Hatice & Juwet, Marc & Yaman, Hande & Vanden Berghe, Greet, 2023. "Cargo securing under multi-drop and axle weight constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 157-176.
    3. 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.
    4. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    5. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.

    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. 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.
    3. 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.
    4. 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.
    5. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    6. Jéssica Gabriela Almeida Cunha & Vinícius Loti de Lima & Thiago Alves Queiroz, 2020. "Grids for cutting and packing problems: a study in the 2D knapsack problem," 4OR, Springer, vol. 18(3), pages 293-339, September.
    7. 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.
    8. 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.
    9. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    10. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    11. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    12. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    13. 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.
    14. 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.
    15. Castro, Pedro M. & Oliveira, José F., 2011. "Scheduling inspired models for two-dimensional packing problems," European Journal of Operational Research, Elsevier, vol. 215(1), pages 45-56, November.
    16. 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.
    17. 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.
    18. 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.
    19. Gajda, Mikele & Trivella, Alessio & Mansini, Renata & Pisinger, David, 2022. "An optimization approach for a complex real-life container loading problem," Omega, Elsevier, vol. 107(C).
    20. 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.

    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:proeco:v:145:y:2013:i:2:p:511-530. 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/ijpe .

    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.