求解圆柱形物品装载问题的递归启发式算法

A Recursion Heuristic Algorithm for Cylinder Objects Loading Problem

研究同尺寸圆柱形物品的装载问题.先将同尺寸圆柱形物品装入容量相同的长方体小箱,然后将小箱装入集装箱中,使集装箱所装物品数最多.对于各种可能的小箱尺寸,用启发式算法确定物品在小箱内的布局,使体积利用率尽可能高;用递归算法确定小箱在集装箱内的布局,使体积利用率最高.实验结果表明本文算法能够简化小箱布局方案,同时简化装箱过程,具有较好的应用价值.

This paper studies the packing problem of identical cylinder objects. The objects are packed into identical cubic boxes that are in turn packed into a large container so that the container includes the maximum number of objects. For each possible box size, the approach uses a heuristic procedure to determine the layout of the cylinder objects in the box. The volume utilization level is as high as possible. A recursive procedure is used to determine the layout of the boxes in the container so the volume utilization level is the maximum. The experimental results indicate that the approach can simplify the box layout as well as the loading process, so it has good application value.