A packing method and device

Abstract

The present invention discloses a packing method and device, which relate to the field of warehousing and logistics. A specific implementation of the method includes: receiving a packing request for a loading box, querying the space size of the loading box according to the loading box identifier in the packing request, calling a segmentation program to segment the space size, and obtaining multiple subspace segmentation schemes; calculating the loading rate of each subspace segmentation scheme according to the packaging box placement method for each subspace segmentation scheme to screen out the target subspace segmentation scheme with the highest loading rate; using the target subspace in the target subspace segmentation scheme as the segmentation unit, segmenting the space size, combining the corresponding packaging box placement method, generating a packing plan and returning it. This implementation divides the loading box into multiple circulation units and remaining space. The circulation units use the same packaging box placement method, and the remaining space is solved separately using a tree search algorithm, thereby improving practical feasibility and improving the packing efficiency of on-site operators.

Description

Technical Field

[0001] The present invention relates to the field of warehousing logistics, and in particular to a packing method and device. Background Art

[0002] The packing problem is a classic problem in the field of logistics. Technically, it belongs to operations research. Given a container (loading box) and a collection of several rectangular packaging boxes, the position and posture of each packaging box are determined to ensure that as many packaging boxes as possible are placed in the container while meeting specific requirements.

[0003] The packing problem can usually be modeled as an integer programming problem. Current techniques for solving this problem include using integer programming algorithms to find exact solutions, using intelligent optimization methods such as genetic algorithms to find approximate optimal solutions, setting heuristic algorithms (such as tree search algorithms) according to the nature of the problem, etc. There are also some studies that use pointer networks in combination with deep reinforcement learning to solve the problem.

[0004] In the process of realizing the present invention, the inventors found that the prior art has at least the following problems: the current technology mainly solves the problem of general scenarios, that is, the size and shape of each packaging box are arbitrarily given, so suggestions are given on how to place each packaging box. However, during the cargo loading process, since the volume of the loading box is very large, directing on-site personnel to place each packaging box is very inefficient and not feasible. Summary of the invention

[0005] In view of this, an embodiment of the present invention provides a packing method and device, which can at least solve the problem that in the prior art, a plan is given for how to place each packaging box, resulting in low efficiency and low feasibility of on-site placement.

[0006] To achieve the above object, according to one aspect of an embodiment of the present invention, a packing method is provided, comprising:

[0007] receiving a packing request for a loading box, querying the space size of the loading box according to the loading box identifier in the packing request, calling a segmentation program to segment the space size, and obtaining multiple subspace segmentation schemes;

[0008] According to the packaging box placement method for each subspace segmentation scheme, the loading rate of each subspace segmentation scheme is calculated to screen out the target subspace segmentation scheme with the highest loading rate;

[0009] The target subspace in the target subspace segmentation scheme is used as a segmentation unit to segment the space size, and a packing scheme is generated and returned in combination with the corresponding packaging box placement method.

[0010] Optionally, calculating the loading rate of each subspace segmentation scheme according to the packaging box placement mode of each subspace segmentation scheme includes:

[0011] Call the tree search program to solve the arrangement method that can accommodate the largest total volume of packaging boxes in a single subspace, and construct the smallest circumscribed cuboid of the overall shape of all packaging boxes under the arrangement method;

[0012] Calculate the product of the length of the circumscribed minimum cuboid and the height and width of the single subspace to obtain the actual space occupied by the arrangement;

[0013] The number of packaging boxes in the arrangement mode is determined, and the ratio of the product of the number of packaging boxes and the volume of a single packaging box to the size of the actually occupied space is used as the loading rate of the single subspace.

[0014] Optionally, the method further includes: updating the length of the single subspace based on the length of the circumscribed minimum cuboid.

[0015] Optionally, the calling of a segmentation program to segment the space size to obtain a plurality of subspace segmentation schemes, including:

[0016] A segmentation program is called to segment the space size into a plurality of subspaces of different lengths along the length direction of the loading box; wherein the height and width of the subspace are equal to the height and width of the loading box, and the length is less than the length of the loading box.

[0017] Optionally, the partitioning scheme of partitioning the space size into multiple subspaces of different lengths includes:

[0018] Use the binary method to divide the space size of the loading box to obtain a division scheme of the first subspace; wherein the length of the first subspace is half of the length of the loading box;

[0019] The space size of the first subspace is divided to obtain a division scheme of the second subspace; wherein the length of the second subspace is half of the length of the first subspace;

[0020] The above binary division method is repeated until the size of the divided subspace is smaller than the volume of a single packaging box, thereby obtaining a variety of subspace division schemes of different lengths.

[0021] Optionally, taking the target subspace in the target subspace segmentation scheme as a segmentation unit and segmenting the space size includes:

[0022] Calculate the quotient of the length of the carrying box and the length of the target subspace, and in response to the quotient being an integer, divide the space size of the carrying box into the quotient number of cyclic units; or

[0023] In response to the quotient not being an integer, the quotient is rounded down to obtain the number of circulating units, and the remaining space size is calculated by subtracting the space size of all circulating units from the space size of the loading box;

[0024] Determine whether the remaining space is smaller than the size of the packaging box; wherein the size of the packaging box is the set of edges of the packaging box placed along the length direction of the loading box within the preset constraint condition;

[0025] If it is less than, the actual number of cyclic units is determined to be the number minus 1, the sum of the remaining space size and the space size of a target subspace is used as the new remaining space size, and the tree search program is called to solve the packaging box placement method for the new remaining space size; or

[0026] If it is greater than or equal to, the actual number of circulation units is determined to be the said number, and the tree search program is called to solve the packaging box placement method of the said remaining space size.

[0027] To achieve the above object, according to another aspect of an embodiment of the present invention, a box packing device is provided, comprising:

[0028] A segmentation scheme module is used to receive a packing request for a loading box, query the space size of the loading box according to the loading box identifier in the packing request, call a segmentation program to segment the space size, and obtain multiple subspace segmentation schemes;

[0029] The loading rate module is used to calculate the loading rate of each subspace segmentation scheme according to the packaging box placement method of each subspace segmentation scheme, so as to screen out the target subspace segmentation scheme with the highest loading rate;

[0030] The packing scheme module is used to divide the space size by taking the target subspace in the target subspace segmentation scheme as the segmentation unit, and generate and return the packing scheme in combination with the corresponding packaging box placement method.

[0031] Optionally, the loading rate module is used to:

[0032] Call the tree search program to solve the arrangement method that can accommodate the largest total volume of packaging boxes in a single subspace, and construct the smallest circumscribed cuboid of the overall shape of all packaging boxes under the arrangement method;

[0033] Calculate the product of the length of the circumscribed minimum cuboid and the height and width of the single subspace to obtain the actual space occupied by the arrangement;

[0034] The number of packaging boxes in the arrangement mode is determined, and the ratio of the product of the number of packaging boxes and the volume of a single packaging box to the size of the actually occupied space is used as the loading rate of the single subspace.

[0035] Optionally, the loading rate module is further used to:

[0036] The length of the single subspace is updated based on the length of the circumscribed minimum cuboid.

[0037] Optionally, the segmentation scheme module is used to:

[0038] A segmentation program is called to segment the space size into a plurality of subspaces of different lengths along the length direction of the loading box; wherein the height and width of the subspace are equal to the height and width of the loading box, and the length is less than the length of the loading box.

[0039] Optionally, the segmentation scheme module is used to:

[0040] Use the binary method to divide the space size of the loading box to obtain a division scheme of the first subspace; wherein the length of the first subspace is half of the length of the loading box;

[0041] The space size of the first subspace is divided to obtain a division scheme of the second subspace; wherein the length of the second subspace is half of the length of the first subspace;

[0042] The above binary division method is repeated until the size of the divided subspace is smaller than the volume of a single packaging box, thereby obtaining a variety of subspace division schemes of different lengths.

[0043] Optionally, the packing solution module is used to:

[0044] Calculate the quotient of the length of the carrying box and the length of the target subspace, and in response to the quotient being an integer, divide the space size of the carrying box into the quotient number of cyclic units; or

[0045] In response to the quotient not being an integer, the quotient is rounded down to obtain the number of circulating units, and the remaining space size is calculated by subtracting the space size of all circulating units from the space size of the loading box;

[0046] Determine whether the remaining space is smaller than the size of the packaging box; wherein the size of the packaging box is the set of edges of the packaging box placed along the length direction of the loading box within the preset constraint condition;

[0047] If it is less than, the actual number of cyclic units is determined to be the number minus 1, the sum of the remaining space size and the space size of a target subspace is used as the new remaining space size, and the tree search program is called to solve the packaging box placement method for the new remaining space size; or

[0048] If it is greater than or equal to, the actual number of circulation units is determined to be the said number, and the tree search program is called to solve the packaging box placement method of the said remaining space size.

[0049] To achieve the above objective, according to another aspect of an embodiment of the present invention, a boxed electronic device is provided.

[0050] The electronic device of the embodiment of the present invention includes: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement any of the above-mentioned packing methods.

[0051] To achieve the above objective, according to another aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, any of the above-mentioned packing methods is implemented.

[0052] According to the solution provided by the present invention, one embodiment of the above invention has the following advantages or beneficial effects: the placement of the packaging box is not optimized based on the entire loading box, but the entire loading box is divided into multiple units, and the placement of the packaging box is optimized in each unit. The packaging boxes in the circulation unit are placed in exactly the same way, thereby simplifying the work of on-site staff, and only a small-scale structure needs to be repetitively built, thereby improving the efficiency of packing work.

[0053] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0055] Figure 1 is a schematic diagram of the main process of a packing method according to an embodiment of the present invention;

[0056] Figure 2 It is a schematic diagram of the loading box and the segmented subspace;

[0057] Figure 3 is a schematic diagram of a specific packing process of an embodiment of the present invention;

[0058] Figure 4 is a schematic diagram of main modules of a box packing device according to an embodiment of the present invention;

[0059] Figure 5 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0060] Figure 6 It is a schematic diagram of the structure of a computer system of a mobile device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0061] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0062] It should be noted that the embodiments and features of the embodiments of the present invention can be combined with each other without conflict. The acquisition, storage, use, and processing of data in the technical solution of this application are in compliance with the relevant provisions of national laws and regulations.

[0063] See also Figure 1 , which shows a main flow chart of a packing method provided by an embodiment of the present invention, comprising the following steps:

[0064] S101: receiving a packing request for a loading box, querying the space size of the loading box according to the loading box identifier in the packing request, calling a segmentation program to segment the space size, and obtaining multiple subspace segmentation schemes;

[0065] S102: calculating the loading rate of each subspace segmentation scheme according to the packaging box placement method of each subspace segmentation scheme, so as to select the target subspace segmentation scheme with the highest loading rate;

[0066] S103: Taking the target subspace in the target subspace segmentation scheme as a segmentation unit, segmenting the space size, combining the corresponding packaging box placement method, generating a packing scheme and returning it.

[0067] In the above implementation, for step S101, this solution is mainly applicable to the bulk cargo transportation scenario, but it can also be extended to other scenarios with similar characteristics. Different from the scenarios considered by the current general packing algorithms, in many common practical situations, the types of packaging boxes are often limited, especially in the scenario of bulk cargo transportation, generally a loading box only loads one type of cargo. Among them, the loading box is a box used to load items, such as a container or a carriage.

[0068] Taking advantage of this feature, this solution proposes a packing solution based on a circulation unit to solve the packing problem in bulk cargo transportation scenarios. In order to improve the operability of the packing solution, this solution does not optimize the placement of the packaging boxes based on the entire loading box, but divides the entire loading box into multiple units, and optimizes the placement of the packaging boxes in each unit. The packaging boxes in the circulation unit are placed in exactly the same way, thereby simplifying the work of on-site staff. Only a small-scale structure needs to be repeatedly built to improve work efficiency. It should be noted that the size and shape of the packaging boxes in this solution are the same, but there is no restriction on the size and shape of the loading box, which is usually a rectangular parallelepiped.

[0069] The overall implementation process of this solution is divided into two parts: 1) obtain multiple subspace segmentation schemes through the segmentation program, determine the target subspace segmentation scheme with the largest loading rate, and divide the loading box into multiple units; 2) solve the placement of the packaging box in each unit. Solving the placement of packaging boxes in a given space is already a relatively mature technology. There are many solutions, such as using integer programming algorithms to find exact solutions, using intelligent optimization methods such as genetic algorithms to find approximate optimal solutions, setting heuristic algorithms (such as tree search algorithms) according to the nature of the problem, etc. There are also some studies that use pointer networks combined with deep reinforcement learning to solve.

[0070] The existing methods are to solve general problems, while this solution is to improve production efficiency in scenarios with special business restrictions. It mainly focuses on how to split the space of the loading box into multiple units. As for the placement of the packaging boxes in the unit, a relatively reliable tree search algorithm is preferred to optimize the placement of the packaging boxes in a given space.

[0071] The specific process of determining the target subspace segmentation scheme is as follows:

[0072] 1. Get the length, width and height L, W, H of the loading box and the length, width and height l, w, h of the packaging box

[0073] 2. To find the best partition of the loading box space, this scheme adopts a search method, that is, to generate several candidate partitioning methods and obtain multiple subspace partitioning schemes. Initialize the loading rate FR=0.

[0074] See also Figure 2 As shown, a subspace with a length, width and height of L', W, H is cut out from the loading box with a length, width and height of L, W, H. A tree search algorithm is used to solve the arrangement method that can accommodate the maximum total volume of the packaging boxes in the subspace.

[0075] It should be noted that although it is theoretically possible to split along the height or width direction, the length of the loading box is usually much greater than the width and height, and the handling freedom is higher, so it is preferred to split along the length direction. In addition, in the actual packing process, it is also preferred to place the packaging box at the innermost part of the loading box, and then gradually place it outward. If it is placed in the width or height direction first, it will cause certain difficulties in the follow-up, such as the aisle left is too narrow, or the ground is covered with goods, and the on-site staff cannot enter the loading box. Therefore, splitting along the length direction is more practical.

[0076] In the process of generating different subspace segmentation schemes, this scheme preferably uses the binary search method, that is, the length of the subspace generated for the first time is L'=L / 2, the length of the subspace generated for the second time is L"=L / 4, and so on, until the subspace generated at the end can no longer accommodate the packaging box.

[0077] 3. After solving the packaging box placement method of the subspace partitioning solution, calculate the circumscribed minimum cuboid of the overall shape of all packaging boxes in this placement method. Because after optimizing the placement of packaging boxes in the subspace, they may not occupy the entire subspace, the minimum circumscribed cuboid is used to determine the actual size of the space that the packaging boxes can occupy. The remaining space in the subspace that is not occupied by the packaging boxes is the space that cannot be used any more.

[0078] Assuming that the length, width and height of the minimum circumscribed cuboid are L0, W0 and H0 respectively, and considering that the stacked boxes cannot exceed the boundary of the subspace, L0≤L', W0≤W, H0≤H must be satisfied. At the same time, since the total volume of all boxes needs to be maximized in the process of solving the placement method, if the boxes are stacked in this way, no other boxes can be placed in the width and height directions. In the length direction, since there is no actual boundary restriction, the subspace that is not fully occupied can continue to be used in the process of placing other boxes.

[0079] Therefore, the actual space occupied by these boxes is L0×W×H. Assuming that this arrangement can stack n boxes in this subspace, the loading rate of this subspace partitioning scheme is:

[0080]

[0081] 4. During the execution of this scheme, it is necessary to generate subspace partitioning schemes of different lengths, that is, different lengths L', and calculate the loading rate of each subspace partitioning scheme according to the above steps, and select the target subspace partitioning scheme that can achieve the highest loading rate.

[0082] Taking the above subspace L' as an example, assuming that its subspace segmentation scheme is adopted, in order to further load more packaging boxes in the loading box, it is preferred to replace the length of the subspace L' with L0 based on the length L0 of the circumscribed smallest cuboid. Since the packaging boxes in each L0×W×H subspace are placed in exactly the same way, each L0×W×H subspace can also be called a segmentation unit.

[0083] The loading box space is divided into multiple units according to the division unit. If L / L' is an integer, the loading box with a length of L will be divided into L / L' circulation units with a length of L', and each circulation unit will use the same packaging box placement method, and the loading rate of each placement method is FR'.

[0084] 5. Assuming the target subspace partitioning scheme with the highest loading rate, the length of the smallest cuboid circumscribing all packaging boxes in the target subspace is Calculate the total amount of space that can be accommodated in the loading box loop units, where int means rounding down, and each loop unit is placed according to the corresponding packaging box placement method.

[0085] 1) When it is an integer, the space of the loading box is divided into cycle units;

[0086] 2) When L / L'0 is not an integer, it is necessary to determine whether the remaining space can be used alone to plan the placement of packaging boxes again. The remaining space size is Determine the relationship between the remaining space and min{feasible(l,w,h)}:

[0087] ① This means that the remaining space is not large enough to accommodate the packaging box. The cycle units are arranged according to the solved packaging box arrangement, and the original remaining space and a target subspace are separately planned as the new remaining space;

[0088] ② It means that the remaining space can accommodate the packaging box. The circulation units are placed according to the solved packaging box placement method, and the remaining space is planned separately.

[0089] The above feasible(l,w,h) function represents the set of edges of the packaging box that can be placed along the length L of the loading box within the range allowed by the preset constraints. If the packaging boxes can only be placed on the l×w plane, then feasible(l,w,h)={l,w}.

[0090] In this solution, before the on-site operator performs the packing operation, the client can initiate a packing request to the server. The packing request carries the identification of the packing box. The server can obtain the space size of the packing box from the database based on the identification. The space sizes of different packing boxes may be different. After determining the target subspace segmentation scheme and the packaging box placement method of the target subspace according to the above steps 1 to 5, a packing scheme is generated and returned to the client, so that the on-site operator can perform the packing operation according to the packing scheme.

[0091] The method provided in the above embodiment takes the bulk cargo transportation scenario as an example, divides the loading box into multiple circulation units and remaining space, the circulation units use the same packaging box placement method, and the remaining space is solved separately using a tree search algorithm, thereby improving practical feasibility, improving the packing efficiency of on-site operators, and optimizing the placement position and placement angle of each packaging box so that as many packages as possible can be loaded into the loading box.

[0092] See also Figure 3 FIG. 1 is a schematic diagram of a specific packing process according to an embodiment of the present invention, which includes the following steps:

[0093] 1. Get the length, width and height L, W, H of the loading box and the length, width and height l, w, h of the packaging box

[0094] 2. Initialize the loading rate FR = 0, use the binary method to split along the direction of the loading box L, and obtain the first subspace splitting scheme; wherein the length of the first subspace L' = L / 2, and the height and width are equal to the height and width of the loading box;

[0095] 3. Use the tree search algorithm to find the arrangement of the packaging boxes with the largest total volume that can be accommodated in the first subspace with length, width and height L', W, H, and construct the circumscribed minimum cuboid corresponding to the arrangement;

[0096] 4. Get the length, width and height of the smallest external cuboid, L0, W0, and H0. Since the smallest external cuboid cannot accommodate any more boxes in height and width, but can accommodate them in length, the actual space occupied by the smallest external cuboid is L0×W×H.

[0097] 5. Assuming that the circumscribed minimum cuboid contains a total of n packaging boxes, the loading rate of the first subspace partitioning scheme is:

[0098]

[0099] 6. If the loading rate FR1 of the first subspace partitioning scheme is greater than the initial loading rate FR, update:

[0100]

[0101] 7. Continue to use the binary division method to divide the first subspace along the length direction to obtain the second subspace division scheme; wherein the length of the second subspace L" = L / 4, and the height and width are equal to the height and width of the loading box;

[0102] 8. If L”≥min{feasible(l,w,h)}, repeat steps 3-7 until the size of the segmented subspace is smaller than the volume of a single packaging box, and select the target subspace segmentation scheme with the highest loading rate;

[0103] 9. Use the target subspace in the target subspace segmentation scheme as the segmentation unit to segment the space of the loading box to obtain multiple units. First, determine the size of the remaining space. The size relationship with min{feasible(l,w,h)}, the feasible(l,w,h) function represents the set of edges of the packaging box that can be placed along the length L of the loading box within the range allowed by the constraints:

[0104] 1) If Then Each unit places the boxes according to the box placement method of the target subspace segmentation scheme;

[0105] 2) If Then Each unit places the boxes according to the box placement method of the target subspace segmentation scheme;

[0106] 10. Use the tree search algorithm to plan the way to place the boxes in the loading box space except for the circulation unit, and place the loading boxes in the remaining space according to this method.

[0107] See also Figure 4 , showing a schematic diagram of main modules of a packing device 400 provided in an embodiment of the present invention, including:

[0108] The segmentation scheme module 401 is used to receive a packing request for a loading box, query the space size of the loading box according to the loading box identifier in the packing request, call a segmentation program to segment the space size, and obtain multiple subspace segmentation schemes;

[0109] The loading rate module 402 is used to calculate the loading rate of each subspace segmentation scheme according to the packaging box placement mode of each subspace segmentation scheme, so as to screen out the target subspace segmentation scheme with the highest loading rate;

[0110] The packing solution module 403 is used to divide the space size by taking the target subspace in the target subspace segmentation solution as the segmentation unit, and generate and return a packing solution in combination with the corresponding packaging box placement method.

[0111] In the implementation device of the present invention, the loading rate module 402 is used to:

[0112] Call the tree search program to solve the arrangement method that can accommodate the largest total volume of packaging boxes in a single subspace, and construct the smallest circumscribed cuboid of the overall shape of all packaging boxes under the arrangement method;

[0113] Calculate the product of the length of the circumscribed minimum cuboid and the height and width of the single subspace to obtain the actual space occupied by the arrangement;

[0114] The number of packaging boxes in the arrangement mode is determined, and the ratio of the product of the number of packaging boxes and the volume of a single packaging box to the size of the actually occupied space is used as the loading rate of the single subspace.

[0115] In the implementation device of the present invention, the loading rate module 402 is also used for:

[0116] The length of the single subspace is updated based on the length of the circumscribed minimum cuboid.

[0117] In the implementation device of the present invention, the segmentation scheme module 401 is used to:

[0118] A segmentation program is called to segment the space size into a plurality of subspaces of different lengths along the length direction of the loading box; wherein the height and width of the subspace are equal to the height and width of the loading box, and the length is less than the length of the loading box.

[0119] In the implementation device of the present invention, the segmentation scheme module 401 is used to:

[0120] Use the binary method to divide the space size of the loading box to obtain a division scheme of the first subspace; wherein the length of the first subspace is half of the length of the loading box;

[0121] The space size of the first subspace is divided to obtain a division scheme of the second subspace; wherein the length of the second subspace is half of the length of the first subspace;

[0122] The above binary division method is repeated until the size of the divided subspace is smaller than the volume of a single packaging box, thereby obtaining a variety of subspace division schemes of different lengths.

[0123] In the implementation device of the present invention, the packing solution module 403 is used to:

[0124] Calculate the quotient of the length of the carrying box and the length of the target subspace, and in response to the quotient being an integer, divide the space size of the carrying box into the quotient number of cyclic units; or

[0125] In response to the quotient not being an integer, the quotient is rounded down to obtain the number of circulating units, and the remaining space size is calculated by subtracting the space size of all circulating units from the space size of the loading box;

[0126] Determine whether the remaining space is smaller than the size of the packaging box; wherein the size of the packaging box is the set of edges of the packaging box placed along the length direction of the loading box within the preset constraint condition;

[0127] If it is less than, the actual number of cyclic units is determined to be the number minus 1, the sum of the remaining space size and the space size of a target subspace is used as the new remaining space size, and the tree search program is called to solve the packaging box placement method for the new remaining space size; or

[0128] If it is greater than or equal to, the actual number of circulation units is determined to be the said number, and the tree search program is called to solve the packaging box placement method of the said remaining space size.

[0129] In addition, the specific implementation content of the device described in the embodiment of the present invention has been described in detail in the method described above, so the repeated content will not be described again here.

[0130] Figure 5 An exemplary system architecture 500 to which embodiments of the present invention may be applied is shown, including terminal devices 501 , 502 , 503 , a network 504 and a server 505 (only an example).

[0131] Terminal devices 501, 502, 503 can be various electronic devices with display screens and supporting web browsing, and various communication client applications are installed. Users can use terminal devices 501, 502, 503 to interact with server 505 through network 504 to receive or send messages, etc.

[0132] The network 504 is used to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. The network 504 may include various connection types, such as wired, wireless communication links or optical fiber cables.

[0133] The server 505 may be a server that provides various services. It should be noted that the method provided in the embodiment of the present invention is generally executed by the server 505 , and accordingly, the device is generally set in the server 505 .

[0134] It should be understood that Figure 5 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0135] Reference below Figure 6, which shows a schematic diagram of the structure of a computer system 600 of a terminal device suitable for implementing an embodiment of the present invention. Figure 6 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0136] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage part 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0137] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.

[0138] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the system of the present invention are executed.

[0139] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0140] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0141] The modules involved in the embodiments of the present invention may be implemented in software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes a segmentation scheme module, a loading rate module, and a packing scheme module. The names of these modules do not constitute a limitation on the modules themselves in some cases, for example, the packing scheme module may also be described as a "final packing scheme generation module".

[0142] As another aspect, the present invention further provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device executes any of the above-described packaging methods.

[0143] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A packing method, characterized in that: include: receiving a packing request for a loading box, querying the space size of the loading box according to the loading box identifier in the packing request, calling a segmentation program to segment the space size, and obtaining multiple subspace segmentation schemes; According to the packaging box placement method for each subspace segmentation scheme, the loading rate of each subspace segmentation scheme is calculated to screen out the target subspace segmentation scheme with the highest loading rate; The target subspace in the target subspace segmentation scheme is used as a segmentation unit to segment the space size, and a packing scheme is generated and returned in combination with the corresponding packaging box placement method; wherein the target subspace in the target subspace segmentation scheme is used as a segmentation unit to segment the space size, including: Calculate the quotient of the length of the carrying box and the length of the target subspace, and in response to the quotient being an integer, divide the space size of the carrying box into the quotient number of cyclic units; or In response to the quotient not being an integer, the quotient is rounded down to obtain the number of circulating units, and the remaining space size is calculated by subtracting the space size of all circulating units from the space size of the loading box; Determine whether the remaining space is smaller than the size of the packaging box; wherein the size of the packaging box is the set of edges of the packaging box placed along the length direction of the loading box within the preset constraint condition; If it is less than, the actual number of cyclic units is determined to be the number minus 1, the sum of the remaining space size and the space size of a target subspace is used as the new remaining space size, and the tree search program is called to solve the packaging box placement method for the new remaining space size; or If it is greater than or equal to, the actual number of circulation units is determined to be the said number, and the tree search program is called to solve the packaging box placement method of the said remaining space size.

2. The method according to claim 1, characterized in that The step of calculating the loading rate of each subspace segmentation scheme according to the packaging box placement mode of each subspace segmentation scheme includes: Call the tree search program to solve the arrangement method that can accommodate the largest total volume of packaging boxes in a single subspace, and construct the smallest circumscribed cuboid of the overall shape of all packaging boxes under the arrangement method; Calculate the product of the length of the circumscribed minimum cuboid and the height and width of the single subspace to obtain the actual space occupied by the arrangement; The number of packaging boxes in the arrangement mode is determined, and the ratio of the product of the number of packaging boxes and the volume of a single packaging box to the size of the actually occupied space is used as the loading rate of the single subspace.

3. The method according to claim 2, characterized in that Also includes: The length of the single subspace is updated based on the length of the circumscribed minimum cuboid.

4. The method according to any one of claims 1 to 3, characterized in that The calling segmentation program is used to segment the space size to obtain a plurality of subspace segmentation schemes, including: A segmentation program is called to segment the space size into a plurality of subspaces of different lengths along the length direction of the loading box; wherein the height and width of the subspace are equal to the height and width of the loading box, and the length is less than the length of the loading box.

5. The method according to claim 4, characterized in that The partitioning scheme of partitioning the space size into multiple subspaces of different lengths includes: Use the binary method to divide the space size of the loading box to obtain a division scheme of the first subspace; wherein the length of the first subspace is half of the length of the loading box; The space size of the first subspace is divided to obtain a division scheme of the second subspace; wherein the length of the second subspace is half of the length of the first subspace; The above binary division method is repeated until the size of the divided subspace is smaller than the volume of a single packaging box, thereby obtaining a variety of subspace division schemes of different lengths.

6. A packing device, characterized in that: include: A segmentation scheme module is used to receive a packing request for a loading box, query the space size of the loading box according to the loading box identifier in the packing request, call a segmentation program to segment the space size, and obtain multiple subspace segmentation schemes; The loading rate module is used to calculate the loading rate of each subspace segmentation scheme according to the packaging box placement method of each subspace segmentation scheme, so as to screen out the target subspace segmentation scheme with the highest loading rate; The packing scheme module is used to divide the space size by taking the target subspace in the target subspace segmentation scheme as the segmentation unit, generate a packing scheme and return it in combination with the corresponding packaging box placement method; wherein, dividing the space size by taking the target subspace in the target subspace segmentation scheme as the segmentation unit includes: Calculate the quotient of the length of the carrying box and the length of the target subspace, and in response to the quotient being an integer, divide the space size of the carrying box into the quotient number of cyclic units; or In response to the quotient not being an integer, the quotient is rounded down to obtain the number of circulating units, and the remaining space size is calculated by subtracting the space size of all circulating units from the space size of the loading box; Determine whether the remaining space is smaller than the size of the packaging box; wherein the size of the packaging box is the set of edges of the packaging box placed along the length direction of the loading box within the preset constraint condition; If it is less than, the actual number of cyclic units is determined to be the number minus 1, the sum of the remaining space size and the space size of a target subspace is used as the new remaining space size, and the tree search program is called to solve the packaging box placement method for the new remaining space size; or If it is greater than or equal to, the actual number of circulation units is determined to be the said number, and the tree search program is called to solve the packaging box placement method of the said remaining space size.

7. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 5.

8. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images