Considering the logistics packing method of tilted and diagonal placement

Abstract

The present invention relates to the technical field of packing problem optimization, and in particular to a logistics packing method that takes into account oblique placement and diagonal placement. The logistics packing method proposed by the present invention can quickly and accurately calculate the target packaging material box type with the minimum volume according to the given cargo type and quantity, and at the same time give the optimal placement position and angle direction of each cargo in the box type; the present invention uses a hybrid algorithm that combines mathematical precision solution and heuristic algorithm to solve the loading problem in this method to improve the solution efficiency. Through this algorithm, the present invention can also find the optimal layout solution that allows more cargo to be compactly arranged on the basis of making full use of the space in all directions inside the packaging material, and can complete the transportation with a smaller box, thereby improving the loading efficiency and greatly reducing the manpower and time costs.

Description

Technical Field

[0001] The present invention relates to the technical field of packing problem optimization, and in particular to a logistics packing method taking into account inclined placement and diagonal placement. Background Art

[0002] In the process of the development of e-commerce platforms and the logistics industry, logistics and transportation involve many key issues, including container selection and cargo packing. Selecting the appropriate container type and a reasonable packing plan can not only significantly improve the effective utilization of container space, but also help reduce unnecessary waste of cartons, thereby effectively reducing transportation costs and material waste; in addition, these measures can also greatly improve the packing efficiency of workers, avoid frequent adjustments to the position of goods, and save valuable time. Therefore, in-depth research on three-dimensional packing problems and container selection problems is not only of great value in theory, but also has broad application prospects in practical operations.

[0003] In the logistics packing process, the goods of each order usually need to be placed in the same cargo box for delivery. The goal is to select the most suitable cargo box and determine the placement and direction of each piece of goods to maximize the loading rate and minimize the cost of packing. In actual scenarios, it mainly relies on manual selection of the packaging box type of the goods and manual determination of the placement method of the goods, as well as the use of a three-dimensional packing algorithm that only considers orthogonal placement. Manual selection of the box type generally tends to choose a larger box type so that the goods can be fully placed, and the three-dimensional packing algorithm that only considers orthogonal placement may often require a larger packaging box type to fully place the goods due to the limitation of the direction of the goods placement; in the process of logistics packaging, many goods are relatively light in weight, and the goods and packaging materials can be regarded as rigid bodies. The tilted and diagonal placement of the goods will not affect the appearance of the goods and packaging materials, and the goods do not need a complete bottom contact surface to be placed. For the single-box three-dimensional packing problem, most of the existing algorithms only consider the orthogonal placement of the goods, and there are relatively few studies on the three-dimensional packing problem considering tilted and diagonal placement.

[0004] At present, the relevant technology mainly adopts an orthogonal placement method for rectangular goods, that is, when placing the goods in the packaging material, its edge is parallel to the edge of the packaging material, and the goods are not allowed to be placed in an inclined or diagonal manner. However, this traditional placement method usually cannot make the most of the space inside the packaging material, resulting in the need to use larger packaging materials when loading a group of goods, which not only increases the transportation and storage costs, but also brings inconvenience to customers; on the other hand, since loading goods usually produces a large number of gaps inside the packaging material, in order to ensure the safety of transportation and prevent the goods from moving during transportation, fillers need to be added to the packaging material, which not only increases the material cost, but also requires additional labor costs and time investment. If there are still many gaps in the packaging box, the displacement and collision of the goods during transportation may be more frequent, which will cause damage to the goods and cause unnecessary losses.

[0005] Therefore, it is necessary to propose a new logistics packing method that considers inclined placement and diagonal placement to solve the above problems. Summary of the invention

[0006] The present invention provides a logistics packing method taking into account inclined placement and diagonal placement, aiming to solve the problem of low space utilization caused by failure to consider specific constraints in the prior art on the logistics packing problem.

[0007] The present invention specifically provides a logistics packing method considering inclined placement and diagonal placement, and the logistics packing method comprises the following steps:

[0008] S1. Inputting a set of size data of goods and a set of size data of boxes for loading the goods;

[0009] S2, sort all boxes from small to large in volume;

[0010] S3, select the box with the smallest volume from the unselected boxes as the planning box, and start the logistics packing planning;

[0011] S4, determine whether the total volume of all goods is less than the volume of the planned box, if so, execute step S5; if not, return to step S3;

[0012] S5, determining whether all goods can be loaded into the planned box by orthogonal placement, if so, executing step S10; if not, executing step S6;

[0013] S6, determining whether there are any preset first type goods among all goods that need to be placed diagonally, if so, rotating the preset first type goods to the diagonal placement position, and calculating the enveloping cuboid of the diagonal placement position corresponding to the orthogonal placement position, and then executing step S7; if not, directly executing step S7;

[0014] S7, determining whether there are any preset second type goods among all goods that need to be placed obliquely, if so, rotating the preset second type goods to the oblique placement position, and calculating the enveloping cuboid of the oblique placement position corresponding to the orthogonal placement position, and then executing step S8; if not, directly executing step S8;

[0015] S8. Calculate the volume of the goods corresponding to all enveloping cuboids;

[0016] S9, determining whether all goods corresponding to the enveloping cuboids can be completely loaded into the planned box, if so, executing step S10; if not, returning to step S3;

[0017] S10, solving an orthogonal placement plan according to a preset single-box loading algorithm based on the goods that can be orthogonally placed;

[0018] S11, determine whether all the goods in the orthogonal placement plan are loaded into the planned box. If so, output the orthogonal placement plan and perform logistics packing according to the orthogonal placement plan; if not, return to step S3.

[0019] Furthermore, the logistics packing planning has the following constraints:

[0020] All goods are placed in a supported manner and will not move or rotate after being placed;

[0021] Any cargo is placed in a way that does not cause any cargo or box to deform;

[0022] Except for goods that need to be placed tilted or diagonally, all goods can only be placed orthogonally.

[0023] Furthermore, the preset single-box loading algorithm includes the following steps:

[0024] S101, determining the remaining volume of the planned box after loading all the goods corresponding to the enveloping cuboids, and the respective volumes of the goods that can be orthogonally placed;

[0025] S102, using a greedy forward tree search algorithm to find an initial solution for loading the goods in the planned box according to the remaining volume and the orthogonally placed goods;

[0026] S103, determining whether the greedy forward tree search algorithm has obtained an initial solution, if so, executing step S104; if not, initializing a preset precise solution algorithm, and executing step S105;

[0027] S104, inputting the initial solution into the preset precise solution algorithm;

[0028] S105, solving a feasible solution for the position and direction of the orthogonally placed goods according to the preset accurate solution algorithm;

[0029] S106: Output the feasible solution as the orthogonal placement solution.

[0030] Furthermore, in step S102, the process of using the greedy forward tree search algorithm to solve the initial solution is specifically as follows:

[0031] Select the remaining volume of the planned box, select the largest cargo from the cargo to be orthogonally placed and place it in a corner of the planned box, and place the cargo in order from large to small in volume until all the cargo are placed closely in the planned box or the remaining volume is no longer sufficient to place cargo.

[0032] Furthermore, in step S105, if the preset precise solution algorithm cannot solve the feasible solution, step S10 is terminated and the process returns to step S3.

[0033] Furthermore, the preset precise solution algorithm is used to load all the goods in the planned box f as much as possible, and the preset precise solution algorithm is specifically:

[0034] max f=∑ i∈m flag i ;

[0035]

[0036] Among them, m represents the number of goods that need to be placed orthogonally, flag i Place parameters for goods, flag i =1 means cargo i is placed, flag i =0 means that cargo i has not been placed.

[0037] Furthermore, the length, width, and height of the planned box are defined as L, W, and H respectively; the length, width, and height of the planned box are defined as the x-axis, y-axis, and z-axis directions respectively to establish a coordinate system; each cargo has N placement directions, and the lengths of the placement direction n∈[1, N] of cargo i∈[1, m] on the x-axis, y-axis, and z-axis are respectively Defining 0-1 variables Indicates whether the item i is placed in the placement direction n. If so, then otherwise Defining 0-1 variables Indicates whether the item i is completely placed in the maximum remaining space k of the planned box. If so, then otherwise Define M as a positive infinite number; take the positive direction of the x-axis as the right direction, the positive direction of the y-axis as the forward direction, and the positive direction of the z-axis as the upward direction. The coordinates of the lower left corner of the planned box are (0, 0, 0), and the lower left coordinates of the cargo i are (x i ,y i , z i ); The coordinates of the lower left point after the maximum remaining space k are (X k , Y k , Z k ), length k is the length of the maximum remaining space k, width k is the width and height of the maximum remaining space k k is the height of the maximum remaining space k;

