关键词: 三维装箱, 混合遗传算法, 偏随机密钥, 启发式算法, 重心平衡

Abstract: The three-Dimensional Container Loading Problem（3DCLP） with practice constrains is a complex combinatorial optimization problem and has the typical characters of NP-hard. As to the tendency of convergence into local optimization of the basic Genetic Algorithm（GA）, the paper puts forward a method to optimize the loading sequence based on the biased random-key GA. Then the optimal layout to the boxes can be determined using a heuristic based on extreme-points approach. And the balance of the whole loading gravity center can be improved by the moving of parts of items lastly. The instance demonstrates that the algorithm can generate the optimizing packing plan quickly, in which the available capacity of the vehicle is utilized well and the requirements for the transportation safely are met.

Key words: three-Dimensional Container Loading Problem（3DCLP）, hybrid genetic algorithm, biased random-key, heuristic algorithm, balancing constraints