CN113570176B

CN113570176B - Cargo packing scheme output method, device, computer equipment and storage medium

Info

Publication number: CN113570176B
Application number: CN202010350085.1A
Authority: CN
Inventors: 苗魁; 吕祥东; 易文斌; 裴艳林; 黄一潇; 穆聪山
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd
Priority date: 2020-04-28
Filing date: 2020-04-28
Publication date: 2024-03-26
Anticipated expiration: 2040-04-28
Also published as: CN113570176A

Abstract

The application relates to a cargo boxing scheme output method, a cargo boxing scheme output device, computer equipment and a storage medium. The method comprises the following steps: acquiring a first packing order of the packing boxes and a second packing order of the goods to be packed, and acquiring a current leaf node packing box according to the first packing order; carrying out mixed placement point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain goods to be packaged corresponding to the current leaf node packaging box; adjusting the second packaging sequence according to the goods to be packaged corresponding to the current leaf node packaging box to obtain a new second packaging sequence; and obtaining the target cargo packing scheme according to the new second packing sequence. By adopting the method, the space of the packaging box can be saved.

Description

Cargo packing scheme output method, device, computer equipment and storage medium

Technical Field

The present disclosure relates to the field of logistics technologies, and in particular, to a cargo packing scheme output method, apparatus, computer device, and storage medium.

Background

With the development of logistics technology, a cargo boxing scheme output technology appears, wherein the cargo boxing scheme output technology refers to the cargo boxing simulation by combining different service indexes of a service to obtain a cargo boxing scheme.

In the conventional technology, when the cargo boxing scheme is output, a user usually checks parameter information of cargoes to be boxed and a packing box, according to service indexes and the parameter information, the packing box corresponding to the cargoes to be boxed is selected on a computer, and the computer responds to the packing box selected by the user to output the cargo boxing scheme in a simulated boxing mode.

However, in the conventional method, since the computer needs to interact with the person many times when outputting the cargo boxing scheme, the user is too dependent on personal experience, so that the user can select a obviously oversized packing box in order to ensure that the packing box can be used for boxing the cargo, an accurate boxing decision may not be made, and the problem of wasting the space of the packing box exists.

Disclosure of Invention

In view of the foregoing, it is desirable to provide a cargo boxing scheme output method, apparatus, computer device, and storage medium that can save the space of a packaging box.

A cargo boxing scheme output method, the method comprising:

acquiring a first packing order of the packing boxes and a second packing order of the goods to be packed, and acquiring a current leaf node packing box according to the first packing order;

carrying out mixed placement point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain goods to be packaged corresponding to the current leaf node packaging box;

Adjusting the second packaging sequence according to the goods to be packaged corresponding to the current leaf node packaging box to obtain a new second packaging sequence;

when the new second packaging order is not an empty set, carrying out branch extension on the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box, updating the current leaf node packaging box according to the next-stage leaf node packaging box, and returning to the step of carrying out mixed placement point search on the current leaf node packaging box according to the second packaging order;

when the new second packing sequence is empty, a current cargo packing scheme is obtained according to the cargoes to be packed corresponding to the current leaf node packing box, a cargo packing scheme to be compared is obtained according to all levels of leaf nodes and the first packing sequence in the current cargo packing scheme, and the current cargo packing scheme and the cargo packing scheme to be compared are compared according to preset target index information, so that a target cargo packing scheme is obtained.

In one embodiment, obtaining a first packaging order of the package and a second packaging order of the goods to be packaged, obtaining the current leaf node package according to the first packaging order includes:

acquiring the first packing sequence of the packing box and the parameter information of the goods to be packed;

Obtaining a current leaf node packing box according to the first packing order, and determining the bottom surface of the goods to be packed according to the parameter information;

and sorting the goods to be packaged according to the bottom area of the bottom surface of the goods to be packaged, so as to obtain a second packaging sequence of the goods to be packaged.

In one embodiment, performing mixed placement point search on the current leaf node packaging box according to the second packaging order and the preset detection constraint information to obtain the to-be-packaged goods corresponding to the current leaf node packaging box includes:

obtaining an initial mixed placement point of a current leaf node packing box, and obtaining current goods to be packed according to a second packing order;

simulating and placing the current goods to be packaged according to the initial mixed placing points to obtain information to be detected;

performing constraint detection on the current goods to be packaged according to preset detection constraint information and information to be detected to obtain a constraint detection result;

obtaining the attribution result of the current goods to be packaged according to the constraint detection result, updating the initial mixed placement point according to the attribution result, and obtaining the goods to be packaged in the next order corresponding to the current goods to be packaged according to the second packaging order;

obtaining new current goods to be packaged according to the next sequential goods to be packaged;

And returning to the step of carrying out simulated placement on the current goods to be packaged according to the initial mixed placement point to obtain the information to be detected until the corresponding next order goods to be packaged do not exist in the current goods to be packaged, and obtaining the goods to be packaged corresponding to the current leaf node packaging box.

In one embodiment, performing simulated placement on the current goods to be packaged according to the initial mixed placement point, and obtaining the information to be detected includes:

performing simulated placement on the current goods to be packaged according to the initial mixed placement points to obtain the weight to be detected of the current leaf node packaging box, and obtaining the area of the supporting goods corresponding to the current goods to be packaged according to the preset neighbor relation information;

and obtaining a to-be-detected supporting area ratio according to the area of the to-be-packaged goods and the bottom area of the current to-be-packaged goods, and performing collision detection on the current to-be-packaged goods to obtain a collision detection result.

In one embodiment, obtaining an attribution result of the current goods to be packaged according to the constraint detection result, and updating the initial mixed placement point according to the attribution result includes:

when the constraint detection result is that the current to-be-packaged goods passes, classifying the current to-be-packaged goods into to-be-packaged goods corresponding to the current leaf node packaging box, and acquiring parameter information of the current to-be-packaged goods;

And updating the initial mixed placement point according to the parameter information of the current goods to be packaged.

when the constraint detection result is that the object to be detected does not pass, carrying out posture adjustment on the current object to be packaged, and carrying out simulated placement on the current object to be packaged after the posture adjustment according to the initial mixed placement point to obtain the object to be detected information;

performing secondary constraint detection on the current goods to be packaged after the posture adjustment according to preset detection constraint information and target information to be detected to obtain a secondary constraint detection result;

when the secondary constraint detection result is that the current to-be-packaged goods passes, classifying the current to-be-packaged goods into to-be-packaged goods corresponding to the current leaf node packaging box, and acquiring parameter information of the current to-be-packaged goods;

In one embodiment, obtaining a cargo to be compared packing scheme according to each level of leaf nodes and a first packing order in a current cargo packing scheme, comparing the current cargo packing scheme with the cargo to be compared packing scheme according to preset target index information, and obtaining the target cargo packing scheme includes:

Obtaining leaf nodes to be compared corresponding to each stage of leaf nodes according to each stage of leaf nodes and a first packing order in a current cargo packing scheme;

obtaining a cargo boxing scheme to be compared according to the leaf nodes to be compared and the current cargo boxing scheme;

and comparing the current cargo boxing scheme with the cargo boxing scheme to be compared according to preset target index information to obtain a target cargo boxing scheme.

A cargo boxing scheme output device, the device comprising:

the acquisition module is used for acquiring a first packing order of the packing boxes and a second packing order of the goods to be packed, and acquiring the current leaf node packing boxes according to the first packing order;

the searching module is used for carrying out mixed placement point searching on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain a to-be-packaged cargo corresponding to the current leaf node packaging box;

the adjusting module is used for adjusting the second packaging sequence according to the goods to be packaged corresponding to the current leaf node packaging box to obtain a new second packaging sequence;

the first processing module is used for branching and extending the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box when the new second packaging order is not an empty set, updating the current leaf node packaging box according to the next-stage leaf node packaging box, and returning to the step of searching the mixed placement points of the current leaf node packaging box according to the second packaging order;

And the second processing module is used for obtaining a current cargo boxing scheme according to the to-be-packaged cargos corresponding to the current leaf node packaging box when the new second packaging sequence is empty, obtaining a to-be-compared cargo boxing scheme according to all levels of leaf nodes and the first packaging sequence in the current cargo boxing scheme, comparing the current cargo boxing scheme with the to-be-compared cargo boxing scheme according to preset target index information, and obtaining a target cargo boxing scheme.

A computer device comprising a memory storing a computer program and a processor which when executing the computer program performs the steps of:

A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:

According to the cargo packing case scheme output method, the cargo packing case scheme output device, the computer equipment and the storage medium, after the first packing order and the second packing order are obtained, the current leaf node packing case is obtained according to the first packing order, mixed placement point searching is carried out on the current leaf node packing case according to the second packing order and preset detection constraint information, the cargo to be packed corresponding to the current leaf node packing case is obtained, boxing analysis of the leaf node packing case can be achieved through the preset detection constraint information, full utilization of the leaf node packing case is achieved on the basis of independent personal experience, after the second packing order is adjusted, after the new second packing order is obtained, when the new second packing order is not an empty set, branch extension is carried out on the current leaf node packing case, the next leaf node packing case is obtained, mixed placement point searching is continued according to the next leaf node packing case, when the new second packing order is an empty set, the cargo to be packed corresponding to the current leaf node packing case scheme is obtained according to the cargo to be packed, the cargo to be packed in the current leaf node packing case scheme is compared with the first packing case scheme, the cargo to be packed in the current packing case can be compared with the target cargo case according to the preset packing scheme, the cargo case can be fully matched with the target cargo case, and the cargo case can be fully achieved, and the cargo case can be compared with the target cargo case.

Drawings

FIG. 1 is a flow chart of a cargo boxing scheme output method in one embodiment;

FIG. 2 is a schematic diagram of a cargo-packing solution output method in one embodiment;

FIG. 3 is a schematic diagram of another embodiment of a cargo-packing solution output method;

FIG. 4 is a schematic diagram of a cargo-packing solution output method in yet another embodiment;

FIG. 5 is a schematic diagram of a method of outputting a cargo boxing scheme in yet another embodiment;

FIG. 6 is a schematic diagram of a cargo box packing solution output method in yet another embodiment;

FIG. 7 is a schematic diagram of a method of outputting a cargo boxing scheme in yet another embodiment;

FIG. 8 is a block diagram of a cargo-packing solution output device in one embodiment;

fig. 9 is an internal structural diagram of a computer device in one embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.

In one embodiment, as shown in fig. 1, a cargo packing scheme output method is provided, where the method is applied to a terminal to illustrate the cargo packing scheme output method, it is understood that the method may also be applied to a server, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the steps of:

And 102, acquiring a first packing order of the packing boxes and a second packing order of the goods to be packed, and obtaining the current leaf node packing boxes according to the first packing order.

Wherein, the packing box refers to a box for packing goods. The first packaging sequence refers to the selected sequence of the various types of packaging boxes. For example, when there are A, B, C types of packing boxes available for selection, the first packing order is the selected order of the three packing boxes, and the terminal selects the packing boxes according to the selected order. The goods to be packaged refer to goods for which the package box is not determined yet. The second packing sequence refers to the packing sequence of the goods to be packed, and the terminal can sequentially simulate the packing of the goods to be packed according to the second packing sequence. The current leaf node package box refers to a package box selected according to a first package order. For example, when there are A, B, C types of packing boxes available for selection for the first time, and the first packing order is A, B, C, the current leaf node packing box obtained according to the first packing order is a.

Specifically, the terminal can acquire a first packaging sequence of the packaging box and parameter information of the goods to be packaged, which are preset by a user, acquire a second packaging sequence of the goods to be packaged according to the parameter information of the goods to be packaged, and acquire the current leaf node packaging box according to the first packaging sequence.

And 104, carrying out mixed placement point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain the goods to be packaged corresponding to the current leaf node packaging box.

Wherein the mixed placement points include corner points and corner mapping points. The corner points refer to contact points of the to-be-packaged goods, the current leaf node packaging box and the to-be-packaged goods which are placed in a simulated mode, and the corner mapping points refer to points of the to-be-packaged goods, which are placed in a simulated mode, on the to-be-packaged goods and the current leaf node packaging box. For example, as shown in fig. 2, 202 is the current to-be-packaged goods, three points of contact between the current to-be-packaged goods and the current leaf node packaging box and the to-be-packaged goods which are simulated to be placed are A, B, C points, namely corner points, in the upper right diagram, it can be seen that the point of the corner point A mapped on the to-be-packaged goods which are simulated to be placed is D, the point of the corner point B mapped on the to-be-packaged goods which are simulated to be placed is E (because the size of the current to-be-packaged goods is smaller than that of the contacted to-be-packaged goods) and the point of the corner point C mapped on the current leaf node packaging box is F, and then the point D, E, F is the corner mapping point. The goods to be packed corresponding to the current leaf node packing box refers to the goods to be packed into the current leaf node packing box. The lower left and right diagrams in fig. 2 are illustrations of placement with corner points and placement with corner map points, respectively, for the same good, and as can be seen in fig. 2, placement with corner map points is more space efficient than placement with corner points.

The preset detection constraint information is preset detection constraint conditions and is used for detecting whether goods to be packaged can be placed in the current leaf node packaging box or not. The detection constraint may specifically be one constraint or a combination of several constraints among a maximum weight constraint, a support area constraint, a collision constraint, and an attitude constraint, for example. The maximum weight constraint is the maximum weight constraint bearable by the current leaf node packaging box, and the supporting area constraint is used for judging whether the goods to be packaged can be supported if placed in the current leaf node packaging box, namely calculating the supporting area ratio of the bottom area of the goods to be packaged to the bottom area of the goods supporting the goods to be packaged, and carrying out constraint detection by comparing the supporting area ratio with a supporting area ratio threshold. The collision constraint is used for detecting whether the goods to be packaged are placed in the current leaf node packaging box or not and collide with the goods placed in the current leaf node packaging box. The gesture constraint refers to detecting whether the to-be-placed gesture of the to-be-packaged goods is the same as the specified placement gesture when the to-be-packaged goods have the specified placement gesture.

Specifically, the terminal determines the current to-be-packaged goods according to the second packaging order, performs simulated placement on the current to-be-packaged goods, judges whether the current to-be-packaged goods can be placed in the current leaf node packaging box according to preset detection constraint information, acquires the next-order to-be-packaged goods corresponding to the current to-be-packaged goods according to the second packaging order, uses the next-order to-be-packaged goods as new current to-be-packaged goods, continues to perform simulated placement on the new current to-be-packaged goods, judges whether the new current to-be-packaged goods can be placed in the current leaf node packaging box according to the preset detection constraint information, and knows that the corresponding next-order to-be-packaged goods do not exist in the current to-be-packaged goods (namely, all to-be-packaged goods in the second packaging order have been tried to be simulated placement), so as to obtain the to-be-packaged goods corresponding to the current leaf node packaging box.

Specifically, when performing mixed placement point search on the current leaf node packaging box, the terminal performs corner mapping point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain a part of goods to be packaged corresponding to the current leaf node packaging box, performs corner point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain the rest goods to be packaged corresponding to the current leaf node packaging box, and synthesizes the corner mapping point search and the corner point search results to obtain all goods to be packaged corresponding to the current leaf node packaging box.

And step 106, adjusting the second packaging sequence according to the goods to be packaged corresponding to the current leaf node packaging box, and obtaining a new second packaging sequence.

Specifically, the terminal adjusts the second packaging sequence according to the to-be-packaged goods corresponding to the current leaf node packaging box, deletes the to-be-packaged goods corresponding to the current leaf node packaging box from the second packaging sequence, and obtains a new second packaging sequence.

And step 108, when the new second packaging order is not the empty set, branching and extending the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box, updating the current leaf node packaging box according to the next-stage leaf node packaging box, and returning to the step of carrying out mixed placement point search on the current leaf node packaging box according to the second packaging order to obtain the goods to be packaged corresponding to the current leaf node packaging box.

Wherein the new second packing order is not empty, which means that the to-be-packed goods of the undetermined leaf node packing box still exist. The next-stage leaf node packaging box is a leaf node packaging box obtained after branching and extending the current leaf node packaging box according to the first packaging sequence. For example, when there are A, B, C three types of packing boxes available for selection, and the first packing order is A, B, C, the current leaf node packing box obtained according to the first packing order is a, and the next-stage leaf node packing box obtained after branching and extending the current leaf node packing box is also a.

Specifically, after the new packaging order is obtained, the terminal firstly judges whether the new second packaging order is an empty set, when the new second packaging order is not the empty set, the terminal indicates that the to-be-packaged goods of the leaf node packaging boxes still exist, at the moment, the terminal can branch and extend the current leaf node packaging boxes according to the first packaging order to obtain next-stage leaf node packaging boxes, the next-stage leaf node packaging boxes serve as the new current leaf node packaging boxes, and the step of searching the mixed placement points of the current leaf node packaging boxes according to the second packaging order and preset detection constraint information is returned to process the to-be-packaged goods in the second packaging order.

And 110, when the new second packing sequence is empty, obtaining a current cargo packing scheme according to the cargoes to be packed corresponding to the current leaf node packing box, obtaining a cargo packing scheme to be compared according to each level of leaf nodes and the first packing sequence in the current cargo packing scheme, and comparing the current cargo packing scheme with the cargo packing scheme to be compared according to preset target index information to obtain a target cargo packing scheme.

Wherein the second packaging order being empty indicates that all of the goods to be packaged have determined the corresponding leaf node package boxes. The current cargo boxing scheme refers to the corresponding relationship between the packing box and the to-be-packed cargo obtained according to the to-be-packed cargo corresponding to the current leaf node packing box. The leaf nodes at all levels refer to leaf node packaging boxes at all levels in the current cargo packing scheme. The cargo boxing scheme to be compared refers to a cargo boxing scheme which is obtained according to each stage of leaf nodes and the first packaging sequence and is different from the current cargo boxing scheme. The preset target index information refers to index information determined according to service requirements. For example, the preset target index information may specifically be the cost of the package. For another example, the preset target index information may specifically be the number of packaging boxes. For another example, the preset target index information may specifically be a remaining volume of the package. For another example, the preset target index information may specifically be loading efficiency. The target cargo boxing scheme refers to a final cargo boxing scheme obtained after comparing the current cargo boxing scheme with the cargo boxing scheme to be compared according to preset target index information.

Specifically, when the new second packaging sequence is empty, the terminal obtains a current cargo packaging scheme according to the to-be-packaged cargo corresponding to the current leaf node packaging box, performs box type search according to each level of leaf nodes and the first packaging sequence in the current cargo packaging scheme to obtain a to-be-compared cargo packaging scheme, and compares the current cargo packaging scheme with the to-be-compared cargo packaging scheme according to preset target index information to obtain a target cargo packaging scheme.

The cargo packing box proposal output method obtains the current leaf node packing box according to the first packing order after obtaining the first packing order and the second packing order, carries out mixed placement point search on the current leaf node packing box according to the second packing order and preset detection constraint information to obtain the cargo to be packed corresponding to the current leaf node packing box, can realize the packing analysis of the leaf node packing box through the preset detection constraint information, realizes the full utilization of the leaf node packing box on the basis of independent personal experience, adjusts the second packing order to obtain the new second packing order, carries out branch extension on the current leaf node packing box when the new second packing order is not an empty set to obtain the next-stage leaf node packing box, according to the next-stage leaf node packaging box, mixed placement point searching is continuously carried out, full utilization of the next-stage leaf node packaging box can be achieved, when a new second packaging sequence is an empty set, a current cargo packing scheme is obtained according to-be-packaged cargos corresponding to the current leaf node packaging box, a cargo packing scheme to be compared is obtained according to all levels of leaf nodes and the first packaging sequence in the current cargo packing scheme, the current cargo packing scheme and the cargo packing scheme to be compared are compared according to preset target index information, a target cargo packing scheme is obtained, and on the basis of achieving full utilization of all levels of leaf node packaging boxes, the cargo packing scheme which is matched with the preset target index information best can be compared, so that cargo packing space can be saved.

The parameter information of the goods to be packaged refers to size information of the goods to be packaged, and the parameter information comprises length, width, height and the like of the goods to be packaged. The bottom surface of the goods to be packaged means the surface with the largest area among the surfaces of the goods to be packaged.

Specifically, the terminal obtains a first packaging sequence of the packaging box and parameter information of the goods to be packaged, obtains a current leaf node packaging box according to the first packaging sequence, calculates the area of each surface of the goods to be packaged according to the parameter information, determines the surface with the largest area as the bottom surface of the goods to be packaged, and sorts the goods to be packaged according to the calculated bottom area of the bottom surface of the goods to be packaged to obtain a second packaging sequence of the goods to be packaged. The method for sorting the goods to be packaged according to the bottom area of the bottom surface of the goods to be packaged can be as follows: and sorting in descending order according to the bottom area of the bottom surface of the goods to be packaged, and arranging the goods to be packaged with the largest bottom area at the forefront.

In this embodiment, the current leaf node packaging box can be obtained according to the first packaging sequence by obtaining the first packaging sequence of the packaging box, the bottom surface of the goods to be packaged is determined according to the parameter information by obtaining the parameter information of the goods to be packaged, the goods to be packaged can be ordered according to the bottom area of the bottom surface of the goods to be packaged, and the second packaging sequence of the goods to be packaged is obtained.

The initial mixed placement point refers to a preset placement origin of a current leaf node packaging box. For example, the initial mixed placement points may specifically be the intersection points of two adjacent sides and the bottom surface of the current leaf node packaging box, where the number of initial mixed placement points of each current leaf node packaging box is one, and any one of four intersection points of the two adjacent sides and the bottom surface may be selected as the initial mixed placement point. The current goods to be packaged are the goods with the highest packaging priority in the second packaging order. The information to be detected refers to the information to be detected and simulated to be placed, which is obtained after the current goods to be packaged are simulated to be placed. For example, the information to be detected may be specifically the weight to be detected of the current leaf node packaging box obtained after the current goods to be packaged are simulated and placed. For another example, the information to be detected may specifically be a to-be-detected supporting area ratio corresponding to the current to-be-packaged goods obtained after the current to-be-packaged goods are subjected to simulated placement. For another example, the information to be detected may specifically be a collision detection result obtained after the current goods to be packaged are subjected to simulated placement.

The constraint detection result is used for representing whether the current goods to be packaged meet constraint conditions or not. When the constraint detection result is that the current goods to be packaged meet constraint conditions, the current goods to be packaged can be placed in the current leaf node packaging box, when the constraint detection result is that the current goods to be packaged do not pass, the terminal can conduct posture adjustment on the current goods to be packaged, and whether the current goods to be packaged after the posture adjustment meet the constraint conditions is further judged through secondary constraint detection. The attribution result of the current goods to be packaged is used for representing whether the current goods to be packaged are attributed to the current leaf node packaging box or not. For example, the attribution result of the current to-be-packaged goods can be that the current to-be-packaged goods are attributed to the current leaf node packaging box. The next-order to-be-packaged goods refers to-be-packaged goods with packaging priority being the next level of the current to-be-packaged goods in the second packaging order.

Specifically, the terminal obtains an initial mixed placement point of the current leaf node packaging box, obtains a current to-be-packaged goods according to a second packaging sequence, carries out simulated placement on the current to-be-packaged goods according to the initial mixed placement point to obtain to-be-detected information, carries out constraint detection on the current to-be-packaged goods by comparing preset detection constraint information with the to-be-detected information to obtain a constraint detection result, determines that the current to-be-packaged goods belong to the current leaf node packaging box when the constraint detection result is passed, carries out gesture adjustment on the current to-be-packaged goods when the constraint detection result is not passed, carries out secondary constraint detection on the current to-be-packaged goods after the gesture adjustment to obtain a attribution result of the current to-be-packaged goods, updates the initial mixed placement point according to the attribution result, obtains a next order to-be-packaged goods corresponding to the current to-be-packaged goods according to the second packaging sequence, returns the next order to-be-packaged goods as new current to-be-packaged goods, carries out simulated placement on the current to-be-packaged goods according to the initial mixed placement point to obtain to-be-detected information, and continues to detect the new current to-be-packaged goods until the current to-be-packaged goods do not exist in the corresponding to the next to be-packaged goods (i.e. all the to be packaged goods are packaged to be packaged in the corresponding to the first to be packaged goods). The method for updating the initial mixed placement point according to the attribution result can be as follows: when the current goods to be packaged belong to the current leaf node packaging box, acquiring parameter information of the current goods to be packaged, and updating the initial mixed placement point according to the parameter information of the current goods to be packaged.

For example, fig. 3 is a diagram of simulated placement of a current item to be packaged according to corner points in the mixed placement points and updating of the initial mixed placement point, which is L0 in fig. 3-1: (0, 0) the terminal will place the goods to be packaged according to the initial mix placement point, which becomes L0 after placement into the first goods to be packaged in fig. 3-2: (4, 0), (0,3,0), L1: (0, 3), after placement into three goods to be packaged in fig. 3-3, the initial mix placement point becomes L0: (10,0,0), (4, 3, 0) … …, L1: (4,0,1), L2: (0,3,2), L3: (0,0,3). The terminal performs simulation placement according to the levels L0, L1, L2, and L3, where the levels correspond to the third coordinate point.

In this embodiment, the current to-be-packaged goods are subjected to simulated placement according to the initial mixed placement point to obtain to-be-detected information, constraint detection is performed on the current to-be-packaged goods according to preset detection constraint information and to-be-detected information to obtain a constraint detection result, an attribution result of the current to-be-packaged goods is obtained according to the constraint detection result, the initial mixed placement point is updated according to the attribution result, next-order to-be-packaged goods corresponding to the current to-be-packaged goods are obtained according to the second packaging order, new current to-be-packaged goods are obtained according to the next-order to-be-packaged goods, and the step of performing simulated placement on the current to-be-packaged goods according to the initial mixed placement point to obtain to-be-detected information is performed until the current to-be-packaged goods do not have the corresponding next-order to-be-packaged goods corresponding to the current leaf node packaging box is obtained, and the to-be-packaged goods corresponding to the current leaf node packaging box can be obtained.