[0038] The preset exact solution algorithm has the following constraints:

[0039] There is only one placement direction for goods:

[0040]

[0041] The placement of goods cannot exceed the boundaries of the planned box:

[0042]

[0043]

[0044]

[0045]

[0046]

[0047]

[0048] Different goods cannot overlap:

[0049]

[0050]

[0051]

[0052]

[0053]

[0054]

[0055] There is at least one relative position relationship between any two goods:

[0056]

[0057] Among them, left ij is a 0-1 variable, left ij =1 means that item i is placed to the left of item j, front ij is a 0-1 variable, front ij =1 means that item i is placed in front of item j, above ij is a 0-1 variable, above ij =1 means that item i is placed on top of item j;

[0058]

[0059]

[0060]

[0061]

[0062]

[0063]

[0064] Each pair of up-down, left-right, front-back position relationships between goods i and goods j cannot exist at the same time:

[0065]

[0066]

[0067]

[0068] The orthogonally placed goods are completely placed into a maximum remaining space k:

[0069]

[0070]

[0071]

[0072]

[0073]

[0074]

[0075]

[0076]

[0077] The beneficial effect achieved by the present invention is that a logistics packing method considering inclined placement and diagonal placement is proposed, and the method can quickly and accurately calculate the target packaging box type with the minimum volume according to the given cargo type and quantity, and at the same time give the optimal placement position and angle direction of each cargo in the box type; the present invention uses a hybrid algorithm combining a mathematical precise solution method and a heuristic algorithm to solve the loading problem in this method to improve the solution efficiency. Through this algorithm, the present invention can also find the optimal layout solution for compactly arranging more cargoes on the basis of making full use of the space in all directions inside the packaging material, and can complete the transportation with a smaller box, thereby improving the loading efficiency and greatly reducing the manpower and time costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] Figure 1 It is a schematic flow chart of the steps of a logistics packing method considering inclined placement and diagonal placement provided by an embodiment of the present invention;

[0079] Figure 2 It is a schematic diagram of a three-dimensional rectangular coordinate system obtained by modeling a planning box provided by an embodiment of the present invention;

[0080] Figure 3 This is a schematic diagram of an inclined placement of an enveloped rectangular parallelepiped of goods provided by an embodiment of the present invention;

[0081] Figure 4 is a side view schematic diagram of the placement of a cargo envelope cuboid provided by an embodiment of the present invention;

[0082] Figure 5 is a schematic side view of the maximum remaining space for tilted placement of goods provided by an embodiment of the present invention;

[0083] Figure 6 is a schematic diagram of an enveloping cuboid rotating along the z-axis when goods are placed diagonally provided by an embodiment of the present invention;

[0084] Figure 7 This is a schematic diagram of diagonally placing a single cargo provided by an embodiment of the present invention;

[0085] Figure 8 It is a schematic diagram of generating the maximum remaining space by placing a single cargo diagonally provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0086] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0087] Please refer to Figure 1 , Figure 1 1 is a schematic flow chart of the steps of a logistics packing method considering inclined placement and diagonal placement provided by an embodiment of the present invention, the method comprising the following steps:

[0088] S1. Inputting a set of size data of goods and a set of size data of boxes used to load the goods.

[0089] S2. Sort all boxes by volume from small to large.

[0090] S3. Select the box with the smallest volume from the unselected boxes as the planning box and start the logistics packing planning.

[0091] The logistics packing planning has the following constraints:

[0092] All goods are placed in a supported manner and will not move or rotate after being placed;

[0093] Any cargo is placed in a way that does not cause any cargo or box to deform;

[0094] Except for goods that need to be placed tilted or diagonally, all goods can only be placed orthogonally.

[0095] S4. Determine whether the total volume of all goods is less than the volume of the planned box. If so, execute step S5; if not, return to step S3.

[0096] S5. Determine whether all goods can be loaded into the planned box by orthogonal placement. If so, execute step S10; if not, execute step S6.

