Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem

摘要

We consider the three-dimensional Bin Packing Problem in which a set of boxes must be packed into the minimum number of identical bins. We present a heuristic that iteratively creates new sequences of boxes that defines the packing order used to generate a new solution. The sequences are generated retaining, adaptively, characteristics of previous sequences for search intensification and diversification. Computational experiments of the effectiveness of this approach are presented and discussed.