摘要
文中提出了一个高效求解三维装箱问题的多层启发式搜索算法.该算法基于块装载的思想,按照块选择算法确定每个阶段采用的块,然后以一种固定的装载方式装载块,直到无法继续装载.文中的主要贡献在于发展了一个有效的复合块生成算法,特别的,提出了基于多层搜索的块选择算法,该算法用多层搜索来评价可行块,然后选择最合适的块进行装载.对1500个三维装箱问题测试数据的计算结果表明,提出的算法几乎在所有测试数据上的填充率都超过了目前已知的优秀算法.
This paper presents an efficient multi-layer heuristic search algorithm for three-dimen- sional container loading problem. This algorithm loads one block, which is determined by block selection algorithm, in one packing phase according to a fixed strategy until no blocks are availa- ble. Two algorithms are developed, one is used to efficiently generate complex block, another is block selection algorithm based on multi-layer seareh that is used to evaluate the blocks so that the appropriate block is selected. Computational results on 1500 test data of three-dimensional container problem show that the proposed algorithm outperforms the best known algorithm in almost all the test data.
出处
《计算机学报》
EI
CSCD
北大核心
2012年第12期2553-2561,共9页
Chinese Journal of Computers
基金
国家自然科学基金(61272003)资助~~
关键词
三维装箱问题
启发式算法
深度优先搜索
three-dimensional container loading problem
heuristic algorithm
depth-first search