摘要
集装箱配载是一个复杂的组合优化问题 ,属于NP完全问题 ,求解难度大 .在考虑实际应用中的约束条件下 ,采用整体装填、空间分割、装载间隙合并等策略 ,提出了一种基于启发式算法的集装箱配载问题的解决方案 .运用举例和对比分析验证了该算法的有效性 。
Being an NP-Problem, container loading is a complicated combination optimization problem and difficult to work out. Taking the practical limits into consideration, an algorithm is put forward based on heuristic algorithm by means of whole-fill, space-division, and clearance-merges, thus solving the container problem. The instance and parallel analysis verify its validity. It can be directly applied to the loading of containers.
出处
《昆明理工大学学报（理工版）》
CAS
2004年第6期115-117,共3页
Journal of Kunming University of Science and Technology(Natural Science Edition)
关键词
启发式算法
集装箱
配载
heuristic algorithm
container
loading
