Skip to main content
SpringerLink
Log in

Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic

  • Conference paper
Learning and Intelligent Optimization (LION 2011)

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

Included in the following conference series:

Abstract

The two-dimensional bin packing problem (2BP) consists in packing a set of rectangular items into rectangular, equally-sized bins. The problem is NP-hard and has a multitude of real world applications. We consider the case where the items are oriented and guillotine cutting is free. In this paper we first present a review of well-know heuristics for the 2BP and then propose a new ILP model for the problem. Moreover, we develop a multi-start algorithm based on a probabilistic version of the LGFi heuristic from the literature. Results are compared to other well-known heuristics, using data sets provided in the literature. The obtained experimental results show that the proposed algorithm returns excellent solutions. With an average percentage deviation of 1.8% from the best know lower bounds it outperformes the other algorithms by 1.1% − 5.7%. Also for 3 of the 500 instances we tested a new upper bound was found.

This work was supported by the binational grant Acciones Integradas ES16-2009 (Austria) and MEC HA2008-0005 (Spain), and by grant TIN2007-66523 (FORMALISM) of the Spanish government. In addition, Christian Blum acknowledges support from the Ramón y Cajal program of the Spanish Government of which he is a research fellow.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hopper, E., Turton, B.: A genetic algorithm for a 2d industrial packing problem. Computers and Industrial Engineering 37(1-2), 375–378 (1999)

    Article  Google Scholar 

  2. Sweeney, P.E., Paternoster, E.R.: Cutting and packing problems: A categorized, application-orientated research bibliography. The Journal of the Operational Research Society 43(7), 691–706 (1992)

    Article  MATH  Google Scholar 

  3. Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11(4), 345–357 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  5. Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123(1-3), 379–396 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lodi, A., Martello, S., Vigo, D.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141(2), 241–252 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lodi, A.: Algorithms for Two-Dimensional Bin Packing and Assignment Problems. PhD thesis, Università degli Studio di Bologna (1996-1999)

    Google Scholar 

  8. Dowsland, K.A., Dowsland, W.B.: Packing problems. European Journal of Operational Research 56(1), 2–14 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 9(4), 808–826 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frenk, J.B.G., Galambos, G.: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39(3), 201–217 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods 3(1), 66–76 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  12. Berkey, J.O., Wang, P.Y.: Two dimensional finite bin packing algorithms. Journal of the Operational Research Society 38(5), 423–429 (1987)

    Article  MATH  Google Scholar 

  13. Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4), 846–855 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  14. Wong, L., Lee, L.S.: Heuristic placement routines for two-dimensional bin packing problem. Journal of Mathematics and Statistics 5(4), 334–341 (2009)

    Article  MATH  Google Scholar 

  15. Lodi, A., Martello, S., Vigo, D.: Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research 112(1), 158–166 (1999)

    Article  MATH  Google Scholar 

  16. Crainic, T.G., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. Informs Journal on Computing 20(3), 368–384 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing 19(1), 36–51 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Puchinger, J., Raidl, G.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research 183(3), 1304–1327 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lee, L.S.: A genetic algorithm for two-dimensional bin packing problem. MathDigest 2(1), 34–39 (2008)

    Google Scholar 

  20. Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Management Science 44(3), 388–399 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, Universität Wien, Vienna, Austria

    Lukas Baumgartner & Verena Schmid

  2. ALBCOM Research Group, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

Authors
  1. Lukas Baumgartner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Verena Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departmento de Computation, Centro de Investigacion y de Estudios, Avanzados del Instituto Politecnico Nacional (CINVESTAV-IPN), Av. IPN No. 2508, Col. San Pedro Zacatenco, D.F. 0360, Mexico, Mexico

    Carlos A. Coello Coello

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumgartner, L., Schmid, V., Blum, C. (2011). Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25566-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation