Skip to main content
SpringerLink
Log in

Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2019)

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

Included in the following conference series:

Abstract

We consider the three-dimensional Bin Packing Problem in which a set of boxes must be packed into the minimum number of identical bins. We present a heuristic that iteratively creates new sequences of boxes that defines the packing order used to generate a new solution. The sequences are generated retaining, adaptively, characteristics of previous sequences for search intensification and diversification. Computational experiments of the effectiveness of this approach are presented and discussed.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. 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 

  2. Martello, S., Pisinger, D., Vigo, D.: The Three-dimensional bin packing problem. Oper. Res. 48, 256–267 (2000)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  4. Fekete, S.P., Schepers, J.: New classes of fast lower bounds for bin packing problems. Math. Program. 91, 11–31 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Glover, F.: Tabu search—part I. ORSA J. Comput. 1, 190–206 (1989)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Voudouris, C., Tsang, E.P.K.: Guided Local Search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. ISOR, vol. 57, pp. 185–218. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_7

    Chapter  Google Scholar 

  9. Boschetti, M.A.: New lower bounds for the three-dimensional finite bin packing problem. Discrete Appl. Math. 140, 241–258 (2004)

    Article  MathSciNet  Google Scholar 

  10. Fekete, S.P., Schepers, J., van der Veen, J.C.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55, 569–587 (2007)

    Article  MathSciNet  Google Scholar 

  11. Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29, 353–368 (2004)

    Article  MathSciNet  Google Scholar 

  12. Crainic, T.G., Perboli, G., Tadei, R.: TS2PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195, 744–760 (2009)

    Article  Google Scholar 

  13. Parreño, F., Alvarez-Valdés, R., Oliveira, J.F., Tamarit, J.M.: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing. Ann. Oper. Res. 179, 203–220 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable neighborhood search. Comput. Oper. Res. 57–97 (2019)

    Google Scholar 

  16. Crainic, T.G., Perboli, G., Tadei, R.: A greedy adaptive search procedure for multi-dimensional multi-container packing problems (2012)

    Google Scholar 

  17. Gonçalves, J.F., Resende, M.G.C.: A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145, 500–510 (2013)

    Article  Google Scholar 

  18. Gonçalves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487–525 (2011)

    Article  Google Scholar 

  19. Hifi, M., Negre, S., Wu, L.: Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21, 59–79 (2014)

    Article  MathSciNet  Google Scholar 

  20. Zudio, A., da Silva Costa, D.H., Masquio, B.P., Coelho, I.M., Pinto, P.E.D.: BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem. Electron. Notes Discret. Math. 66, 175–182 (2018)

    Article  MathSciNet  Google Scholar 

  21. Zhao, X., Bennell, J.A., Bektaş, T., Dowsland, K.: A comparative review of 3D container loading algorithms. Int. Trans. Oper. Res. 23, 287–320 (2016)

    Article  MathSciNet  Google Scholar 

  22. Lesh, N., Mitzenmacher, M.: BubbleSearch: a simple heuristic for improving priority-based greedy algorithms. Inf. Process. Lett. 97, 161–169 (2006)

    Article  MathSciNet  Google Scholar 

  23. Belov, G., Scheithauer, G., Mukhacheva, E.A.: One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J. Oper. Res. Soc. 59, 823–832 (2008)

    Article  Google Scholar 

  24. Zubaran, T., Ritt, M.: A simple, adaptive bubble search for improving heuristic solutions of the permutation flowshop scheduling problem. In: XLV SBPO - Simpósio Brasileiro de Pesquisa Operacional, pp. 1847–1856 (2013)

    Google Scholar 

  25. Lai, K.K., Chan, J.W.M.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)

    Article  Google Scholar 

  26. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

This project is funded by Portuguese funds through FCT/MCTES (PIDDAC) under the project CIICESI_2017-03.

Author information

Authors and Affiliations

  1. CIICESI – Center for Research and Innovation in Business Sciences and Information Systems, School of Technology and Management, Polytechnic of Porto, Porto, Portugal

    Óscar Oliveira, Telmo Matos & Dorabela Gamboa

Authors
  1. Óscar Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Telmo Matos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dorabela Gamboa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Óscar Oliveira .

Editor information

Editors and Affiliations

  1. Technical University of Crete, Chania, Greece

    Nikolaos F. Matsatsinis

  2. Technical University of Crete, Chania, Greece

    Yannis Marinakis

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos Pardalos

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

Oliveira, Ó., Matos, T., Gamboa, D. (2020). Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem. In: Matsatsinis, N., Marinakis, Y., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2019. Lecture Notes in Computer Science(), vol 11968. Springer, Cham. https://doi.org/10.1007/978-3-030-38629-0_6

Download citation

Publish with us

Policies and ethics

Search

Navigation