The weight to be detected of the current leaf node packaging box refers to the total loading weight of the current leaf node packaging box after the current goods to be packaged are placed in the current leaf node packaging box, and the weight to be detected of the current leaf node packaging box can be obtained by calculating the sum of the total weight of the goods placed in the current leaf node packaging box and the weight of the current goods to be packaged. The weight can be obtained through parameter information, the terminal can acquire the parameter information of the current goods to be packaged, and then the weight is determined according to the parameter information. The preset neighbor relation information is used for representing the relative relation between cargoes, as shown in fig. 4, the relative relation between cargoes can be searched rapidly through the preset neighbor relation information, and each time a new to-be-packaged cargoes is placed in the current leaf node packaging box, the terminal updates the preset neighbor relation information so as to determine the relative relation between cargoes. For example, the terminal may use a bi-directional DAG (Directed Acyclic Graph ) graph model to model neighbor relationships to quickly search for relative relationships between goods. The supporting goods corresponding to the current to-be-packaged goods refer to lower neighbors (namely, the goods supporting the current to-be-packaged goods) corresponding to the current to-be-packaged goods, which are obtained after the current to-be-packaged goods are subjected to simulated placement. The supporting cargo area refers to the contact area of the cargo supporting the current cargo to be packaged and the current cargo to be packaged. The collision constraint is used for detecting whether the goods to be packaged are placed in the current leaf node packaging box or not and collide with the goods placed in the current leaf node packaging box. For example, the terminal may use a 3D AABB collision detection algorithm for collision detection.

Specifically, the terminal can simulate and place current to-be-packaged goods according to the initial mixed placement point, the to-be-detected weight of the current leaf node packaging box is obtained by calculating the sum of the total weight of the goods placed into the current leaf node packaging box and the weight of the current to-be-packaged goods, the supporting goods corresponding to the current to-be-packaged goods are obtained according to preset neighbor relation information, the contact area of the supporting goods and the current to-be-packaged goods is used as the supporting goods area, the ratio of the supporting goods area to the bottom area of the current to-be-packaged goods is calculated and used as the to-be-detected supporting area ratio, and the collision detection is carried out on the current to-be-packaged goods to obtain the collision detection result. In addition, when the current goods to be packaged have the appointed placing gesture, the terminal can also detect whether the current goods to be packaged are identical to the appointed placing gesture.

In this embodiment, the current to-be-packaged goods are subjected to simulated placement according to the initial mixed placement point, the to-be-detected weight of the current leaf node packaging box is obtained, the area of the support goods corresponding to the current to-be-packaged goods is obtained according to the preset neighbor relation information, the to-be-detected support area ratio is obtained according to the area of the support goods and the bottom area of the current to-be-packaged goods, the collision detection result is obtained by performing collision detection on the current to-be-packaged goods, and the to-be-detected weight, the to-be-detected support area ratio and the collision detection result can be obtained.

Specifically, when the constraint detection result is passing, the terminal classifies the current goods to be packaged as the goods to be packaged corresponding to the current leaf node packaging box, and acquiring parameter information (including length, width and height) of the current goods to be packaged, and updating the initial mixed placement point according to the parameter information of the current goods to be packaged. The method for updating the initial mixed placement point according to the parameter information of the current goods to be packaged can be as follows: according to the parameter information of the current goods to be packaged and the initial mixed placement point, calculating the mixed placement point corresponding to the current goods to be packaged, and updating the initial mixed placement point according to the mixed placement point.

In this embodiment, when the constraint detection result is passing, the current goods to be packaged are classified as the goods to be packaged corresponding to the current leaf node packaging box, the parameter information of the current goods to be packaged is obtained, and the initial mixed placement point is updated according to the parameter information of the current goods to be packaged, so that the acquisition of the attribution result and the update of the initial mixed placement point can be realized.

Specifically, when the constraint detection result is that the object does not pass through, the terminal can carry out gesture adjustment on the current object to be packaged, the current object to be packaged after gesture adjustment is subjected to simulated placement according to the initial mixed placement point, target object to be detected information is obtained, secondary constraint detection is carried out on the current object to be packaged after gesture adjustment by comparing preset constraint detection information and the target object to be detected information, and a secondary constraint detection result is obtained. And when the secondary constraint detection result is that the current goods to be packaged passes, classifying the current goods to be packaged into the goods to be packaged corresponding to the current leaf node packaging box, acquiring parameter information (including length, width and height) of the current goods to be packaged, and updating an initial mixed placement point according to the parameter information of the current goods to be packaged. The method for updating the initial mixed placement point according to the parameter information of the current goods to be packaged can be as follows: according to the parameter information of the current goods to be packaged and the initial mixed placement point, calculating the mixed placement point corresponding to the current goods to be packaged, and updating the initial mixed placement point according to the mixed placement point. When the secondary constraint detection result is that the goods do not pass, the terminal can classify the goods to be packaged currently as goods which do not belong to the current leaf node packaging box, and the initial mixed placement point cannot be updated.

The target to-be-detected information comprises to-be-detected weight, to-be-detected supporting area ratio and collision detection result. And carrying out posture adjustment on the current to-be-packaged goods, carrying out simulated placement on the current to-be-packaged goods after the posture adjustment according to the initial mixed placement points, wherein the mode of obtaining the target to-be-detected information can be that the posture adjustment is carried out according to the preset goods rotation sequence, and carrying out simulated placement on the current to-be-packaged goods after each posture adjustment according to the initial mixed placement points, so as to obtain the target to-be-detected information corresponding to each posture.

In this embodiment, by performing posture adjustment on the current to-be-packaged goods and performing secondary constraint detection on the current to-be-packaged goods after the posture adjustment, a secondary constraint detection result is obtained, when the secondary constraint detection result is that the current to-be-packaged goods pass, classifying the current to-be-packaged goods as to-be-packaged goods corresponding to the current leaf node packaging box, acquiring parameter information of the current to-be-packaged goods, updating an initial mixed placement point according to the parameter information of the current to-be-packaged goods, and acquiring an attribution result and updating the initial mixed placement point can be achieved.

The leaf nodes to be compared corresponding to each stage of leaf nodes refer to leaf nodes with priorities behind each stage of leaf nodes in the first packing order. The cargo boxing scheme to be compared refers to a boxing scheme obtained by sequentially replacing corresponding leaf nodes at all levels with leaf nodes to be compared in the current cargo boxing scheme.

Specifically, the terminal obtains leaf nodes to be compared corresponding to all levels of leaf nodes according to all levels of leaf nodes and a first packing sequence in a current cargo boxing scheme, and then replaces all levels of leaf nodes corresponding to the current cargo boxing scheme with the leaf nodes to be compared to obtain a cargo boxing scheme to be compared, and compares the current cargo boxing scheme with the cargo boxing scheme to be compared according to preset target index information to obtain a target boxing scheme. When the current cargo boxing scheme is provided with multi-stage leaf nodes and/or leaf nodes with multiple priorities in the first packaging sequence, the leaf nodes to be compared are used for replacing all stages of leaf nodes corresponding to the current cargo boxing scheme, so that multiple cargo boxing schemes to be compared can be obtained, and all the multiple cargo boxing schemes to be compared need to be compared with the current cargo boxing scheme, and a target boxing scheme is selected from the multiple cargo boxing schemes to be compared. For example, when the preset target index information is the cost of the package, the terminal compares the cost of the package of the current cargo boxing scheme with the cost of the package of the cargo boxing scheme to be compared, and selects the boxing scheme with the minimum cost of the package from the comparison results as the target boxing scheme.

