This paper focuses on the container loading problem:how to pack as more identical rectangular boxes as possible into a rectangular container. Layer patterns are used,I. E. Three layers are used according to the length,width,and height of the box. A dynamic programming procedure is used to determine the optimal layouts of the boxes on the layers,and a knapsack problem is solved to obtain the optimal combination of the layers in the container. The algorithm has low complexity and the loading pattern is simple.%针对应用广泛的同尺寸长方体货品的装箱问题,本文运用分层装载方案,根据货品的长宽高采用三种不同的层高,利用动态规划算法分别计算三种层的最大装载量,再通过背包算法对层进行组合,得出装箱的最优方案.该算法复杂度低,装载方案简单.
展开▼
