关键词: 集装箱装入, 空间划分, 应用约束, 空间利用率

Abstract: Container loading is a complicated combinatorial optimization problem in three-dimensional packing. It is a NP-hard problem. Six space partitions are presented and a set of rules for merging spaces is proposed, and stability constraint and load bearing strength are applied in the six space partitions. Through testing a benchmark data set, it compares the influence of application constraint for the space utilization. The results also show the influence of load bearing strength for different space partitions, and which space partition will produce the most of influence, and the testing results also show which space partitioning based on the common-effect of stability constraint and load bearing strength constraints is the best space utilization. Compared to the same domestic research algorithm, the test results show that this algorithm is best than other algorithms at home and abroad at present.

Key words: container loading, space partitioning, application constraint, space utilization