For example, as shown in FIG. 5, the present embodiment may be illustrated using a fuzzy N-ary search algorithm. The number of the to-be-packaged goods is eight, the first packaging sequence comprises three packaging boxes with the packaging box types of 501, 502 and 503, the prices of the three packaging boxes are 12, 5 and 15 respectively, the first packaging sequence is 501-503-502, the leftmost branch in fig. 5 is the current goods boxing scheme obtained by using the four 501 packaging boxes, the terminal obtains to-be-compared leaf nodes corresponding to all levels of leaf nodes according to all levels of leaf nodes (501) and the first packaging sequence (only 503,502 of the to-be-compared leaf nodes corresponding to the first level of leaf nodes are pre-cut), the to-be-compared leaf nodes are used for replacing all levels of leaf nodes corresponding to the current goods boxing scheme, the to-be-compared goods boxing scheme is obtained, and the target goods boxing scheme is obtained according to the packaging box cost comparison current goods boxing scheme and the to-be-compared goods boxing scheme (namely, 2 pieces of 503 and 30 of goods boxing scheme are adopted in fig. 5). The terminal can be up step by step according to leaf nodes at all levels to obtain a plurality of cargo packing schemes to be compared, each cargo packing scheme to be compared and the current cargo packing scheme to be compared are compared step by step, and when the cargo packing scheme to be compared is superior to the current cargo packing scheme, the terminal can continuously compare the cargo packing scheme to be compared superior to the current cargo packing scheme as a new current cargo packing scheme. The pre-pruning refers to that the terminal estimates whether a certain leaf node is worth extending according to the preset target index information in a fuzzy mode, if the best solution for extending the leaf node is not better than the best solution found currently, pruning is carried out to terminate the extension of the current branch in advance. Further, as shown in fig. 6, when the number of the packing boxes in the first packing order is too large, in order to obtain the target cargo packing scheme more conveniently, the terminal may first randomly segment the packing boxes in the first packing order by adopting a random nest segmentation search algorithm to obtain a plurality of (usually 50-100) fuzzy N-ary search tree distributed searching local optimal cargo packing schemes, and obtain an approximate global optimal cargo packing scheme (i.e. target packing scheme) by combining the local optimal cargo packing schemes of each tree.

In this embodiment, the leaf nodes to be compared corresponding to the leaf nodes at all levels are obtained according to the leaf nodes at all levels and the first packing order in the current cargo boxing scheme, the cargo boxing scheme to be compared is obtained according to the leaf nodes to be compared and the current cargo boxing scheme, the current cargo boxing scheme and the cargo boxing scheme to be compared are compared according to preset target index information, and the target cargo boxing scheme is obtained, so that the target cargo boxing scheme can be obtained.

As shown in fig. 7, an embodiment is provided to illustrate the cargo box solution output method of the present application.

The Method comprises the steps of obtaining a first packing order of a packing box and a second packing order of goods to be packed by a PPMN (platform-Point-Method-with-Neighbors) loading engine, obtaining a current leaf node packing box according to the first packing order, carrying out mixed Placement Point search on the current leaf node packing box according to the second packing order and preset detection constraint information to obtain goods to be packed corresponding to the current leaf node packing box, adjusting the second packing order according to the goods to be packed corresponding to the current leaf node packing box to obtain a new second packing order, carrying out branch extension on the current leaf node packing box according to the first packing order to obtain a next-stage leaf node packing box when the new second packing order is not an empty set, updating the current leaf node packing box according to the next-stage leaf node packing box, returning to the step of carrying out mixed Placement Point search on the current leaf node packing box according to the second packing order, obtaining a current goods packing box scheme according to the goods to be packed corresponding to the current leaf node packing box, comparing the goods to the first packing box with the current packing box to obtain a target goods box according to each stage of the current goods packing box scheme, comparing the current packing box with the first packing scheme to obtain a target goods box according to the comparison target packing scheme. Wherein the mixed placement points include corner points and corner mapping points.

Specifically, when searching the mixed placement points of the current leaf node packaging box according to the second packaging order and preset detection constraint information to obtain to-be-packaged goods corresponding to the current leaf node packaging box, the PPMN loading engine acquires initial mixed placement points of the current leaf node packaging box, obtains current to-be-packaged goods according to the second packaging order, performs simulated placement on the current to-be-packaged goods according to the initial mixed placement points to obtain to-be-detected information, performs constraint detection on the current to-be-packaged goods according to preset detection constraint information (including weight constraint, support constraint, collision constraint and gesture constraint) and to-be-detected information to obtain constraint detection results, obtains attribution results of the current to-be-packaged goods according to constraint detection results, updates the initial mixed placement points according to attribution results, obtains next-order to-be-packaged goods corresponding to the current to-be-packaged goods according to the second packaging order, returns to-be-packaged goods to the next-order to perform simulated placement on the current to-be-packaged goods according to the initial mixed placement points to obtain to-be-detected information until the next-to-packaged goods do not exist in the corresponding to the next-to-packaged goods to obtain to-be-packaged goods corresponding to the current to the packaging box corresponding to the current to the leaf node to be-packaged goods.

Specifically, when the current goods to be packaged are subjected to simulated placement according to the initial mixed placement points to obtain the information to be detected, the PPMN loading engine can simulate placement of the current goods to be packaged according to the initial mixed placement points to obtain the weight to be detected of the current leaf node packaging box, call the neighbor relation network construction module to obtain preset neighbor relation information, obtain the area of the supporting goods corresponding to the current goods to be packaged according to the preset neighbor relation information, obtain the ratio of the supporting area to be detected according to the area of the supporting goods and the bottom area of the current goods to be packaged, and perform collision detection on the current goods to be packaged to obtain the collision detection result.

