| 三维集装箱装载的改进遗传算法研究 |
| |
| 引用本文： | 许光泞,陈国初,俞金寿.三维集装箱装载的改进遗传算法研究[J].上海电机学院学报,2008,11(1):32-36. |
| |
| 作者姓名： | 许光泞 陈国初 俞金寿 |
| |
| 作者单位： | 1. 华东理工大学信息科学与工程学院,上海,200237
2. 上海电机学院,电气学院,上海,200240 |
| |
| 摘 要： | 集装箱装载是一个复杂的组合优化问题，约束条件多，属于多项式复杂程度的非确定性（Non-deterministic Polynomail，NP）完全问题，求解难度大。在考虑一些实际应用中的约束条件下，提出了一种三维集装箱装载的改进遗传算法。算法中考虑了货物放置方向、装载容积等约束条件，给出了有效的解码算法。实例仿真结果说明该算法的有效性和实用性，可以直接在实际中应用。
|
| 关 键 词： | 集装箱装载 遗传算法 空间分割 优化 |
| 文章编号： | 1671-2730(2008)01-0032-04 |
| 修稿时间： | 2007年12月25 |
Research on Improved Genetic Algorithm for Three-dimension Container Loading Problem |
| |
| XU Guangning,CHEN Guochu,YU Jinshou.Research on Improved Genetic Algorithm for Three-dimension Container Loading Problem[J].JOurnal of Shanghai Dianji University,2008,11(1):32-36. |
| |
| Authors: | XU Guangning CHEN Guochu YU Jinshou |
| |
| Affiliation: | XUG-uangning, CHEN G-uochu, YU Jinshou (1. College of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China; 2. School of Electric, Shanghai Dianji University. Shanghai 200240, China) |
| |
| Abstract: | Container loading problem with multi-constraints is a complicated combinatorial optimi- zation problem. It＇s 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 container loading problem is presented in this paper. In the algorithm, we take into account the direction in which goods are placed and the loading capacity, and propose an effective decoding algorithm. Simulation results show that the proposed algorithm is feasible and effective, and can be directly used in practical applications. |
| |
| Keywords: | container loading genetic algorithm space dividing optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
