A Layer-based Heuristic for the Container Loading Problem with Homogeneous Boxes
The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics are an often-sought approach. This article proposes a heuristic to pack homogeneous rectangular boxes into a container. This algorithm adopts a layer-based loading approach: one dimension of the box is fixed as the height of the layer and the arrangement of boxes in this layer is thus reduced to a two-dimensional pallet loading problem. Multiple layers with the same box dimension as the height of the layer are aggregated into a single layer, and a block-based two-dimensional packing procedure is then developed to solve the loading problem at the layers level. The algorithm essentially solves three optimization problems: a twodimensional loading problem for each layer, the height of each aggregated layer with boxes stacking one on top of another by fixing a box dimension as the height, and the side of the container on which layers are to be built.
Container loading problem heuristic layer,packing, optimization
WANG Zhoujing Kevin W.LI
Department of Automation Xiamen University Xiamen, Fujian 361005, China Odette School of Business University of Windsor Windsor, Ontario N9B 3P4, Canada
国际会议
武汉
英文
233-238
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）