Answers are grounded in this paper and cite their sources.
Computational study demonstrates efficient cargo space optimization across heterogeneous containers under physical loading constraints, highlighting practical applications for industrial logistics.
We propose a mixed‐integer linear model that solves the multiple heterogeneous knapsack problem, minimising the wasted space of the bins, taking into account their priority and considering the following constraints: non‐overlapping, boundaries and positioning (both constrained and free), rotations (around the vertical axis), orthogonal displacement, weight limit, static stability, weight distribution in a pyramidal region and load bearing considering items' arbitrary centre of mass (CoM). In the experiments, the priority parameter is set to prioritise smaller bins, but the model is generic to cover other cases. We study the trade‐off of adding more constraints to make the problem more realistic and the complexity of finding a solution. We introduce new metrics that facilitate the comparison of datasets used in experiments. These metrics allow the export of theoretical results in the industry. We also propose a constructive heuristic named weight first best fit to handle large‐scale instances in a reasonable time.
No takes yet. Share an insight, caveat, or question.
Deplano et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: