Ternary tree planning calculation method for solving three-dimensional packing problem

Abstract

The invention provides a ternary tree planning calculation method for solving a three-dimensional packing problem. Based on an existing technology, X, Y and Z axes of a three-dimensional space are converted into three branches of a tree diagram of a ternary tree for study through creative problem solving ideas, and a packing sequence can be naturally formed; the level-wise search can be implemented, and the calculation process can be simplified; and meanwhile, by adopting the scheme, all directional constraint conditions can be taken into account, packed objects of which the front sides, rightsides and upper sides are spaces to be packed can be classified into the category, and a binary tree packing scheme parallel to the height direction can also be classified into the category. The technical scheme of the invention can make up for the problem of 'combination explosion' of multi-constraint conditions of the packing scheme; and compared with an existing packing scheme, the method hasthe following advantages: a ternary tree structure can be formed, and the packing sequence can be naturally formed; the level-wise search can be implemented, and the entire calculation process is simple and effective; through optimization calculations, a complete optimization result can be obtained; and the packing schemes of objects to be packed in different directionality can be proposed.

Description

technical field [0001] The invention belongs to the industrial application field of logistics picking and warehousing, and relates to the best intuitive optimization method for realizing the three-dimensional packing problem under various constraint conditions, especially the maximum loading rate and the minimum remaining space method considering the direction constraint condition. Background technique [0002] As a key technology in the logistics picking process, the packing problem is of great significance to improve the optimization degree of cargo loading, improve the distribution efficiency and standardize the business process. However, at present, many domestic enterprises still rely on manual experience to calculate the packing process. This experience packing process has a low level of informatization and is greatly affected by human factors. The efficiency of the box increases the transportation cost, and it is also not conducive to the advancement of the intelligen...

AI Technical Summary

Problems solved by technology

Moreover, depending on the application field, the constraints and optimization objectives are quite different. At present, most domestic literatures use intelligent algorithms, such as heuristic algorithms, tabu search algorithms, simulated annealing algorithms, genetic algorithms, greedy algorithms, etc., but the bin packing model Generally, the three-dimensional packing problem is transformed into a two-dimensional problem through dimensionality reduction. There are still many problems that only consider the horizontal layout along the height direction, and some that only consider the packing scheme under the directional constraints such as the cargo cannot be turned over. There is no general and intuitive way to solve it, so it is imperative to design a bin packing scheme that can integrate multiple constraints

Images