关键词: 集装箱装载, DNA遗传算法, 空间分解, 优化

Abstract: Container loading problem with multi-constraints is a complicated combinatorial optimization problem.It’s a NP-hard problem and difficult to obtain an optimal solution.Considering orientation and stability constraint，a DNA-based genetic algorithm for the three-dimension container loading problem is presented in this paper.In the algorithm，the authors take into account the direction in which goods are placed and the loading capacity，and propose an effective encoding algorithm.Simulation results show that the proposed algorithm is feasible and effective，and can be directly used in practical applications.It is of some significance to promote DNA computation application in NP-complete problem.

Key words: container loading, DNA-based genetic algorithm, space decomposition, optimization