基于组合的三维集装箱装入启发式算法的研究  

Research of a Heuristic Algorithm for 3D Container Loading Based on Combination

作　　者：刘嘉敏[1] 马广焜[1] 黄有群[1] 

机构地区：[1]沈阳工业大学信息科学与工程学院,沈阳110023

出　　处：《工程图学学报》2005年第1期22-25,共4页Journal of Engineering Graphics

摘　　要：集装箱装入属于有多种约束的空间资源优化问题。其求解思路可以推广到飞机、轮船的货舱装载,乃至计算机的内存分配等多种应用领域。笔者提出了通过回溯过程实现的组合装入的启发式算法,设计了有效的装入策略,定义了用于装入过程状态描述的剩余空间表示和小剩余空间的结合原则。通过实例验证,能有效提高集装箱空间的利用率。与现有算法比较,具有适合装入物体种类多,尺寸差别大的情况。Container loading belongs to a sort of resource optimal problems with various constraints. The concept behind the problem can be extended to many applying areas, such as cargo loading of airplane and shipment, as well as computer memory allocation. A new combination-based heuristic algorithm is proposed, which combines the items by backtracking procedure. The efficient loading strategy is devised. The representation of remaining space for the description of loading procedure and the principle of integrated small remaining spaces are defined. The computational experiment indicated that the algorithm can enhance the space utilization of the container. Compared with the algorithm published, the algorithm suits the practical applications that there are the variety types and the difference size of the items.

关 键 词：计算机应用 集装箱装入 启发式 算法 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]