Skip to main content
SpringerLink
Log in

Efficient algorithms for the offline variable sized bin-packing problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We addresses a variant of the classical one dimensional bin-packing problem where several types of bins with unequal sizes and costs are presented. Each bin-type includes limited and/or unlimited identical bins. The goal is to minimize the total cost of bins needed to store a given set of items, each item with some space requirements. Four new heuristics to solve this problem are proposed, developed and compared. The experiments results show that higher quality solutions can be obtained using the proposed algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Basnet C., Wilson J.: Heuristics for determining the number of warehouses for storing non-compatible products. Int. Trans. Oper. Res. 12, 527–538 (2005)

    Article  Google Scholar 

  2. Belov G., Scheithauer G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141, 274–294 (2002)

    Article  Google Scholar 

  3. Blum C., Hemmelmayr V., Hernndez H., Schmid V.: Hybrid algorithms for the variable sized bin packing problem. Lect. Notes Comput. Sci. 30, 2069–2083 (2001). doi:10.1007/978-3-642-16054-7_2

    Google Scholar 

  4. Chu C., La R.: Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms. SIAM J. Comput. 30, 2069–2083 (2001)

    Article  Google Scholar 

  5. Coffmann J.E.G., Garey M.R., Johnson D.S.: Approximation Algorithms for NP-hard Problems: Approximation Algorithms for Bin-packing—A Survey, pp. 46–93. PWS Publishing, Boston (1997)

    Google Scholar 

  6. Correia I., Gouveia L., Saldanha-Da-Gama F.: Solving the variable size bin-packing problem with discretized formulations. Comput. Oper. Res. 35, 2103–2113 (2008)

    Article  Google Scholar 

  7. Crainic T.G., Perboli G., Rei W., Tadei R.: Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11), 1474–1482 (2011)

    Article  Google Scholar 

  8. Eilon S., Christofides N.: The loading problem. Manag. Sci. 17, 259–268 (1971)

    Article  Google Scholar 

  9. Epstein, L., Favrholdt, L.M.: On-line maximizing the number of items packed in variable-sized bins. In: Ibarra, O.H., Zhang, L. (eds.) Lecture Notes in Computer Science vol. 2387, pp. 467–475. COCOON 2002, Springer, Berlin (2002)

  10. Falkenauer E.: A hybrid grouping genetic algorithm. J. Heuristics 2, 5–30 (1996)

    Article  Google Scholar 

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

    Article  Google Scholar 

  12. Friesen D.K., Langston M.A.: Variable sized bin-packing. SIAM J. Comput. 15, 222–230 (1986)

    Article  Google Scholar 

  13. Garey M.R., Johnson D.S.: Computers and Intratability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    Google Scholar 

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

    Article  Google Scholar 

  15. Haouari M., Serairi M.: Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10), 2877–2884 (2009)

    Article  Google Scholar 

  16. Haouari M., Serairi M.: Relaxations and exact solution of the variable sized bin packing problem. Comput. Optim. Appl. 48, 345–368 (2011)

    Article  Google Scholar 

  17. Hifi M., MHallah R., Saadi T.: Algorithms for constrained two-staged two-dimensional cutting problems. INFORMS J. Comput. 20, 212–221 (2008)

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Kang J., Park S.: Algorithms for the variable sized bin-packing problem. Eur. J. Oper. Res. 147, 365–372 (2003)

    Article  Google Scholar 

  20. Monaci, M.: Algorithms for packing and scheduling problems. Phd thesis or/02/4, Universit di Bologna (2002)

  21. Murgolo F.D.: An efficient approximation scheme for variable-sized bin-packing. SIAM J. Comput. 16(1), 149–161 (1987)

    Article  Google Scholar 

  22. Ow P.S., Morton T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 35–62 (1988)

    Article  Google Scholar 

  23. Righini G., Bettinelli A., Ceselli A.: A branch-and-price algorithm for the variable size bin-packing problem with minimum filling constraint. Ann. Oper. Res. 179(1), 221–241 (2010)

    Article  Google Scholar 

  24. Scholl A., Klein R., Bison J.C.: A fast hybrid procedure for exactly solving the one-dimensional bin-packing problem. Comput. Oper. Res. 24(7), 627–645 (1997)

    Article  Google Scholar 

Download references

Author information

Author notes

  1. Mohamed Maiza

    Present address: Centre de Recherche en Informatique de Lens CNRS-UMR8188, Université d’Artois, 62300, Lens, France

Authors and Affiliations

  1. Applied Mathematics Laboratory, Military Polytechnic School, B.P.17, Bordj-El-Bahri, 16111, Algiers, Algeria

    Mohamed Maiza & Abdenour Labed

  2. Laboratory of Modeling and Optimization of Systems (LAMOS), University of Bejaia, Targua Ouzamour Campus, Bejaia, Algeria

    Mohammed Said Radjef

Authors
  1. Mohamed Maiza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdenour Labed
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed Said Radjef
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Maiza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maiza, M., Labed, A. & Radjef, M.S. Efficient algorithms for the offline variable sized bin-packing problem. J Glob Optim 57, 1025–1038 (2013). https://doi.org/10.1007/s10898-012-9989-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9989-x

Keywords

Search

Navigation