Skip to main content
SpringerLink
Log in

Solving a Three-Dimensional Bin-Packing Problem Arising in the Groupage Process: Application to the Port of Gioia Tauro

  • Chapter
  • First Online:
A View of Operations Research Applications in Italy, 2018

Part of the book series: AIRO Springer Series ((AIROSS,volume 2))

Abstract

In this paper we consider the consolidation operations in the groupage process. Containers, arriving from different origins carry objects with the same destination. We address the problem of inserting objects with the same destination into a new container. It is a three-dimensional bin-packing problem where several operational constraints are taken into account. We develop a simple but effective heuristic to solve the problem. This is based on the well-known next fit procedure where the concept of multi-layer is introduced. The defined heuristic allows to save empty space in the container dealing with a high impact on the real application. We present the main features of a decision support system that can help the logistic operators to implement a consolidation/deconsolidation hub.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Amossen, R.R., Pisinger, D.: Multi-dimensional bin packing problems with guillotine constraints. Comput. Oper. Res. 37(11), 1999–2006 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Brandt, F., Nickel, S.: The air cargo load planning problem - a consolidated problem definition and literature review on related problems. Eur. J. Oper. Res. (2018)

    Google Scholar 

  5. Chung, F.K.R., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebr. Discret. Methods 3, 66–76 (1982)

    Article  MathSciNet  Google Scholar 

  6. Corcoran, A.L., Wainright, R.L.: A genetic algorithm for packing in three dimensions. In: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990’s, pp. 1021–1030 (1992)

    Google Scholar 

  7. Egeblada, J., Garavelli, C., Lisi, S., Pisinger, D.: Heuristics for container loading of furniture. Eur. J. Oper. Res. 200(3), 881–892 (2010)

    Article  Google Scholar 

  8. Faroe, O., Pisinger, D., Zachariasen, M.: Guided local search for the three-dimensional bin packing problem. INFORMS J. Comput. 15(3), 267–283 (2003)

    Article  MathSciNet  Google Scholar 

  9. Junqueira, L., Morabito, R., Sato Yamashita, D.: Three-dimensional container loading models with cargo stability and load bearing constraints. Comput. Oper. Res. 39, 74–85 (2012)

    Article  MathSciNet  Google Scholar 

  10. Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141(2), 410–420 (2002)

    Article  MathSciNet  Google Scholar 

  11. Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1), 379–396 (2002)

    Article  MathSciNet  Google Scholar 

  12. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48(2) (2000)

    Article  MathSciNet  Google Scholar 

  13. Miyazawa, F.K., Wakabaysashi, Y.: An algorithm for the three dimensional bin packing problem with asymptotic performance analysis. Algorithmica 18, 122–144 (1996)

    Article  Google Scholar 

  14. Muritiba, A.E.F., Iori, M., Malaguti, E., Toth, P.: Algorithms for the bin packing problem with conflicts. INFORMS J. Comput. 22(3), 401–415 (2010)

    Article  MathSciNet  Google Scholar 

  15. Wilbaut, C., Hanafi, S., Salhi, S.: A survey of effective heuristics and their application to a variety of knapsack problems. IMA J. Manag. Math. 19(3), 227–244 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to project Groupage (funded by the European Union and Calabria Region—POR FESR Calabria 2007/2013 Asse I Ricerca Scientifica, Innovazione Tecnologica e Societá dell’Informazione) for financial support of this research.

Author information

Authors and Affiliations

  1. DIMEG, Universitá della Calabria, Rende (CS), Italy

    Luigi Di Puglia Pugliese & Francesca Guerriero

  2. AutoTerminal Gioia Tauro S.p.A, Gioia Tauro, Italy

    Roberto Calbi

Authors
  1. Luigi Di Puglia Pugliese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesca Guerriero
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Calbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesca Guerriero .

Editor information

Editors and Affiliations

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

    Mauro Dell'Amico

  2. DIMES , University of Calabria, Arcavacata di Rende, Italy

    Manlio Gaudioso

  3. CNR - IASI Institute for Systems Analysis and Computer Science, National Research Council, Rome, Italy

    Giuseppe Stecca

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Di Puglia Pugliese, L., Guerriero, F., Calbi, R. (2019). Solving a Three-Dimensional Bin-Packing Problem Arising in the Groupage Process: Application to the Port of Gioia Tauro. In: Dell'Amico, M., Gaudioso, M., Stecca, G. (eds) A View of Operations Research Applications in Italy, 2018. AIRO Springer Series, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-030-25842-9_3

Download citation

Publish with us

Policies and ethics

Search

Navigation