.png){kind=icon}
.png){kind=icon}
Return
Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2026.107482.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem (QMC-VSBPP), a challenging combinatorial optimization problem that generalizes the classical bin packing problem by incorporating multiple capacity dimensions, heterogeneous bin types, and quadratic interaction costs between items. We propose two complementary methods that advance the current state-of-the-art. First, a linearized mathematical model is introduced to eliminate quadratic terms, enabling the use of exact solvers such as Gurobi to compute strong lower bounds-reported here for the first time for this problem. Second, we develop RKO-ACO, a continuous-domain Ant Colony Optimization algorithm within the Random-Key Optimizer framework, enhanced with adaptive Q-learning parameter control and efficient local search. Extensive computational experiments on benchmark instances show that the proposed linearized model produces significantly tighter lower bounds than the original quadratic model, while RKO-ACO consistently matches or improves upon all best-known solutions in the literature, establishing new upper bounds for large-scale instances. These results provide new reference values for future studies and demonstrate the effectiveness of evolutionary and random-key approaches for solving complex quadratic packing problems.
Keywords:
Bin packing problem
Random-key optimizer
Ant colony optimization
Metaheuristics
Mathematical programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
198
Citations:
0