[1] Pisinger D. Heuristics for the container loading problem[J]. European Journal of Operational Research, 2002, 141(2): 143-153. [2] Fanslau T, Bortfeldt A. A tree search algorithm for solving the container loading problem[J]. INFORMS Journal on Computing, 2010, 22(2): 222-235 [3] George J A, Robison D F. A heuristic for packing boxes into a container[J]. Computer and Operational Research, 1980, (7): 147-156 [4] Bischoff E E, Ratcliff B S W. Lssues in the development of approaches to container loading[J]. Omega, 1995, 23(4): 377-390 [5] Bischoff E E, Janetz F, Ratcliff B S W. Loading pallets with non-identical items[J]. European Journal of Operational Research, 1995, 84(3): 681-692 [6] Bischoff E E. Three-dimensional packing of items with limited load bearing strength[J]. European Journal of Operational Research, 2004, 168(3): 952-966 [7] Gehring H, Bortfeldt A. A genetic algorithm for solving the container loading problem[J]. International Transactions in Operational Research, 1997, 4(4-5): 401-418 [8] Gehring H, Bortfeldt A. A parallel genetic algorithm for solving the container loading problem[J]. International Transactions in Operational Research, 2002, 9(4): 497-511 [9] Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem[J]. Parallel Computing, 2003, 29(5): 641-662 [10] Mack D, Bortfeldt A, Gehring H. A parallel hybrid local search algorithm for the container loading problem[J]. International Transactions in Operational Research, 2004, 11(5): 511-533 [11] Parreo F, Alvarez Valdes R, Oliveira J F, Tamarit J M. A maximal-space algorithm for the container loading problem[J]. INFORMS Journal on Computing, 2007, 20(3): 412-422 [12] 张德富,彭煜,朱文兴,陈火旺.求解三维装箱问题的混合模拟退火算法[J].计算机学报,2009,32(11):2147-2156 [13] Eley Michael. Solving container loading problems by block arrangements[J]. European Journal Operational Research, 2002, 141(2): 393-409 [14] 靳志宏,兰辉,郭贝贝.基于现实约束的集装箱配载优化及可视化[J].系统工程理论与实践,2010,30(9):1722-1728 [15] 张德富,彭煜,张丽丽.求解三维装箱问题的多层启发式搜索算法[J].计算机学报,2012,35(12):2553-2561. |