三维集装箱装载的改进遗传算法研究 (推荐).pdfVIP

11 1 上 海 电 机 学 院 学 报 Vol. 11 No. 1 2008 3 JOURNAL OF SH ANGH AI DIANJI UNIVERSITY Mar. 2008 1671-2730( 2008) 01-0032-04 1 2 1 许光泞, 陈国初 , 俞金寿 ( 1. 华东理工大学 信息科学与工程学院, 上海200237; 2. 上海电机学院 电气学院, 上海200240) : 集装箱装载是一个复杂的组合优化问 , 约束条件多, 属于多项式复杂程度的非确定性 ( Non-deterministic Polynomail, NP) 完全问 , 求解难度大在考虑 一些实际应用中的约束条件下, 提 出了一种三维集装箱装载的改进遗传算法算法中考虑了货物放置方向装载容积等约束条件, 给出了 有效的解码算法实例仿真结果说明该算法的有效性和实用性, 可以直接在实际中应用 : 集装箱装载; 遗传算法; 空间分割; 优化 : U 169T P 301. 6 : A Research on Improved Genet ic Algorit hm for Three-dimension Container Loading Problem 1 2 1 X U Guang ning , CH EN Guochu , Y U J inshou ( 1. College of Information Science and Engineering, East China U niversity of Science and T echnology, Shanghai 200237, China; 2. School of Electric, Shanghai Dianji U niversity. Shanghai 200240, China) Abstract: Container loading problem w ith mult-i constraints is a complicated combinatorial optimi- zation problem. Its a NP-HARD problem and difficult to obtain an optimal solution. Considering many constraints in practical applications, an improved genetic algorithm for the three-dimension con- tainer loading problem is presented in this paper. In the algorithm, w e take into account the direction in w hich goods are placed and the loading capacity, and propose an effective decoding algorithm . Sim- ulation results show that the proposed algorithm is feasible and effective, and can be directly used in practical applications. Key words: container loading; genetic algorithm; space dividing; optimization , , : 2007- 12-2 : (