Skip to main content
SpringerLink
Log in
Book cover

Introduction to Cutting and Packing Optimization pp 47–72Cite as

One-Dimensional Bin Packing

  • Chapter
  • First Online:

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 263))

Abstract

The one-dimensional bin packing problem (1BPP) is one of the most famous problems in combinatorial optimization. The 1BPP is closely related to the one-dimensional cutting stock problem (1CSP) in terms of modeling, however, both problems possess their particularities, especially with respect to solution methods. Therefore, we will consider the 1CSP in another chapter to address the problem specific issues more properly.

The BPP is known to be NP-hard. For that reason, we will consider, besides exact solution approaches, lower and upper bounds for the optimal value as well as reduction methods and some extensions.

This is a preview of subscription content, 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   139.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

Learn about institutional subscriptions

References

  1. C. Alves, J.M.V. de Carvalho, Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183(3), 1333–1352 (2007)

    Article  Google Scholar 

  2. C. Alves, F. Clautiaux, J.V. de Carvalho, J. Rietz, Dual-Feasible Functions for Integer Programming and Combinatorial Optimization (Springer, Berlin, 2016)

    Book  Google Scholar 

  3. J. Bang-Jensen, R. Larsen, Efficient algorithms for real-life instances of the variable size bin packing problem. Comput. Oper. Res. 39(11), 2848–2857 (2012)

    Article  Google Scholar 

  4. M.A. Boschetti, A. Mingozzi, The two-dimensional finite bin packing problem. part I: new lower bounds for the oriented case. 4OR 1, 27–42 (2003)

    Google Scholar 

  5. M.A. Boschetti, L. Montaletti, An exact algorithm for the two-dimensional strip-packing problem. Oper. Res. 58, 1774–1791 (2010)

    Article  Google Scholar 

  6. J. Carlier, F. Clautiaux, A. Moukrim, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Comput. Oper. Res. 34, 2223–2250 (2007)

    Article  Google Scholar 

  7. L.M.A. Chan, D. Simchi-Levi, J. Bramel, Worst-case analysis, linear programming and the bin-packing problem. Math. Program. 83, 213–227 (1998)

    Google Scholar 

  8. F. Clautiaux, C. Alves, J.V. de Carvalho, A survey of dual-feasible and superadditive functions. Ann. OR 179(1), 317–342 (2010)

    Article  Google Scholar 

  9. E.G. Coffman Jr., G.S. Luecker, Probabilistic Analysis of Packing and Partitioning Algorithms (Wiley, New York, 1991)

    Google Scholar 

  10. E.G. Coffman, P.W. Shor, Average–case analysis of cutting and packing in two dimensions. Eur. J. Oper. Res. 44(2), 134–144 (1990)

    Article  Google Scholar 

  11. T.G. Crainic, G. Perboli, M. Pezzuto, R. Tadei, Computing the asymptotic worst-case of bin packing lower bounds. Eur. J. Oper. Res. 183, 1295–1303 (2007)

    Article  Google Scholar 

  12. G. Dosa, The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9 OPT(I)+6/9, in ESCAPE 2007 (Springer, Heidelberg, 2007), pp. 1–11

    Google Scholar 

  13. S.P. Fekete, J. Schepers, A general framework for bounds for higher-dimensional orthogonal packing problems. Math. Methods Oper. Res. 60(2), 311–329 (2004)

    Article  Google Scholar 

  14. K. Fleszar, K.S. Hindi, New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29, 821–839 (2002)

    Article  Google Scholar 

  15. G.N. Frederickson, Probabilistic analysis for simple one– and two–dimensional bin packing algorithms. Inf. Process. Lett. 11, 156–161 (1980)

    Article  Google Scholar 

  16. M.R. Garey, D.S. Johnson, Computers and Intractability – A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)

    Google Scholar 

  17. P.C. Gilmore, R.E. Gomory, A linear programming approach to the cutting-stock problem (Part I). Oper. Res. 9, 849–859 (1961)

    Article  Google Scholar 

  18. J.N.D. Gupta, J.C. Ho, A new heuristic algorithm for the one-dimensional bin-packing problem. Prod. Plan. Control 10(6), 598–603 (1999)

    Article  Google Scholar 

  19. M. Haouari, A. Gharbi, Fast lifting procedures for the bin packing problem. Discrete Optim. 2, 201–218 (2005)

    Article  Google Scholar 

  20. R. Hoberg, T. Rothvoss, A logarithmic additive integrality gap for bin packing. Technical report, Univ. of Washington, Seattle (2015)

    Google Scholar 

  21. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, R.L. Graham, Worst–case performance bounds for simple one–dimensional packing algorithms. SIAM J. Comput. 3(4), 299–325 (1974)

    Article  Google Scholar 

  22. J. Jylänki, A thousand ways to pack the bin – practical approach to two-dimensional rectangle bin packing. Technical report, online (2010)

    Google Scholar 

  23. A. Khanafer, F. Clautiaux, E. Talbi, New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res. 206(2), 281–288 (2010)

    Article  Google Scholar 

  24. R.E. Korf, Optimal rectangle packing: new rersults, in ICAPS-04 Proceedings (2004),pp. 142–149

    Google Scholar 

  25. S. Martello, P. Toth, Knapsack Problems (Wiley, Chichester, 1990)

    Google Scholar 

  26. S. Martello, P. Toth, Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28(1), 59–70 (1990)

    Article  Google Scholar 

  27. B. Xia, Z. Tan, Tighter bounds of the first fit algorithm for the bin-packing problem. Discrete Appl. Math. 158, 1668–1675 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Numerical Mathematics, TU Dresden, Dresden, Germany

    Guntram Scheithauer

Authors
  1. Guntram Scheithauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Scheithauer, G. (2018). One-Dimensional Bin Packing. In: Introduction to Cutting and Packing Optimization. International Series in Operations Research & Management Science, vol 263. Springer, Cham. https://doi.org/10.1007/978-3-319-64403-5_3

Download citation

Publish with us

Policies and ethics

Search

Navigation