[0097] S6. Determine whether there are any preset first type goods among all the goods that need to be placed diagonally. If so, rotate the preset first type goods to the diagonal placement position, and calculate the enveloping cuboid of the diagonal placement position corresponding to the orthogonal placement position, and then execute step S7; if not, directly execute step S7.

[0098] S7. Determine whether there are any preset second type goods among all the goods that need to be placed at an angle. If so, rotate the preset second type goods to an inclined placement position, and calculate the enveloping cuboid of the inclined placement position corresponding to the orthogonal placement position, and then execute step S8; if not, directly execute step S8.

[0099] S8. Calculate the volume of the goods corresponding to all enveloping cuboids.

[0100] S9, determine whether the goods corresponding to all the enveloping cuboids can be completely loaded into the planned box, if so, execute step S10; if not, return to step S3.

[0101] S10, solving an orthogonal placement plan according to a preset single-box loading algorithm based on the goods that can be orthogonally placed.

[0102] S11, determine whether all the goods in the orthogonal placement plan are loaded into the planned box. If so, output the orthogonal placement plan and perform logistics packing according to the orthogonal placement plan; if not, return to step S3.

[0103] Specifically, the preset single-box loading algorithm includes the following steps:

[0104] S101, determining the remaining volume of the planned box after loading all the goods corresponding to the enveloping cuboids, and the respective volumes of the goods that can be orthogonally placed.

[0105] S102, according to the remaining volume and the orthogonally placed goods, use the greedy forward tree search algorithm to solve the initial solution of the goods loaded in the planned box. This step is specifically by selecting the remaining volume of the planned box, selecting the largest volume of goods from the goods to be orthogonally placed and placing it in the corner of the planned box, and placing the goods in descending order according to the volume of the goods until all the goods are placed closely in the planned box, or the remaining volume cannot continue to place goods.

[0106] S103, determine whether the greedy forward tree search algorithm has found an initial solution, if so, execute step S104; if not, initialize the preset precise solution algorithm and execute step S105.

[0107] S104: Input the initial solution into the preset precise solution algorithm.

[0108] S105, solving a feasible solution for the position and direction of the orthogonally placed goods according to the preset accurate solution algorithm. If the preset accurate solution algorithm cannot solve the feasible solution, then end step S10 and return to step S3.

[0109] S106: Output the feasible solution as the orthogonal placement solution.

[0110] The preset precise solution algorithm is used to load all the goods in the planned box f as much as possible. The preset precise solution algorithm is specifically:

[0111] max f=∑ i∈m flag i ;

[0112]

[0113] Among them, m represents the number of goods that need to be placed orthogonally, flag i Place parameters for goods, flagi =1 means cargo i is placed, flag i =0 means that cargo i has not been placed.

[0114] Define the length, width and height of the planned box as L, W and H respectively; define the length, width and height of the planned box as x-axis, y-axis and z-axis respectively to establish a coordinate system; each cargo has N placement directions, and the length of the placement direction n∈[1, N] of cargo i∈[1, m] on the x-axis, y-axis and z-axis respectively Defining 0-1 variables Indicates whether the item i is placed in the placement direction n. If so, then otherwise Defining 0-1 variables Indicates whether the item i is completely placed in the maximum remaining space k of the planned box. If so, then otherwise Define M as a positive infinite number; take the positive direction of the x-axis as the right direction, the positive direction of the y-axis as the forward direction, and the positive direction of the z-axis as the upward direction. The coordinates of the lower left corner of the planned box are (0, 0, 0), and the lower left coordinates of the cargo i are (x i ,y i , z i ); The coordinates of the lower left point after the maximum remaining space k are (X k , Y k , Z k ), length k is the length of the maximum remaining space k, width k is the width and height of the maximum remaining space k k is the height of the maximum remaining space k; according to the above definition, the three-dimensional rectangular coordinate system obtained by modeling the planning box is as follows Figure 2 shown.

[0115] The preset exact solution algorithm has the following constraints:

[0116] There is only one placement direction for goods:

[0117]

[0118] The placement of goods cannot exceed the boundaries of the planned box:

[0119]

[0120]

[0121]

[0122]

[0123]

[0124]

[0125] Different goods cannot overlap:

[0126]

[0127]

[0128]

