摘要
研究同尺寸物品的集装箱装箱问题,即在一个给定尺寸的集装箱中,装入尽可能多的相同尺寸的长方体小货箱。采用动态规划算法确定装箱方案,并与商业装箱软件和智能启发式算法以及其他一些装箱算法作比较。根据文献中给出的一组题的实验结果,说明该算法得到的最好解个数最多,装箱方案也较简单,并且还能够避免上层物体悬臂梁式布局的情况。
In this paper we study the issue of packing containers with the items in same size, that is to stuff as much as possihle the cuboid small cargo boxes in same size to a container with given size. We use dynamic programming algorithm to determine the scheme of container packing, and compare it with business container-packing software and intelligent heuristic algorithm as well as some other container-packing algorithms. The experimental results of a set of subjects listed in literature indicate that the maximum number of the best solutions is derived from the proposed algorithm, the scheme is simpler, and can also prevent the situation of Izod layout of upper items.
出处
《计算机应用与软件》
CSCD
北大核心
2014年第7期249-251,共3页
Computer Applications and Software
基金
国家自然科学基金项目(61063031)
广西教育厅立项项目(广西高校科研201010LX003
关键词
装箱最优化
同尺寸小货箱
动态规划
箱容利用率
悬臂梁式布局
Container optimisation
Cargo boxes with same size
Dynamic programming
Container capacity utilisation
Izod layout
