Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins | Sciact - Система учета научной деятельности ИМ СО РАН

Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins Научная публикация

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2022, Том: 1661, Страницы: 55-67 Страниц : 13 DOI: 10.1007/978-3-031-16224-4_3

Ключевые слова

Variable sized bin packing, Limited number of bins, Genetic algorithm

Авторы

Borisovsky Pavel ¹ , Fedotova Evgeniya ^1,2

Организации

1	Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia
2	Dostoevsky Omsk State University, Omsk, Russia

Информация о финансировании (1)

Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».

FWNF-2022-0020

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.

Borisovsky P. , Fedotova E.
Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins
Communications in Computer and Information Science. 2022. V.1661. P.55-67. DOI: 10.1007/978-3-031-16224-4_3 Scopus OpenAlex

Scopus:	2-s2.0-85140455532
OpenAlex:	W4312894490

Пока нет цитирований