Skip to main content

An Estimation of Distribution Algorithm for the 3D Bin Packing Problem with Various Bin Sizes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8206))

Abstract

The 3D bin packing problem (3DBPP) is a practical problem modeled from modern industry application such as container ship loading and plane cargo management. Unlike traditional bin packing problem where all bins are of the same size, this paper investigates a more general type of 3DBPP with bins of various sizes. We proposed a modified univariate marginal distribution algorithm (UMDA) for solving the problem. A packing strategy derived from a deepest bottom left packing method was employed. The modified UMDA was experimentally compared with CPLEX and a genetic algorithm (GA) approach. The experimental study showed that the proposed algorithm performed better than GA and CPLEX for large-scale instances.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hifi, M., Kacem, I., Nègre, S., et al.: A linear programming approach for the three-dimensional bin-packing problem. Electronic Notes in Discrete Mathematics 36, 993–1000 (2010)

    Article  Google Scholar 

  2. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research 48(2), 256–267 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lim, A., Rodrigues, B., Yang, Y.: 3-d container packing heuristics. Applied Intelligence 22(2), 125–134 (2005)

    Article  MATH  Google Scholar 

  4. Lodi, A., Martello, S., Vigo, D.: Tspack: a unified tabu search code for multi-dimensional bin packing problems. Annals of Operations Research 131(1-4), 203–213 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Crainic, T., Perboli, G., Tadei, R.: TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research 195(3), 744–760 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Wang, H.F., Chen, Y.J.: A hybrid genetic algorithm for 3d bin packing problems. In: 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), pp. 703–707. IEEE (2010)

    Google Scholar 

  7. Wu, Y., Li, W.K., Goh, M., Souza, R.: Three-dimensional bin packing problem with variable bin height. European Journal of Operational Research 202(2), 347–355 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Henrion, M.: Propagating uncertainty in bayesian networks by probabilistic logic sampling. In: Uncertainty in Artificial Intelligence, vol. 2, pp. 149–163 (1988)

    Google Scholar 

  9. Mühlenbein, H.: The equation for response to selection and its use for prediction. Evolutionary Computation 5(3), 303–346 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, Y., Chen, H., Xu, R., Shao, H., Li, X. (2013). An Estimation of Distribution Algorithm for the 3D Bin Packing Problem with Various Bin Sizes. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2013. IDEAL 2013. Lecture Notes in Computer Science, vol 8206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41278-3_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41278-3_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41277-6

  • Online ISBN: 978-3-642-41278-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics