摘要
多约束条件下的三维装箱问题是一个复杂的组合优化问题 ,属于 NP- HARD问题 ,其求解是很困难的 .所以在实际应用中 ,往往采用一些启发式算法来求解 .本文在考虑一些实际应用中的约束条件下 ,提出了一种三维集装箱装载的启发式算法 .此算法采用了三空间分割、平均高度装载、货物合并、空间合并等策略 ,考虑了方向、重量、优先顺序、货物的配置位置等约束条件 .通过逐步淘汰差的装载方案 ,最后达到满意的装载 .实例仿真说明了该算法的有效性和实用性 ,能够直接用于实际应用中 .
Three dimension packing problem with multi constraints is a complicated combinatorial optimization,and is NP HARD problem. It is difficult to obtain on optimal solution. The Heuristic Method is usually employed in practical applications. Considering multi constraints in applications, a heuristic method for the three dimension packing problem is presented in this paper. The measures of three divided spaces, average high packing, goods combining and spares combining were taken and constraints of orientation, weight, priority, packing place and average packing were considered in the algorithm. Satisfied result is obtained by washing out worse packing. Some cases are used, and it is shown that the algorithm is effective and practical, and can be directly used in applications.
出处
《信息与控制》
CSCD
北大核心
2002年第4期353-356,共4页
Information and Control
基金
国家 973重点基础研究发展资助项目 (G19980 3 0 415 )
