【摘要】 针对物流领域的研究装盘问题,为提高装载效率,在矩形托盘中正交的布置最多数目同尺寸长方体小箱,并且小箱之间不发生重叠。采用二划分装盘方案。所谓"二划分",是指一条划分线总是贯穿被划分的区域,将区域划分为二个较小的矩形子区域。二划分方案可以通过使用水平或竖直的划分线,将装裁区域递归地二划分为若干个子区域,每一子区域有且仅有一个小箱。采用递归算法,通过适当设置成本参数,生成排数最少的最优二划分装盘方案。实验计算结果表明所述算法可以有效地简化装箱方案。更多还原

【Abstract】 This paper discusses the pallet loading problem in which identical cuboids are packed into a rectangular pallet orthogonally and without overlap,such that the number of cuboids is maximized. Slicing loading patterns are used. A slicing line always divides a rectangular area into two smaller rectangular ones. A slicing loading pattern can be divided recursively into sub-pallets,each of which contains only one cuboid. A recursive algorithm is presented. Through the use of appropriate cost parameters,the algorithm can generate the optimal slicing pattern that has,among all optimal slicing patterns,the minimum number of cuboid rows. The computational results indicate that the algorithm can efficiently simplify the loading patterns.更多还原