提出有角件约束的集装箱配载问题,给出角件及空间的定义,基于空间切割及“试空间”方法,设计了一种有效规避角件的算法。进一步引入“货物块”概念,并给出货物的排序方法,结合装载空间选择,最终提出一种高效的搜索式启发式算法。通过随机算例计算分析及3D结果显示,说明该算法能够有效规避角件,且空间利用率较高。 The problem of container loading with corner constraint is presented. The definition of corner element and space is given. Based on the method of space cutting and “test space ”, an algorithm of effective corner avoidance is designed. The concept of “goods block ” is further introduced, and the method of sorting goods is given. Combining with the choice of loading space, an efficient search heuristic algorithm is finally proposed. Through the random case calculation and 3D result display, it shows that the algorithm can effectively avoid corner pieces and has higher space utilization rate.