CAJ | 학술논문

在三维装箱问题中，集装箱问题是一个复杂的组合优化问题，是属于NP-hard问题。提出了六种空间划分和不同规则的空间合并，并将稳定性约束和承载力约束加入其中，通过测试标准数据集去比较应用约束对空间利用率的影响。测试结果显示了承载力约束对不同的空间划分的影响，以及对哪一种空间划分的影响最大，以及在基于稳定性约束和承载力约束的共同作用下，哪一种空间划分的空间利用率最好。同时，与国内外相同研究方向的算法进行了对比，测试结果显示了该算法的性能要高于目前国内外的算法。
재삼유장상문제중，집장상문제시일개복잡적조합우화문제，시속우NP-hard문제。제출료륙충공간화분화불동규칙적공간합병，병장은정성약속화승재력약속가입기중，통과측시표준수거집거비교응용약속대공간이용솔적영향。측시결과현시료승재력약속대불동적공간화분적영향，이급대나일충공간화분적영향최대，이급재기우은정성약속화승재력약속적공동작용하，나일충공간화분적공간이용솔최호。동시，여국내외상동연구방향적산법진행료대비，측시결과현시료해산법적성능요고우목전국내외적산법。
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.