摘要
主要研究在有限旋转约束下的装箱问题。以Pisinger树搜索启发装箱算法为基础,在货物装配过程中考虑实际可行的旋转约束限制;并通过对树搜索宽度和深度的合理限制,使算法具有满意的运算时间;在装箱结果中,通过对货物层以及货物条的位置调整,从而满足重心位置和左右平衡等约束而不影响既有的装箱率。试验结果表明旋转约束对于装箱性能有一定的影响,但是改进算法在满足各种实际约束的条件下仍具有良好的装箱性能,同时该算法具有合理的运算时间。
This study mainly focuses on container loading problem with the constraint of limited rotation. Based on Pisinger＇ s tree-search heuristic algorithm, we take into account some actual constraints on cargoes, e.g.limited rotation and balance problems etc., in our improved algorithm. In order to get satisfied calculation time, proper width and depth for the tree-searching are specified. In addition, the layers and the strips of the cargoes may be exchanged to meet the constraint of the balance without decreasing the loading efficiency. The experiment of the improved algorithm shows that the rotation constraint has certain passive effect on container loading efficiency, however, the final loading efficiency with limited rotation is still satisfied and the operation time is reasonable.
出处
《公路交通科技》
CAS
CSCD
北大核心
2007年第5期135-139,共5页
Journal of Highway and Transportation Research and Development
基金
国家自然科学基金资助项目(60572056
60204006
10372002)
中国科学院海外杰出学者基金资助项目
关键词
运输经济
装箱问题
启发式算法
旋转约束
树搜索
transportation economic
container loading problem
heuristic algorithm
rotation constraint
tree-search
