计算机工程与应用2013，Vol.49Issue(1)：231-233,257,4.DOI:10.3778/j.issn.1002-8331.1106-0511
大规模集装箱装载问题
Large-scale container loading problem
摘要
Abstract
For large-scale three-dimensional packing problem, in use of the basic idea of domain decomposition method, the huge complex problems by packing the goods are re-divided into a number of small regional issues, and then merge those together, the whole region solution will come out. This method can decompose large problems into small issues, complex regional problems into simple regional issues. In base of traditional evolutionary algorithm, simulated annealing generating new individual ideas is introduced to improve it, raising the efficiency of the algorithm and the effectiveness of solution. Through the test of a number of cases of a certain port, the results prove that this method can meet the actual load demand.关键词
区域分裂法/货物重组/演化算法Key words
domain decomposition method/ goods reorganization/ evolutionary algorithm分类
数理科学引用本文复制引用
吴楚楠,刘科峰,彭斯俊,黄樟灿..大规模集装箱装载问题[J].计算机工程与应用,2013,49(1):231-233,257,4.基金项目
国家自然科学基金(No.30570611). （No.30570611）