Specifically, when the attribution result of the current goods to be packaged is obtained according to the constraint detection result, and the initial mixed placement point is updated according to the attribution result, if the constraint detection result is passed, the PPMN loading engine classifies the current goods to be packaged as the goods to be packaged corresponding to the current leaf node packaging box, acquires the parameter information of the current goods to be packaged, and updates the initial mixed placement point according to the parameter information of the current goods to be packaged. If the constraint detection result is not passing, the PPMN loading engine calls the material rotation engine to carry out posture adjustment on the current goods to be packaged, the current goods to be packaged after the posture adjustment are subjected to simulated placement according to the initial mixed placement point to obtain target to-be-detected information, secondary constraint detection is carried out on the current goods to be packaged after the posture adjustment according to preset detection constraint information and target to-be-detected information to obtain a secondary constraint detection result, and when the secondary constraint detection result is passing, the current goods to be packaged are classified as the goods to be packaged corresponding to the current leaf node packing box, the parameter information of the current goods to be packaged is obtained, and the initial mixed placement point is updated according to the parameter information of the current goods to be packaged.

Specifically, when the cargo boxing scheme to be compared is obtained by comparing the current cargo boxing scheme with the cargo boxing scheme to be compared according to preset target index information according to all levels of leaf nodes and the first packaging sequence in the current cargo boxing scheme, and the target cargo boxing scheme is obtained, a PPMN loading engine is realized by adopting a fuzzy N-way search tree algorithm and a random nest segmentation algorithm: according to the leaf nodes at all levels and the first packing sequence in the current cargo boxing scheme, obtaining leaf nodes to be compared corresponding to the leaf nodes at all levels, obtaining a cargo boxing scheme to be compared according to the leaf nodes to be compared and the current cargo boxing scheme, and comparing the current cargo boxing scheme with the cargo boxing scheme to be compared according to preset target index information (loading efficiency, number of containers, cost of containers and residual volume), thus obtaining a target cargo boxing scheme.

It should be understood that, although the steps in the flowchart of fig. 1 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least a portion of the steps in fig. 1 may include a plurality of steps or stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily sequential, but may be performed in rotation or alternatively with at least a portion of the steps or stages in other steps or other steps.

In one embodiment, as shown in fig. 8, there is provided a cargo boxing scheme output device, comprising: an acquisition module 802, a search module 804, an adjustment module 806, a first processing module 808, and a second processing module 810, wherein:

the obtaining module 802 is configured to obtain a first packaging order of a packaging box and a second packaging order of a to-be-packaged cargo, and obtain a current leaf node packaging box according to the first packaging order;

the searching module 804 is configured to perform mixed placement point searching on the current leaf node packaging box according to the second packaging order and preset detection constraint information, so as to obtain a to-be-packaged cargo corresponding to the current leaf node packaging box;

the adjusting module 806 is configured to adjust the second packaging order according to the to-be-packaged goods corresponding to the current leaf node packaging box, so as to obtain a new second packaging order;

the first processing module 808 is configured to branch and extend the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box when the new second packaging order is not an empty set, update the current leaf node packaging box according to the next-stage leaf node packaging box, and return to the step of performing mixed placement point search on the current leaf node packaging box according to the second packaging order;

And the second processing module 810 is configured to obtain a current cargo boxing scheme according to the to-be-packaged cargo corresponding to the current leaf node packaging box when the new second packaging sequence is empty, obtain a to-be-compared cargo boxing scheme according to each level of leaf nodes and the first packaging sequence in the current cargo boxing scheme, and compare the current cargo boxing scheme with the to-be-compared cargo boxing scheme according to preset target index information to obtain a target cargo boxing scheme.

The cargo packing box proposal output device obtains the current leaf node packing box according to the first packing order after obtaining the first packing order and the second packing order, performs mixed placement point search on the current leaf node packing box according to the second packing order and preset detection constraint information to obtain the cargo to be packed corresponding to the current leaf node packing box, can realize the packing analysis of the leaf node packing box through the preset detection constraint information, realizes the full utilization of the leaf node packing box on the basis of independent personal experience, adjusts the second packing order to obtain a new second packing order, branches and extends the current leaf node packing box when the new second packing order is not empty, and obtains the next-stage leaf node packing box, according to the next-stage leaf node packaging box, mixed placement point searching is continuously carried out, full utilization of the next-stage leaf node packaging box can be achieved, when a new second packaging sequence is an empty set, a current cargo packing scheme is obtained according to-be-packaged cargos corresponding to the current leaf node packaging box, a cargo packing scheme to be compared is obtained according to all levels of leaf nodes and the first packaging sequence in the current cargo packing scheme, the current cargo packing scheme and the cargo packing scheme to be compared are compared according to preset target index information, a target cargo packing scheme is obtained, and on the basis of achieving full utilization of all levels of leaf node packaging boxes, the cargo packing scheme which is matched with the preset target index information best can be compared, so that cargo packing space can be saved.

In one embodiment, the obtaining module is further configured to obtain a first packaging order of the packaging box and parameter information of the goods to be packaged, obtain a current leaf node packaging box according to the first packaging order, determine a bottom surface of the goods to be packaged according to the parameter information, and sort the goods to be packaged according to a bottom area of the bottom surface of the goods to be packaged, so as to obtain a second packaging order of the goods to be packaged.

In one embodiment, the search module is further configured to obtain an initial mixed placement point of the current leaf node packaging box, obtain a current to-be-packaged cargo according to the second packaging order, perform simulated placement on the current to-be-packaged cargo according to the initial mixed placement point, obtain to-be-detected information, perform constraint detection on the current to-be-packaged cargo according to preset detection constraint information and to-be-detected information, obtain a constraint detection result, obtain an attribution result of the current to-be-packaged cargo according to the constraint detection result, update the initial mixed placement point according to the attribution result, obtain a next-order to-be-packaged cargo corresponding to the current to-be-packaged cargo according to the second packaging order, obtain a new current to-be-packaged cargo according to the next-order to-be-packaged cargo, return to the step of performing simulated placement on the current to-be-packaged cargo according to the initial mixed placement point, and obtain to-be-detected information until the current to-be-packaged cargo does not have the corresponding next-order to-be-packaged cargo, and obtain to-be-packaged cargo corresponding to the current leaf node packaging box.

In one embodiment, the search module is further configured to perform simulated placement on the current to-be-packaged goods according to the initial mixed placement point, obtain a to-be-detected weight of the current leaf node packaging box, obtain a support goods area corresponding to the current to-be-packaged goods according to the preset neighbor relation information, obtain a to-be-detected support area ratio according to the support goods area and a bottom area of the current to-be-packaged goods, and perform collision detection on the current to-be-packaged goods to obtain a collision detection result.

In one embodiment, the search module is further configured to classify the current to-be-packaged goods as to-be-packaged goods corresponding to the current leaf node packaging box when the constraint detection result is passing, acquire parameter information of the current to-be-packaged goods, and update the initial mixed placement point according to the parameter information of the current to-be-packaged goods.

