J4 ›› 2012, Vol. 34 ›› Issue (10): 192-194.
• 论文 • 上一篇
姚 怡,崔耀东
收稿日期:
修回日期:
出版日期:
发布日期:
基金资助:
国家自然科学基金资助项目（61063031）；广西教育厅科学技术研究资助项目（200911MS19）
YAO Yi,CUI Yaodong
Received:
Revised:
Online:
Published:
摘要：
针对应用广泛的同尺寸长方体货品的装箱问题，本文运用分层装载方案，根据货品的长宽高采用三种不同的层高，利用动态规划算法分别计算三种层的最大装载量，再通过背包算法对层进行组合，得出装箱的最优方案。该算法复杂度低，装载方案简单。
关键词: 装箱, 集装箱运输, 动态规划
Abstract:
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.
Key words: container loading;container transport;dynamic programming
姚 怡,崔耀东. 一种高效的同尺寸长方体的装箱算法[J]. J4, 2012, 34(10): 192-194.
YAO Yi,CUI Yaodong. An Efficient Algorithm for the ContainerLoading Problem of Identical Boxes[J]. J4, 2012, 34(10): 192-194.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2012/V34/I10/192
