期刊文献+

大规模集装箱装载问题 被引量:1

Large-scale container loading problem
下载PDF
导出
摘要 对于大规模三维装箱问题,利用区域分裂法的基本思想,将复杂的大规模装箱问题通过货物的重组分解为若干个小区域上的问题,然后通过合并小区域之间的解得到整个区域的解。该方法能分解大型问题为小型问题,复杂区域问题为简单区域问题。在传统演化算法的基础上,引入了模拟退火产生新个体思想对其进行改进,提高了算法的运行效率和解的有效性。通过对某港口案例进行测试,结果证实该算法能满足实际装载需求。 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.
出处 《计算机工程与应用》 CSCD 2013年第1期231-233,257,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.30570611)
关键词 区域分裂法 货物重组 演化算法 domain decomposition method goods reorganization evolutionary algorithm
  • 相关文献

参考文献14

  • 1Bortfeldt A.A genetic algorithm for the container loading pro- blem[C]//Proceedings of the Conference on Industrial Auto- mation Singapore, 1994 : 115-126.
  • 2George J A,Robinson D F.A heuristic for packing boxes into a container loading problem[J].International Transactions on Operational Research, 1980,7(3) : 147-156.
  • 3Morabito R,Arenales M.An AND/OR-graph approach to the container loading problem[J].International Transactions on Operational Research, 1994( 1 ) :59-73.
  • 4Lim A, Rodrigues B, Yang Y.32D container packing heuris- tics[J].Applied Intelligence,2005,22(2) : 125-134.
  • 5Moura A,Oliveira J F.A GRASP approach to the container- loading problem[J].IEEE Intelligent Systems, 2005, 20(4): 50-57.
  • 6Bischoff E E.Three-dimensional packing of items with limited load bearing strength[J].European Journal of Operational Research, 2006, 168 ( 3 ) : 952-966.
  • 7Wang Z, Li K W, Levy J K.A heuristic for the container loading problem: a tertiary-tree-based dynamic space decomposition approach[J].European Journal of Operations Research, 2008, 191:86-89.
  • 8Eley M.Solving container loading problems by block arrange- ment[J].European Journal of Operational Research,2002, 141: 393-409.
  • 9Gehring H, Bortfeldt A.A genetic algorithm for solving the container loading problem[J].International Transactions on Operational Research, 1994(4) :401-418.
  • 10Gehfing H, Bortfeldt A.A parallel genetic algorithm for solving the container loading problem[J].Intemational Transactions on Operational Research, 2002,9(4) :497-511.

同被引文献15

  • 1陈建岭.集装箱装载问题的启发式优化算法[J].山东交通学院学报,2005,13(3):53-56. 被引量:6
  • 2JohnsonDS.计算机和难解性-NP完全性理论导论[M].张立昂译.北京:科学邮版社,1990:134-145.
  • 3张德富,魏丽军,陈青山,陈火旺.三维装箱问题的组合启发式算法[J].软件学报,2007,18(9):2083-2089. 被引量:50
  • 4庄凤庭,张磊,张春鲜,高尚.基于蚁群算法的集装箱装载问题[J].江南大学学报(自然科学版),2007,6(6):795-799. 被引量:8
  • 5Guntram Scheithauer. Algorithms for the Container Loading Problem[J]. Operations Research Proceedings, 1992,1991:445-452.
  • 6Ngoi BKA, Tay ML, Chua ES. Applying spatial representation techniques to the container packing problem[J].International Journal of Production Research, 1994,32(1):111-123.
  • 7Bisehoff E E, Ratcliff B S W. Issues in the development of approaches to container loading[J]. Omega, 1995,23(4):377-390.
  • 8Gehring H, Bortfeldt A. A genetic algorithm for solving the container loading problem[J]. International Transactions inOperational Research, 1997,4(5-6):401-418.
  • 9Bortfeldt A, Gehring H. A hybrid genetic algorithm for the container loading problem[J]. European Journal ofOperational Research, 2001,13l(1):143-161.
  • 10Moura A, Oliveira J F. A GRASP approach to the container loading problem[J]. IEEE Intelligent, 2005,20(4):50-57.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部