Dynamic optimization box stacking method and information data processing terminal

Abstract

The invention belongs to the technical field of logistics, and discloses a dynamic optimization box stacking method and an information data processing terminal. The method comprises the steps that a tray is divided in space, and a gap information table is initialized; box information is placed into a dynamic box queue according to the sequence, and a gap information table Gap-Table is built / updated; an available gap for placing a box is searched for; according to the box size, the Gap-Table is searched for all gaps capable of containing the box, and the gaps are stored into the Gap-Table; thegaps in the Gap-Table are subjected to priority ordering, and a prior sequence is given; box placing positions are subjected to heuristic dynamic programming; and the tray is replaced. In the achieving process, box number and size information incomplete restraint, stacking sequence restraint and stability restraint are ensured, complete supporting is adopted, and therefore it is ensured that wholestacking is kept stable and free of collapsing. The method can adapt to a practical stacking site and ensures the good tray space utilization rate.

Description

technical field [0001] The invention belongs to the technical field of logistics, and in particular relates to a method for dynamically optimizing box palletizing and an information data processing terminal. Background technique [0002] At present, the existing technologies commonly used in the industry are as follows: [0003] In the modern logistics industry, palletizing consumes a lot of manpower, and people have been trying to replace people with robots for this heavy and repetitive work. However, the various existing palletizing methods still have great limitations in the face of actual application scenarios. Most of the existing palletizing methods are developed based on the classic three-dimensional box packing (3D-BP) problem. In the classic three-dimensional box packing problem, the quantity and size information of the boxes to be stacked is fully grasped, and the order of stacking boxes It can be adjusted arbitrarily, and there are no hard constraints on the sup...

AI Technical Summary

Problems solved by technology

[0006] (1) In the existing logistics technology, the box information is incomplete and the stacking order of the boxes cannot be adjusted, while the traditional box palletizing algorithm needs to know the size information of all boxes and can adjust the stacking order of the boxes arbitrarily

This leads to the fact that the traditional palletizing algorithm cannot adapt to the actual palletizing needs

Moreover, due to the uncertainty of the size of the boxes on the conveyor belt, it is very difficult to dynamically plan the stacking position of the boxes;

[0007] (2) In the existing logistics technology, the support and stability of the box cannot be guaranteed. In actual use, if the support and stability cannot be ensured, the robot palletizing will not be able to ensure that it can continue

[0008] The difficulty and significance of solving the above technical problems: In the existing technology, there is no relevant research results on the automatic palletizing method under the condition of incomplete case information and definite case stacking order

However, the traditional 3D-BP method cannot solve the incomplete constraints of box information and the fixed constraints of box stacking order.

Images