Institutional Repository of Vilnius University
Konteinerių pakavimo algoritmų analizė ir palyginimas /
Abstract
dc:descriptionThe essence of the Bin Packing Problem is to optimally allocate a set of items with varying sizes into a finite number of fixed-size bins while minimizing the number of bins used. Bin packing algorithms are used to find optimal solutions for the problem. The goal of this research is to analyze the packing algorithms and find cases where the performance of each algorithm is highest. The following tasks were solved in this research: the packing problem and the operation principles of packing algorithms were analyzed, the classifications, limitations and the most important performance indicators of packing algorithms were named. The performance of packing algorithms was tested, the test results were analyzed and compared and recommendations were given based on the circumstances of the case.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Klimas, Jonas Margiris,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD192842516&prefLang=en_US