Реферат: 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 Variable sized bin packing \and Limited number of bins \and Genetic algorithm.of the proposed approach comparing to the heuristic algorithm previously known from the literature and Gurobi solver.

Библиографическая ссылка: Borisovsky P. , Fedotova E.
Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins
International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022