A column generation-based heuristic for the three-dimensional bin packing problem with rotation
研究三维装箱问题中物品可旋转的情况，用列生成技术设计启发式算法，通过快速生成列和极端点定位物品，减少箱子使用数量，效果优于现有方法。
This paper addresses a three-dimensional bin packing problem (3D-BPP) with rotation. The aim is finding the best way of packing 3D items into bins to increase the packing factor with the purpose of minimizing the number of bins. No restrictions apply to the orientation of the items, in which case items can be rotated both vertically and horizontally. 3D-BPP is solved by using a column generation (CG) technique-based heuristic. To generate new columns, fast CG is carried out by applying a heuristic pricing method, in which items with most negative reduced cost are sequentially positioned into bins based on an extreme point concept. The CG technique outperforms the best significant techniques in the literature in terms of solution quality. We also provide the new lower bounds for 3D-BPP with no rotation using CG technique.