In one embodiment, the search module is further configured to perform posture adjustment on the current to-be-packaged goods when the constraint detection result is not passed, perform simulated placement on the current to-be-packaged goods with the regulated posture according to the initial mixed placement point to obtain target to-be-detected information, perform secondary constraint detection on the current to-be-packaged goods with the regulated posture according to preset detection constraint information and the target to-be-detected information to obtain a secondary constraint detection result, classify the current to-be-packaged goods as to-be-packaged goods corresponding to the current leaf node packaging box when the secondary constraint detection result is passed, acquire parameter information of the current to-be-packaged goods, and update the initial mixed placement point according to the parameter information of the current to-be-packaged goods.

In one embodiment, the second processing module is further configured to obtain to-be-compared leaf nodes corresponding to each level of leaf nodes according to each level of leaf nodes and the first packing order in the current cargo boxing scheme, obtain to-be-compared cargo boxing scheme according to the to-be-compared leaf nodes and the current cargo boxing scheme, compare the current cargo boxing scheme with the to-be-compared cargo boxing scheme according to preset target index information, and obtain the target cargo boxing scheme.

The specific limitation of the cargo boxing scheme output device can be referred to as limitation of the cargo boxing scheme output method, and the description thereof is omitted herein. The modules in the cargo boxing scheme output device can be fully or partially realized by software, hardware and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.

In one embodiment, a computer device is provided, which may be a terminal, and the internal structure thereof may be as shown in fig. 9. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program when executed by the processor implements a cargo packing solution output method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.

It will be appreciated by those skilled in the art that the structure shown in fig. 9 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the computer device to which the present application applies, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.

In an embodiment, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.

Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, or the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

The above examples merely represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.

Claims

1. A method of outputting a cargo packing solution, the method comprising:

acquiring a first packing order of a packing box and parameter information of goods to be packed, determining a second packing order of the goods to be packed according to the parameter information, and acquiring a current leaf node packing box according to the first packing order;

performing mixed placement point search on the current leaf node packaging box according to the second packaging sequence and preset detection constraint information to obtain to-be-packaged goods corresponding to the current leaf node packaging box;

The second packaging sequence is adjusted according to the goods to be packaged corresponding to the current leaf node packaging box, and a new second packaging sequence is obtained;

when the new second packaging order is not an empty set, branching and extending the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box, updating the current leaf node packaging box according to the next-stage leaf node packaging box, and returning to the step of searching the mixed placement points of the current leaf node packaging box according to the second packaging order and preset detection constraint information;

2. The method of claim 1, wherein the determining a second packaging order for the goods to be packaged based on the parameter information comprises:

Determining the bottom surface of the goods to be packaged according to the parameter information;

and sequencing the goods to be packaged according to the bottom area of the bottom surface of the goods to be packaged, so as to obtain a second packaging sequence of the goods to be packaged.

3. The method of claim 1, wherein the performing the mixed placement point search on the current leaf node package box according to the second package order and the preset detection constraint information to obtain the to-be-packaged goods corresponding to the current leaf node package box comprises:

obtaining an initial mixed placement point of a current leaf node packing box, and obtaining current goods to be packed according to the second packing order;

performing simulated placement on the current goods to be packaged according to the initial mixed placement points to obtain information to be detected;

performing constraint detection on the current goods to be packaged according to the preset detection constraint information and the information to be detected to obtain a constraint detection result;

Obtaining new current goods to be packaged according to the goods to be packaged in the next order;

and returning to the step of carrying out simulated placement on the current goods to be packaged according to the initial mixed placement point to obtain information to be detected until the current goods to be packaged do not have corresponding next-order goods to be packaged, and obtaining the goods to be packaged corresponding to the current leaf node packaging box.

4. A method according to claim 3, wherein said performing simulated placement of said current item to be packaged according to said initial mix placement point to obtain information to be detected comprises:

performing simulated placement on the current goods to be packaged according to the initial mixed placement points to obtain the weight to be detected of the current leaf node packaging box, and obtaining the area of the supporting goods corresponding to the current goods to be packaged according to preset neighbor relation information;

and obtaining a to-be-detected supporting area ratio according to the supporting cargo area and the bottom area of the current to-be-packaged cargo, and performing collision detection on the current to-be-packaged cargo to obtain a collision detection result.

5. A method according to claim 3, wherein said obtaining a home result of the current goods to be packaged according to the constraint detection result, and updating the initial mix placement point according to the home result comprises:

6. A method according to claim 3, wherein said obtaining a home result of the current goods to be packaged according to the constraint detection result, and updating the initial mix placement point according to the home result comprises:

when the constraint detection result is that the constraint detection result does not pass, carrying out posture adjustment on the current goods to be packaged, and carrying out simulated placement on the current goods to be packaged after the posture adjustment according to the initial mixed placement point to obtain target information to be detected;

performing secondary constraint detection on the current goods to be packaged after the posture adjustment according to the preset detection constraint information and the target information to be detected to obtain a secondary constraint detection result;

when the secondary constraint detection result is that the current to-be-packaged goods passes, classifying the current to-be-packaged goods into to-be-packaged goods corresponding to a current leaf node packaging box, and acquiring parameter information of the current to-be-packaged goods;

7. The method of claim 1, wherein the obtaining the cargo casing scheme to be compared according to the leaf nodes of each stage and the first packing order in the current cargo casing scheme, and comparing the current cargo casing scheme and the cargo casing scheme to be compared according to preset target index information, and the obtaining the target cargo casing scheme comprises:

obtaining leaf nodes to be compared corresponding to all levels of leaf nodes according to all levels of leaf nodes and the first packing sequence in the current cargo packing scheme;

8. A cargo boxing scheme output device, the device comprising:

the acquisition module is used for acquiring a first packing order of the packing boxes and parameter information of the goods to be packed, determining a second packing order of the goods to be packed according to the parameter information, and acquiring a current leaf node packing box according to the first packing order;

The searching module is used for searching the mixed placement points of the current leaf node packaging boxes according to the second packaging sequence and preset detection constraint information to obtain to-be-packaged goods corresponding to the current leaf node packaging boxes;

the first processing module is used for branching and extending the current leaf node packaging box according to the first packaging order to obtain a next-stage leaf node packaging box, updating the current leaf node packaging box according to the next-stage leaf node packaging box, and returning to the step of searching the mixed placement points of the current leaf node packaging box according to the second packaging order when the new second packaging order is not an empty set;

and the second processing module is used for obtaining a current cargo boxing scheme according to the to-be-packaged cargos corresponding to the current leaf node packaging box when the new second packaging sequence is empty, obtaining a to-be-compared cargo boxing scheme according to all levels of leaf nodes and the first packaging sequence in the current cargo boxing scheme, and comparing the current cargo boxing scheme with the to-be-compared cargo boxing scheme according to preset target index information to obtain a target cargo boxing scheme.

9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 7 when the computer program is executed.

10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.