Skip to main content
SpringerLink
Log in

Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research: Recent Trends (MOTOR 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1661))

  • 309 Accesses

Abstract

In this paper, we consider a generalization of the well-known bin packing problem, in which several types of bins are given and the number of bins of each type is limited. Unlike the classic bin packing problem, this variant is not well represented in the literature, although it has a considerable practical value. For solving this problem, a genetic algorithm is proposed. It is based on a new representation scheme that uses first fit decreasing algorithm for decoding genotypes to solutions. The computational evaluation on the test instances have shown a competitive performance of the proposed approach comparing to the heuristic algorithms previously known from the literature and Gurobi solver.

The research of the first author was funded in accordance with the state task of the IM SB RAS, project FWNF-2022-0020.

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. Aringhieri, R., Duma, D., Grosso, A., Hosteins, P.: Simple but effective heuristics for the 2-constraint bin packing problem. J. Heuristics 24(3), 345–357 (2018)

    Article  Google Scholar 

  2. Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846–855 (1980)

    Article  MathSciNet  Google Scholar 

  3. Baldi, M.M., Crainic, T.G., Perboli, G., Tadei, R.: Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items. Ann. Oper. Res. 222(1), 125–141 (2012). https://doi.org/10.1007/s10479-012-1283-2

    Article  MathSciNet  MATH  Google Scholar 

  4. Brandão, F., Pedroso, J.P.: Bin packing and related problems: general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56–67 (2016)

    Article  MathSciNet  Google Scholar 

  5. Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret. Appl. Math. 111(3), 231–262 (2001)

    Article  MathSciNet  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  MathSciNet  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, 1474–1482 (2011)

    Article  MathSciNet  Google Scholar 

  8. Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 5–30 (1996)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Hemmelmayr, V., Schmid, V., Blum, C.: Variable neighbourhood search for the variable sized bin packing problem. Comput. Oper. Res. 39, 1097–1108 (2012)

    Article  MathSciNet  Google Scholar 

  14. Monaci, M.: Algorithms for packing and scheduling problems. Ph.D. thesis. University of Bologna, Bologna (2002)

    Google Scholar 

  15. Munien, C., Ezugwu, A.E.: Metaheuristic algorithms for one-dimensional bin-packing problems: a survey of recent advances and applications. J. Intell. Syst. 30, 636–663 (2021)

    Article  Google Scholar 

  16. Pessoa, A., Sadykov, R., Uchoa, E.: Solving bin packing problems using VRPSolver models. Oper. Res. Forum 2(2), 1–25 (2021). https://doi.org/10.1007/s43069-020-00047-8

    Article  MathSciNet  MATH  Google Scholar 

  17. Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., Gómez, C.S., Fraire Huacuja, H., Alvim, A.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52–64 (2014)

    Article  MathSciNet  Google Scholar 

  18. Valério de Carvalho, J.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86, 629–659 (1999)

    Google Scholar 

Download references

Acknowledgement

The authors would like to thank Prof. Michele Monaci, Prof. Cristian Blum, and Dr. Ruslan Sadykov for the help with the test instances. An AMD EPYC based server of Sobolev Institute of Mathematics, Omsk Branch is used for computing.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Pavel Borisovsky & Evgeniya Fedotova

  2. Dostoevsky Omsk State University, Omsk, Russia

    Evgeniya Fedotova

Authors
  1. Pavel Borisovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evgeniya Fedotova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Borisovsky .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Yury Kochetov

  2. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Anton Eremeev

  3. Melentiev Energy Systems Institute, Irkutsk, Russia

    Oleg Khamisov

  4. Institute of Applied Mathematical Research, Petrozavodsk, Russia

    Anna Rettieva

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Borisovsky, P., Fedotova, E. (2022). Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins. In: Kochetov, Y., Eremeev, A., Khamisov, O., Rettieva, A. (eds) Mathematical Optimization Theory and Operations Research: Recent Trends. MOTOR 2022. Communications in Computer and Information Science, vol 1661. Springer, Cham. https://doi.org/10.1007/978-3-031-16224-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16224-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16223-7

  • Online ISBN: 978-3-031-16224-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation