Small Boxes Big Data: A Deep Learning Approach to Optimize Variable Sized Bin Packing

Understand

Bin Packing problems have been widely studied because of their broad applications in different domains.

• Known as a set of NP-hard problems, they have different vari- ations and many heuristics have been proposed for obtaining approximate solutions.
• Specifically, for the 1D variable sized bin packing problem, the two key sets of optimization heuristics are the bin assignment and the bin allocation.
• Usually the performance of a single static optimization heuristic can not beat that of a dynamic one which is tailored for each bin packing instance.