Abstract: We consider the temporal vector bin packing problem that originated from cloud computing (Ratushnyi, Kochetov, 2021). Suppose we are given a finite set of items and for each item, an arriving time, a processing time, and two weights (dimensions) are known. A certain subset of all items is called a set of large items. Each bin has two capacities (dimensions) and is divided into two identical parts. A large item should be divided into two identical parts and placed in both parts of a bin. Other items can be placed in one part of a bin, if there is enough capacity there in both dimensions. The goal is to pack all items into the minimum number of bins of identical dimensions. We propose a grouping genetic algorithm for solving this problem, compare it with the Column Generation heuristic and describe the results of a computational experiment. The comparison of the algorithms was carried out on an open data set.

Cite: Sakhno M.A.
A Grouping Genetic Algorithm for the Temporal Vector Bin Packing Problem
In compilation 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS). – IEEE., 2023. – C.94-99. – ISBN 9798350331134. DOI: 10.1109/opcs59592.2023.10275770 Scopus OpenAlex

Dates:

Published print:	Oct 13, 2023
Published online:	Oct 13, 2023

Identifiers:

Scopus:	2-s2.0-85175467509
OpenAlex:	W4387620807

Citing:

DB	Citing
OpenAlex	2
Scopus	2

Altmetrics: