| 摘要: |
| 现场集装箱装载问题多为多目标、多约束优化的复杂问题.遗传算法本身的鲁棒性、并行搜索性以及在NP完全问题求解中的广泛应用,表明遗传算法是解决复杂集装箱装载问题的有效途径.探讨了遗传算法在求解这一复杂问题过程中的应用,给出了有效的编码形式和解码运算.算例求解结果显示出很好的效果. |
| 关键词: 集装箱装载问题 布局 遗传算法 NP完全问题 启发式规则 多目标优化 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69974002) |
|
| Research on Solution to Complex Container-Loading Problem Based on Genetic Algorithm |
|
HE Da yong,ZHA Jian zhong,JIANG Yi dong
|
| Abstract: |
| The container-loading problem occurring in on-the-spot freight production is often with several constraints and objectives, i.e., complex container-loading problem. The robustness, parallelism, and a variety of applications in the solution of NP complete problem of genetic algorithm demonstrate genetic algorithm is an effective approach to solve complex container loading problem. In this paper, the genetic algorithm for complex container-loading problem is studied, the effective coding and decoding method is given. The numerical solution of example shows that the algorithm is effective. |
| Key words: container loading problem packing genetic algorithm nondeterministic polynomial complete problem heuristic rule multi object optimization |
