Three-Dimensional Bin Packing and Mixed-Case Palletization
TL
TL;DR
This research presents a novel approach to solving the three-dimensional bin-packing problem by automating the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and packing instances.
Abstract
Despite its wide range of applications, the three-dimensional bin-packing problem is still one of the most difficult optimization problems to solve. Currently, medium- to large-size instances are o...
References23 items
1
Triple-solution approach for the strip packing problem with two-staged patterns
2
A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
3
fitdistrplus: An R Package for Fitting Distributions
4
Constraints in container loading - A state-of-the-art review
5