[0129]

[0130]

[0131]

[0132] There is at least one relative position relationship between any two goods:

[0133]

[0134] Among them, left ij is a 0-1 variable, left ij =1 means that item i is placed to the left of item j, front ij is a 0-1 variable, front ij =1 means that item i is placed in front of item j, above ij is a 0-1 variable, above ij =1 means that item i is placed on top of item j;

[0135]

[0136]

[0137]

[0138]

[0139]

[0140]

[0141] Each pair of up-down, left-right, front-back position relationships between goods i and goods j cannot exist at the same time:

[0142]

[0143]

[0144]

[0145] The orthogonally placed goods are completely placed into a maximum remaining space k:

[0146]

[0147]

[0148]

[0149]

[0150]

[0151]

[0152]

[0153]

[0154] More specifically, based on the above definition, the process of determining the preset first type of goods and the preset second type of goods that need to be placed obliquely or diagonally in steps S6 and S7 can be implemented based on the following method:

[0155] Define the longest side of the goods as length, the shortest side of the goods as height, and the remaining side as width. For a given box, traverse all the goods. If there is any goods whose height is greater than the height of the box, then the box cannot hold the goods and needs to be replaced with a larger box; if there is any goods whose length is greater than the length of the box and whose width is also greater than the width of the box, then the box cannot hold the goods and needs to be replaced with a larger box; if the length of the goods is greater than the length of the box, the width of the goods is less than the width of the box, and the height of the goods is less than the height of the box, then the goods need to be placed diagonally, and the calculation of whether the goods can be put in is performed by calculating the diagonal placement position of the goods; if the length of the goods is less than the length of the box, the width of the goods is greater than the width of the box, and the height of the goods is less than the height of the box, then the goods need to be placed at an angle, and the calculation of whether the goods can be put in is performed by calculating the angled placement position of the goods.

[0156] The method for calculating the position of tilted cargo and generating the maximum remaining space is as follows:

[0157] Stack all the goods that need to be tilted vertically, and use an enveloping cuboid to surround the stacked goods. This enveloping cuboid needs to have three sides in contact with the box to ensure the stability of the goods. These three sides are parallel to the x-axis and are in contact with the bottom, front and back of the box respectively. Figure 3The coordinates of each vertex of the enveloping cuboid when placed at an angle can be calculated based on the size of the enveloping cuboid and the size of the box. The side view of the enveloping cuboid is shown in Figure 4 As shown, the vertices of the enveloping cuboid are A, B, C, D, E, F, G, and H;

[0158] Let a represent the height of the highest side of the enveloping cuboid that touches the front or back of the box. Let the length of the enveloping cuboid be l, the width be w, and the height be h. By calculation, the coordinates of the vertices of the enveloping cuboid are

[0159] E(0,0,a), F(l,0,a), The length of a can be calculated using the following formula:

[0160]

[0161] The above formula can be used to calculate the height of the highest point of the cargo when it is placed obliquely: if The height of the goods when placed diagonally will exceed the height of the box, and a larger box needs to be selected. Otherwise, the goods can be loaded into the box of this specification. If the goods can be loaded into the box, several maximum remaining spaces will be generated at equal intervals along the inclined surface above and below the enveloping cuboid, as shown in the side view. Figure 5 As shown, Figure 5 The medium grey area represents the maximum remaining space generated.

[0162] The method for calculating the position of the goods placed diagonally and generating the maximum remaining space is as follows:

[0163] For each cargo that needs to be placed diagonally, first rotate it around the z-axis and keep the cargo's enveloping cuboid parallel to the cargo box, so that the length of the enveloping cuboid is equal to the length L of the box, as shown in Figure 6 After rotation, determine whether the width b of the enveloping cuboid is greater than the width of the box. If the width of the enveloping cuboid of the goods is less than or equal to the width of the box, the placement position of the goods in the current enveloping cuboid is the final placement position of the goods. If there are multiple goods placed diagonally whose widths of the enveloping cuboids after rotation are less than or equal to the width of the box, they are stacked vertically; if the width of the enveloping cuboid of the goods is greater than the width of the box, the enveloping cuboid of the goods needs to be tilted as described above. The tilted placement position of the enveloping cuboid is shown in Figure 7In the actual placement process, if there are other goods that need to be placed at an angle, all the enveloping cuboids of the goods that are placed diagonally after being rotated about the z-axis and other goods that need to be placed at an angle are stacked vertically, and then a larger enveloping cuboid is used to surround these goods that need to be placed at an angle and diagonally, and the above-mentioned tilted placement operation is performed on the larger enveloping cuboid to obtain the final placement position of all the goods in the enveloping cuboid.

[0164] The width b of the rectangular cube of the diagonally placed cargo package can be calculated by the following formula:

[0165]

[0166] Stack the enveloping cuboids of goods that need to be placed diagonally and the goods that need to be placed at an angle vertically together, and surround them with a larger enveloping cuboid. Calculate the placement and direction of these goods according to the inclined placement method, and at the same time, get the height Rh of the highest point of the goods. By comparing the height Rh of the highest point of the goods with the height H of the box, it can be determined whether the goods can be loaded in the box. If Rh≤H, the goods can be loaded in the box. Otherwise, they cannot be loaded and a larger box needs to be selected.

[0167] After the enveloping cuboid is tilted and placed in the box, the method of generating the maximum remaining space is the same as the method of generating the maximum remaining space by tilting. If there is only one item that needs to be placed diagonally, and there is no item that needs to be placed tilted, in addition to generating the maximum remaining space by tilting, the maximum remaining space must also be generated at equal intervals in front and behind the diagonally placed items. The top view is as follows Figure 8 As shown, Figure 8 The middle gray part is the maximum remaining space generated. If there are multiple goods placed diagonally, or there are goods placed diagonally in addition to the goods placed diagonally, you only need to generate the maximum remaining space according to the method for generating the diagonally placed goods.

[0168] The beneficial effect achieved by the present invention is that a logistics packing method considering inclined placement and diagonal placement is proposed, and the method can quickly and accurately calculate the target packaging box type with the minimum volume according to the given cargo type and quantity, and at the same time give the optimal placement position and angle direction of each cargo in the box type; the present invention uses a hybrid algorithm combining a mathematical precise solution method and a heuristic algorithm to solve the loading problem in this method to improve the solution efficiency. Through this algorithm, the present invention can also find the optimal layout solution for compactly arranging more cargoes on the basis of making full use of the space in all directions inside the packaging material, and can complete the transportation with a smaller box, thereby improving the loading efficiency and greatly reducing the manpower and time costs.

[0169] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. The storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM).

[0170] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0171] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, a magnetic disk, or an optical disk), and includes a number of instructions for enabling a terminal (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in each embodiment of the present invention.

[0172] The embodiments of the present invention are described above in conjunction with the accompanying drawings. What is disclosed is only the preferred embodiment of the present invention. However, the present invention is not limited to the above-mentioned specific implementation manner. The above-mentioned specific implementation manner is only illustrative rather than restrictive. Under the enlightenment of the present invention, ordinary technicians in this field can also make many forms and equivalent changes without departing from the scope of protection of the purpose of the present invention and the claims, all of which are within the protection of the present invention.

Claims

1. A logistics packing method considering inclined placement and diagonal placement, characterized in that: The logistics packing method comprises the following steps: S1, inputting a set of size data of goods and a set of size data of boxes for loading the goods; S2, sort all boxes from small to large in volume; S3. Select the box with the smallest volume from the unselected boxes as the planning box, and start the logistics packing planning. The logistics packing planning has the following constraints: All goods are placed in a supported manner and will not move or rotate after being placed; Any cargo is placed in a way that does not cause any cargo or box to deform; Except for goods that need to be placed obliquely or diagonally, all goods can only be placed orthogonally; S4, determine whether the total volume of all goods is less than the volume of the planned box, if so, execute step S5; if not, return to step S3; S5, determining whether all goods can be loaded into the planned box by orthogonal placement, if so, executing step S10; if not, executing step S6; S6, determining whether there are any preset first type goods among all goods that need to be placed diagonally, if so, rotating the preset first type goods to the diagonal placement position, and calculating the enveloping cuboid of the diagonal placement position corresponding to the orthogonal placement position, and then executing step S7; if not, directly executing step S7; S7, determining whether there are any preset second type goods among all goods that need to be placed obliquely, if so, rotating the preset second type goods to the oblique placement position, and calculating the enveloping cuboid of the oblique placement position corresponding to the orthogonal placement position, and then executing step S8; if not, directly executing step S8; S8. Calculate the volume of the goods corresponding to all enveloping cuboids; S9, determining whether all goods corresponding to the enveloping cuboids can be completely loaded into the planned box, if so, executing step S10; if not, returning to step S3; S10, solving an orthogonal placement plan according to a preset single-box loading algorithm based on the goods that can be orthogonally placed; S11, determining whether all goods in the orthogonal placement scheme are loaded into the planned box, if so, outputting the orthogonal placement scheme, and performing logistics packing according to the orthogonal placement scheme; if not, returning to step S3; The preset single-box loading algorithm includes the following steps: S101, determining the remaining volume of the planned box after loading all the goods corresponding to the enveloping cuboids, and the respective volumes of the goods that can be orthogonally placed; S102, using a greedy forward tree search algorithm to find an initial solution for loading the goods in the planned box according to the remaining volume and the orthogonally placed goods; S103, determining whether the greedy forward tree search algorithm has obtained an initial solution, if so, executing step S104; if not, initializing a preset precise solution algorithm, and executing step S105; S104, inputting the initial solution into the preset precise solution algorithm; S105, solving a feasible solution for the position and direction of the orthogonally placed goods according to the preset accurate solution algorithm; S106, outputting the feasible solution as the orthogonal placement solution; In step S102, the process of using the greedy forward tree search algorithm to solve the initial solution is specifically as follows: Select the remaining volume of the planned box, select the largest cargo from the cargo to be orthogonally placed and place it in a corner of the planned box, and place the cargo in order from large to small in volume until all the cargo are placed closely in the planned box or the remaining volume is no longer sufficient to place cargo.

2. A logistics packing method considering inclined placement and diagonal placement as claimed in claim 1, characterized in that: In step S105, if the preset precise solution algorithm cannot solve the feasible solution, then step S10 is ended and the process returns to step S3.

3. A logistics packing method considering inclined placement and diagonal placement as claimed in claim 1, characterized in that: The preset precise solution algorithm is used to load all the goods in the planned box f as much as possible. The preset precise solution algorithm is specifically: max f=∑ i∈m flag i ; s.t.flag i ∈{0,1}, Among them, m represents the number of goods that need to be placed orthogonally, flag i Place parameters for goods, flag i =1 means cargo i is placed, flag i =0 means that cargo i has not been placed.

4. A logistics packing method considering inclined placement and diagonal placement as claimed in claim 3, characterized in that: Define the length, width and height of the planned box as L, W and H respectively; define the length, width and height of the planned box as the x-axis, y-axis and z-axis directions respectively to establish a coordinate system; each cargo has N placement directions, and the lengths of the placement direction n∈[1,N] of cargo i∈[1,m] on the x-axis, y-axis and z-axis are respectively Defining 0-1 variables Indicates whether the item i is placed in the placement direction n. If so, then otherwise Defining 0-1 variables Indicates whether the item i is completely placed in the maximum remaining space k of the planned box. If so, then otherwise Define M as a positive infinite number; take the positive direction of the x-axis as the right direction, the positive direction of the y-axis as the forward direction, and the positive direction of the z-axis as the upward direction. The coordinates of the lower left corner of the planned box are (0,0,0), and the lower left coordinates of the cargo i are (x i ,y i ,z i ); The coordinates of the lower left point after the maximum remaining space k are (X k ,Y k ,Z k ), length k is the length of the maximum remaining space k, width k is the width and height of the maximum remaining space k k is the height of the maximum remaining space k; The preset exact solution algorithm has the following constraints: There is only one placement direction for goods: The placement of goods cannot exceed the boundaries of the planned box: Different goods cannot overlap: There is at least one relative position relationship between any two goods: Among them, left ij is a 0-1 variable, left ij =1 means that item i is placed to the left of item j, front ij is a 0-1 variable, front ij =1 means that item i is placed in front of item j, above ij is a 0-1 variable, above ij =1 means that item i is placed on top of item j; Each pair of up-down, left-right, front-back position relationships between goods i and goods j cannot exist at the same time: The orthogonally placed goods are completely placed into a maximum remaining space k:

Images