关键词: 综合运输, 三维装箱, 支撑面, 装载空间, 装载策略

Abstract:

Dealing with the three- dimensional bin packing problem (3D- BP), most of the existing algorithms ignore the support constraint. A loading space with support surface is presented to solve3D-BP with support constraint, and a method is proposed to decide whether or not the overlapping exists between two boxes and the algorithm to update the loading space. Computational efforts between different loading strategies and sorting methods are compared, according to whether goods can be rotated or not. The loading effect corresponding to different loading coefficient,0.6, 0.75, 0.9and1.0, respectively, are computed by the optimal strategy. Finally, the optimization result considering fragility is given. The experiment demonstrates that the loading space with support surface is superior to key point strategy, which has great significance for practical application and further research.

Key words: integrated transportation, three-dimensional bin packing, support surface, loading space, loading strategy