Skip to main content
SpringerLink
Log in

Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12433))

Included in the following conference series:

Abstract

In this paper, we study a pallet building problem that originates from a case study in a company that produces robotized systems for freight transportation and logistics. The problem takes into account well-known constraints, such as rotation and stackability, and other specific constraints such as visibility and contiguity among items belonging to the same family. We formalize the problem and then solve it by means of a GRASP metaheuristic. The algorithm is based on an Extreme Points heuristic and a reactive mechanism. It uses a two-step strategy, in which items are first grouped into horizontal layers, and then layers are stacked one over the other to form pallets. The performance of the algorithm is assessed through extensive computational tests on real-world instances. The results show that the GRASP is able to create very compact packings for most of the instances with a limited computational effort.

Supported by University of Parma, and by University of Modena and Reggio Emilia under grant FAR 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alonso, M., Alvarez-Valdes, R., Parreño, F., Tamarit, J.: Algorithms for pallet building and truck loading in an interdepot transportation problem. Math. Probl. Eng. 2016, 1–11 (2016)

    Article  Google Scholar 

  2. Alonso, M., Alvarez-Valdes, R., Tamarit, J., Parreño, F.: A reactive GRASP algorithm for the container loading problem with load-bearing constraints. Eur. J. Ind. Eng. 8, 669–694 (2014)

    Article  Google Scholar 

  3. Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131, 143–161 (2001)

    Article  Google Scholar 

  4. Bortfeldt, A., Wäscher, G.: Constraints in container loading - a state-of-the-art review. Eur. J. Oper. Res. 229, 1–20 (2013)

    Article  MathSciNet  Google Scholar 

  5. Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52, 655–671 (2004)

    Article  Google Scholar 

  6. Crainic, T., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. 20, 368–384 (2008)

    Article  MathSciNet  Google Scholar 

  7. Crainic, T., Perboli, G., Tadei, R.: Recent advances in multi-dimensional packing problems. In: New Technologies, Chap. 5. IntechOpen (2012)

    Google Scholar 

  8. de Queiroz, T., Miyazawa, F.: Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. Int. J. Prod. Econ. 145, 511–530 (2013)

    Article  Google Scholar 

  9. Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1–20 (2016)

    Article  MathSciNet  Google Scholar 

  10. Delorme, M., Iori, M., Martello, S.: Logic based benders decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78, 290–298 (2017)

    Article  MathSciNet  Google Scholar 

  11. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  Google Scholar 

  12. Imahori, S., Yagiura, M.: The best-fit heuristic for the rectangular strip packing problem: an efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37, 325–333 (2010)

    Article  Google Scholar 

  13. Iori, M., Lima, V., Martello, S., Miyazawa, F., Monaci, M.: Two-dimensional cutting and packing: problems and solution techniques. Technical report, University of Bologna (2019)

    Google Scholar 

  14. Iori, M., Locatelli, M., Moreira, M., Silveira, T.: Solution of a practical pallet building problem with visibility and contiguity constraints. In: International Conference on Enterprise Information Systems, vol. 1, pp. 327–338. SciTePress (2020)

    Google Scholar 

  15. Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18, 4–27 (2010)

    Article  MathSciNet  Google Scholar 

  16. Jovanovic, R., Voß, S.: Fixed set search applied to the minimum weighted vertex cover problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 490–504. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34029-2_31

    Chapter  Google Scholar 

  17. Jovanovic, R., Voß, S.: The fixed set search applied to the power dominating set problem. Expert Syst. e12559 (2020)

    Google Scholar 

  18. Józefowska, J., Pawlak, G., Pesch, E., Morze, M., Kowalski, D.: Fast truck-packing of 3D boxes. Eng. Manag. Prod. Serv. 10, 29–40 (2018)

    Google Scholar 

  19. Kurpel, D., Scarpin, C., Pécora Junior, J., Schenekemberg, C., Coelho, L.: The exact solutions of several types of container loading problems. Eur. J. Oper. Res. 284, 87–107 (2020)

    Article  MathSciNet  Google Scholar 

  20. Leung, S., Zhang, D., Sim, K.: A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215, 57–69 (2011)

    Article  Google Scholar 

  21. Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-Dimensional Bin Packing Problems, pp. 107–129. Wiley, Hoboken (2014)

    MATH  Google Scholar 

  22. Ranck Júnior, R., Yanasse, H., Morabito, R., Junqueira, L.: A hybrid approach for a multi-compartment container loading problem. Expert Syst. Appl. 137, 471–492 (2019)

    Article  Google Scholar 

  23. Scheithauer, G.: Introduction to Cutting and Packing Optimization. Springer, Cham (2018)

    Book  Google Scholar 

  24. Schmid, V., Doerner, K., Laporte, G.: Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224, 435–448 (2013)

    Article  MathSciNet  Google Scholar 

  25. Silva, E., Oliveira, J., Wäscher, G.: The pallet loading problem: a review of solution methods and computational experiments. Int. Trans. Oper. Res. 23, 147–172 (2016)

    Article  MathSciNet  Google Scholar 

  26. Terno, J., Scheithauer, G., Sommerweiß, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123, 372–381 (2000)

    Google Scholar 

  27. Vidal, T., Crainic, T., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231, 1–21 (2013)

    Article  MathSciNet  Google Scholar 

  28. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Reggio Emilia, Italy

    Manuel Iori

  2. Department of Engineering and Architecture, University of Parma, Parma, Italy

    Marco Locatelli & Tiago Silveira

  3. Department of Computer Science, Federal University of Lavras, Lavras, Brazil

    Mayron C. O. Moreira

Authors
  1. Manuel Iori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Locatelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mayron C. O. Moreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tiago Silveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tiago Silveira .

Editor information

Editors and Affiliations

  1. University of Twente, Enschede, The Netherlands

    Eduardo Lalla-Ruiz

  2. University of Twente, Enschede, The Netherlands

    Martijn Mes

  3. University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Iori, M., Locatelli, M., Moreira, M.C.O., Silveira, T. (2020). Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints. In: Lalla-Ruiz, E., Mes, M., Voß, S. (eds) Computational Logistics. ICCL 2020. Lecture Notes in Computer Science(), vol 12433. Springer, Cham. https://doi.org/10.1007/978-3-030-59747-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59747-4_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59746-7

  • Online ISBN: 978-3-030-59747-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation