An Optimized Intelligent Packing System

Abstract

The invention provides an optimized intelligent packing system, which includes: a data receiving module; a hierarchical module, which calculates the probability of occurrence of each single dimension of each cargo to be loaded, and selects the first several single dimensions from large to small probabilities. , and represented by S1, and then the unfilled three-dimensional space in the container is layered according to its single-dimensional direction, so that the single dimension of each layer of three-dimensional space along the corresponding layering direction is one of S1; the striping module calculates The three-dimensional space of each layer is suitable for the probability that the other two single dimensions other than the largest single dimension appear in the goods to be loaded. At the same time, select the first several single dimensions from large to small probabilities, represented by S2, and then each The layer three-dimensional space is divided into two single-dimensional directions other than the layering direction, and the single dimension of each two-dimensional space along the corresponding striping direction is one of S2; and a single boxing module. The present invention can reduce the time spent in layering and striping operations and increase the diversity of packing solutions.

Description

technical field [0001] The invention belongs to the field of packing in the logistics industry, and in particular relates to an optimized intelligent packing system. Background technique [0002] Three-dimensional packing is a problem often encountered in industrial production. In the process of cargo loading and transportation, the efficient use of resources and transportation space is the core competitiveness of companies. Therefore, due to its practical needs, seeking a reasonable and effective placement strategy is still an important direction of research. [0003] In the existing technology, the most widely used is the classic container packing model, which can be simply described as ensuring that all the goods loaded into the container do not overlap in space, so that the volume ratio of the container is maximized. The specific mathematical model is as follows : [0004] Suppose the width, length, and height of the container are W, L, and H respectively, the set of g...

AI Technical Summary

Problems solved by technology

However, the traditional wall-building algorithm uses a fixed-branch search algorithm in layering and striping. The length of each layer and the height of each strip are randomly selected from all the single dimensions of the goods to be loaded. The number of branch widths, if the size of all the goods to be loaded is small, the branches of the search tree will be very large, so that the layering and segmentation operations will take too much computing time; moreover, the algorithm is only used in the three-dimensional space of the container Layering in one direction makes binning solutions less diverse

[0022] In addition, the boxing software currently on the market still requires users to manually edit and export the data to excel. The stand-alone version of the boxing software system does not provide advanced services and needs to charge corresponding copyright fees, while the server version of the boxing software can satisfy users. Advanced requirements, strong computing power, but require users to pay a high cost of purchasing servers

To sum up, regardless of the amount of business, users need to pay extra fees, which will cause economic losses to users; on the other hand, the algorithm used in the software is not optimal and cannot achieve the highest work efficiency, which further expands the user loss

Images