三维装箱布局的单向寻优搜索法

One-way Optimum Searching Algorithm for 3D Container Packing Problem

研究待布局物体组合时面的各种拼合形式,以及待布局物体与待布局空间之间的各种间隙及其组合形式,形成单向寻优搜索法,使每一个待布局物体均充分地向小于等于自身的物体排序方向搜索适合组合的物体,形成二叉树组合结构,不仅显著提高了装箱率,也直观给出装箱顺序,还有效避免了NP完全问题。

After researching on the various forms of putting two planes together in the object-groups, and various openings as well as opening-groups between the object and 3D space, One-way optimum searching algorithm is provided for 3D packing. For each object, the algorithm can fully search appropriate objects or object-groups along the direction of objects＇ permutation by the volume decreasingly and form a binary tree structure. The algorithm not only increases the ratio of 3D packing but also directly gives the order of packed objects, and avoids NP-hard problem effectively.