单一货物摆放无约束三维装箱优化方法

Optimization of Packing Method for Single Goods Unconstrained Three-dimensional Packing

物流装箱环节效率低是成本高居不下的主要因素之一。传统的简便装箱解法可提高装箱效率,且简便、易于掌握,但优化程度略低。它对最底层的两种组合只是按两种简单摆放方式摆放货物,以此作为基础数据,再对货箱三个维度分别规划求解,从而给出较优装箱方案。本文提出单一货物摆放无约束三维优化装箱解法,虽比前者复杂些,但可进一步提高装箱优化程度。它先对最底层的两种组合分别线性规划求解,然后在二者中择优,在此基础上再对货箱三个维度分别规划求解,得出优化装箱方案。

The low efficiency of logistics packing link is one of the main factors for the high cost.The traditional simple bin packing method has the advantage of simple and easy operation and also improves the efficiency of packing, but its optimization is lower. In order to make it easier, the method introduced could be the two combinations of the lowest level only by placing goods in two simple ways, using the data as the basis, the three dimensions of the box are programmed for combinatorial optimization, thus a better packing scheme is made. In this paper, a three dimensional optimization method for unconstrained optimization of single goods is proposed. Although it is more complex than the former, it can further improve the optimization of bin packing. It is that two kinds of the combination of the lowest level do the linear programming, then choose the better one,use the data as the basis, the three dimensions of the box are programmed for combinatorial optimization, hence an optimized packing method.