| 生成最优二划分装盘方案的递归算法 |
| |
| 引用本文： | 孙英,何冬黎,崔耀东.生成最优二划分装盘方案的递归算法[J].计算机仿真,2009,26(9):160-163. |
| |
| 作者姓名： | 孙英 何冬黎 崔耀东 |
| |
| 作者单位： | 1. 楚雄师范学院计算机科学系,云南,楚雄,675000
2. 广西师范大学计算机科学系,广西,桂林,541004 |
| |
| 基金项目： | 云南省教育厅科学研究基金项目(07Y11137);;广西科学基金资助项目(桂科自0728100) |
| |
| 摘 要： | 针对物流领域的研究装盘问题,为提高装载效率,在矩形托盘中正交的布置最多数目同尺寸长方体小箱,并且小箱之间不发生重叠。采用二划分装盘方案。所谓"二划分",是指一条划分线总是贯穿被划分的区域,将区域划分为二个较小的矩形子区域。二划分方案可以通过使用水平或竖直的划分线,将装裁区域递归地二划分为若干个子区域,每一子区域有且仅有一个小箱。采用递归算法,通过适当设置成本参数,生成排数最少的最优二划分装盘方案。实验计算结果表明所述算法可以有效地简化装箱方案。
|
| 关 键 词： | 装盘问题 排样问题 递归算法 |
A Recursive Algorithm for Generating Optimal Guillotine Pallet Loading Patterns |
| |
| SUN Ying,HE Dong-li,CUI Yao-dong.A Recursive Algorithm for Generating Optimal Guillotine Pallet Loading Patterns[J].Computer Simulation,2009,26(9):160-163. |
| |
| Authors: | SUN Ying HE Dong-li CUI Yao-dong |
| |
| Affiliation: | 1. Department of Computer Science;Chuxiong Normal University;Chuxiong Yunnan 675000;China;2. Department of Computer Science;Guangxi Normal University;Guilin Guangxi 541004;China |
| |
| 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 algor... |
| |
| Keywords: | Pallet loading Cutting stock Recursive algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
