Box splicing method for KD export piece box splicing

Abstract

The invention is applicable to the technical field of KD export piece box splicing, and provides a box splicing method for KD export piece box splicing, which optimizes the spatial layout and improves the utilization rate by integrating the total data of standard large pieces, KD piece cartons and all levels of containers and combining intelligent technologies such as a single container box splicing strategy, a greedy algorithm and dynamic adjustment of column height; a dynamic regularization algorithm and a pole algorithm are adopted in the third-stage box splicing stage, accurate utilization of container space and accurate positioning of goods are achieved, and the box splicing efficiency is remarkably improved; meanwhile, by means of the intelligent stacking strategy, multi-angle rotation adaptation, preferential fork entering direction selection and other measures, goods damage and transportation risks are effectively prevented; and the recursion formula is used for calculating the coordinates of the insertion points, and a space verification mechanism and a weight balance factor are introduced, so that the box splicing compliance and safety are ensured, the center-of-gravity shift is limited, the transportation stability is ensured, and a safe, convenient and efficient box splicing solution is provided for the logistics transportation industry.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of KD export piece box packing, and particularly relates to a box packing method for KD export piece box packing. BACKGROUND

[0002] In recent years, the export volume of domestic cars has been increasing year by year, and bulk pieces (KD) play a key role in saving customs duties and freight and reducing costs as an important means of car export; however, the KD piece box packing process faces many challenges, making it difficult for the commonly used box packing method or software to be applicable, and the specific reasons are as follows:

[0003] 1. Complex and diverse packaging specifications: Self-made parts and purchased parts of KD pieces are provided by different units or suppliers, and the packaging specifications are diverse and miscellaneous, which makes it difficult to match during box packing, resulting in serious waste of space in the container;

[0004] 2. Many influencing factors: Car KD pieces are affected by many factors such as overseas, arrival port, and quality, size, container structure, and carrying capacity of the packaging box itself, which further increases the difficulty of box packing;

[0005] 3. Multi-level box packing interaction: KD box packing is multi-level box packing, including part into carton (first-level box packing), carton into iron wood support (second-level container, second-level box packing), and iron wood support into container (third-level container, third-level box packing), which greatly increases the difficulty of mathematical modeling;

[0006] 4. Limitations of existing box packing methods:

[0007] ①. Low efficiency of manual box packing: Currently, KD piece box packing generally adopts manual box packing, which is labor-intensive, low in efficiency, and requires high experience of workers; when a certain carton in the designed box packing scheme is out of stock, it is difficult to quickly adjust the box packing scheme, which may easily cause goods accumulation;

[0008] ②. General box packing method is not applicable: The goods packing problem (BPP) is a classic NP-hard problem in the field of logistics, and it is difficult to obtain an accurate global optimal solution; the commonly used solving algorithm has great difficulty in mathematical modeling when facing various constraints in the actual box packing process, and requires high computing resources and long time, which is not practical; some heuristic hierarchical search algorithms can quickly solve the single-container box packing problem, but they are difficult to apply to the actual multi-level and multi-container box packing;

[0009] To support overseas development, many domestic independent brand automobile manufacturers build KD packaging factories in China; therefore, it is imminent to seek a high-quality and fast KD packing method and system; the present application proposes a hierarchical multi-strategy greedy algorithm for the secondary and tertiary packing of KD packing, aiming to solve the problems of low space utilization, low efficiency, difficulty in adapting to multi-level and multi-constraints, etc. in the KD packing process, improve the packing efficiency, reduce the transportation risk, and provide a safer and more convenient solution for the logistics transportation industry. SUMMARY

[0010] The present application provides a packing method for KD export parts packing, aiming to solve the problems of complex and diverse packaging specifications, numerous influencing factors, mutual influence of multi-level packing, low efficiency of manual packing, inapplicability of general packing methods, etc. in the existing domestic automobile KD parts, leading to space waste, low efficiency, and difficulty in adapting to multi-level and multi-constraint problems.

[0011] The present application is implemented as follows: a packing method for KD export parts packing, comprising the following steps:

[0012] S1. Data arrangement: integrating the full data of standard large parts, KD part cartons, secondary containers and tertiary containers, wherein the standard large parts need to include name, outer diameter size, weight, stacking attribute, the KD part cartons need to include unique number, size, weight, rotation mode, and the containers need to include inside and outside diameter size, fork direction, carrying capacity;

[0013] S2. Tray type secondary packing:

[0014] S21. Using single container packing strategy, selecting the highest starting point or the largest bottom area of the to-be-filled space through greedy algorithm;

[0015] S22. When generating simple blocks, preferentially selecting single large blocks with a volume of > 500*500*500 or single blocks under space restrictions;

[0016] S23. Through the scoring mechanism: using the formula:

[0017] score = ((10 - len(groups)) / 10) * 0.9 + (mayh / 2540) * 0.1

[0018] Wherein groups is the group number, the calculation method is to divide the container after layering into multiple groups, each group height is as close as possible to container_3.inside_h but not more than the height, mayh is the height of the container after layering, the optimal container scheme is screened, and the space utilization rate is optimized by trying to stack high;

[0019] S3. Optimization of stacking by reverse algorithm:

[0020] S31. Group containers by stacking properties as non-stackable, inter-stackable, iron rack group, and stack within the group in descending order of height;

[0021] S32. Dynamically adjust column height:

[0022] Method 1: Stack with the same bottom area;

[0023] Method 2: Layered increase of large to small, and through the column container for the arrangement order of width → material → weight → height to improve stability;

[0024] S33. Delete single container or supplement new container to correct column height, ensure the total height close to the third level container standard;

[0025] S4. Surrounding frame type secondary consolidation:

[0026] S41. Set the initial space utilization threshold ≥ 90%, loop through the surrounding frame and carton to perform single container consolidation;

[0027] S42. Use block strategy to loop through the highest space utilization scheme, and if it fails, reduce the threshold and consolidate again;

[0028] S5. Third level consolidation:

[0029] S51. Dynamic sizing algorithm groups columns, target total length close to container length and total weight ≤ bearing, state transfer equation:

[0030] dp[i][j] = max(dp[i][j], dp[i-l k ][j-weight k ]+l k

[0031] S52. Calculate the insertion point coordinates of the column in the container using the pole algorithm, and determine the final coordinates after checking the space overlap, the insertion point coordinate formula is:

[0032] Insertionpoint = [[position x +l,position y |0],[position x |position y +w|0]]

[0033] Where i is the number of items currently considered, j is the current weight sum, l k and weight k are the length and weight of the kth item;

[0034] Where position x is the x-direction coordinate of the selected existing column, positiony is the y coordinate of the selected existing column, l is the length of the selected existing column, w is the length of the selected existing column, the insertion point is generated and the insertion point is looped.

[0035] Preferably, in the scoring mechanism of the tray type secondary consolidation:

[0036] The container quantity weight is the highest, the remaining carton quantity is the second, and the space utilization rate has the least influence;

[0037] The scoring formula is calculated by weighting the denominator, and the scheme with less container, less remaining, and high utilization rate is preferred, and the formula is:

[0038] score = 1 / (c_num+excess_box+(100-used_ratio) / 5)

[0039] Wherein c_num is the container quantity; excess_box is the remaining carton quantity; used_ratio is the container space utilization rate.

[0040] Preferably, mode 1, same bottom area stacking: requires container length and width to be completely matched, and is arranged in descending order of height and then filtered layer by layer;

[0041] Mode 2, big pressure small stacking: increase the height by interval stacking, and increase a layer of container_2.outside_h height after every N containers.

[0042] Preferably, the initial space utilization rate threshold of the frame gradually decreases from 90% to 85%, and the consolidation is re-executed every time the threshold decreases by 5%.

[0043] Successful consolidation requires space utilization rate ≥ current threshold, otherwise switch frame specifications.

[0044] Preferably, the state is defined as a two-dimensional array dp[i][j], which tracks the total length i and total weight j of the first i columns;

[0045] The boundary condition limits the total length after adding a new column to be less than the length of the container, and the total weight to be less than the upper limit of the load.

[0046] Preferably, the insertion point coordinates are calculated by a recursive formula to ensure that there is no overlap between the columns:

[0047] Insertion point = [[position x +l|positiony|0],[position x |position y +w|0]]

[0048] Wherein wherein position xis the x-direction coordinate of the selected existing column, position y is the y-direction coordinate of the selected existing column, l is the length of the selected existing column, w is the length of the selected existing column, the insertion point is generated and the insertion point is looped, and the final coordinates need to be checked by the container space to avoid exceeding the boundary or interfering with other columns.

[0049] Preferably, the stacking attribute field of the standard bulky object includes "whether stackable", "maximum number of stacking layers", "self-stacking limit";

[0050] The rotation mode field of the KD part carton supports 0°, 90°, 180°, 270° multi-angle adaptation.

[0051] Preferably, the single-container consolidation strategy further includes:

[0052] a. Prioritize the forking direction aligned with the container door direction;

[0053] b. Fragile or light bubble parts are forced to be allocated to the middle area of the container.

[0054] Preferably, the height correction logic of the stacking column includes:

[0055] a. If the column height is less than 80% of the height of the third container, a buffer layer is automatically inserted;

[0056] b. If the column height is greater than 120% of the height of the third container, the column is divided and the container is redistributed.

[0057] Preferably, the state transition equation introduces a weight balance factor to avoid local overload of the container;

[0058] The final column arrangement scheme needs to satisfy the condition that the center of gravity offset of the container is less than 3% of the total length.

[0059] Compared with the prior art, the embodiments of the present application have the following beneficial effects:

[0060] Firstly, the present application effectively optimizes the spatial layout of the consolidation process by comprehensively integrating full-quantity data of standard bulky objects, KD part cartons, containers, etc., and combining intelligent consolidation strategies such as single-container consolidation strategy, greedy algorithm, dynamic adjustment of column height, etc., and improves the space utilization rate. At the same time, through the dynamic regulation algorithm and pole algorithm of the three-stage consolidation stage, the precise utilization of container space and the precise positioning of goods are realized, and the consolidation efficiency is further improved.

[0061] Secondly, the application effectively prevents goods damage or transportation risk caused by improper stacking and improper forking direction through intelligent stacking strategy, multi-angle rotation adaptation function, priority selection of forking direction aligned with container door direction and other measures; meanwhile, the recusive formula is used to accurately calculate the insertion point coordinates, the container space checking mechanism and the automatic insertion point calculation and space checking mechanism, which greatly improves the compliance and safety of the LCL operation and reduces the risk in the transportation process; in addition, the weight balance factor is introduced in the state transition equation, and the container gravity center offset is strictly limited, which further improves the stability and reliability of the goods transportation, and provides a safer and more convenient solution for the logistics transportation industry. BRIEF DESCRIPTION OF DRAWINGS

[0062] Figure 1 is a three-level container stacking scheme schematic diagram of the application;

[0063] Figure 2 is a KD LCL process schematic diagram of the application;

[0064] Figure 3 is a stacking column grouping scheme schematic diagram of the application;

[0065] Figure 4 is a specific column splicing process schematic diagram of the application;

[0066] Figure 5 is a single container LCL process schematic diagram of the application;

[0067] Figure 6 is a two-level container LCL process schematic diagram of the application;

[0068] Figure 7 is a container pole LCL process schematic diagram of the application; DETAILED DESCRIPTION

[0069] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs; the terminology used in the specification of the application only for the purpose of describing specific embodiments, and is not intended to limit the application; the specification and claims of the application and the above description of the drawings, the terms "include" and "have" and any variations thereof, are intended to cover non-exclusive inclusion. The specification and claims of the application or the above description of the drawings, the terms "first", "second", etc. are used to distinguish different objects, and are not used to describe a specific order.

[0070] Reference to“an embodiment” herein means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase“in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are they necessarily all referring to a common embodiment, or an embodiment that is independent of other embodiments. One of ordinary skill in the art will readily recognize from the disclosure herein, that embodiments of the present application can be combined with embodiments of the other applications.

[0071] The embodiment of the application provides a method for KD export piece box splicing, as shown in the figure, comprising the following steps: Figures 1-7

[0072] S1. Data arrangement: integrate the full data of standard large pieces, KD piece cartons, secondary containers and tertiary containers, wherein the standard large pieces need to contain the name, the outer diameter size, the weight, the stacking attribute, the KD piece cartons need to contain the unique number, the size, the weight, the rotation mode, the containers need to contain the inner and outer diameter size, the forking direction, the bearing capacity;

[0073] S2. Tray type secondary splicing:

[0074] S21. A single container splicing strategy is adopted, and the starting point highest or the largest bottom area of the to-be-filled space is selected through a greedy algorithm;

[0075] S22. When generating a simple block, a single block with a volume > 500*500*500 or a single block under space restriction is preferentially selected;

[0076] S23. Through a scoring mechanism: using the formula:

[0077] score = ((10-len(groups)) / 10)*0.9+(mayh / 2540)*0.1

[0078] Wherein groups is the group number, the calculation method is to divide the container after layering into multiple groups, the height of each group is as close as possible to container_3.inside_h but not more than the height, mayh is the height of the container after layering, the optimal container scheme is screened, and the space utilization rate is tried to be optimized by increasing the height;

[0079] S3. Optimization of stacking by reverse algorithm:

[0080] S31. The containers are grouped into non-stacking, mutual stacking and iron frame group according to the stacking attribute, and are stacked in descending order of height in the same group;

[0081] S32. Dynamic adjustment of column height:

[0082] Mode 1: stacking with the same bottom area;

[0083] ​Method 2: Large pressure small layered increase, and through the column content container for the width → material → weight → height of the arrangement order to improve stability;

[0084] S33. Delete the single container or supplement the new container to correct the column height, and ensure that the total height is close to the three-level container standard;

[0085] S4. Enclosure type secondary box:

[0086] S41. Set the initial space utilization threshold ≥ 90%, and loop through the enclosure and carton to perform single container box splicing;

[0087] S42. Use block strategy to loop and select the highest space utilization scheme, and if it fails, reduce the threshold and re-splice;

[0088] S5. Three-level box splicing:

[0089] S51. Dynamic sizing algorithm groups columns, the target total length is close to the length of the container and the total weight is ≤ bearing, and the state transfer equation is:

[0090] dp[i][j] = max(dp[i][j], dp[i-l k ][j-weight k ]+l k

[0091] S52. Pole algorithm calculates the insertion point coordinates of the column in the container, and determines the final coordinates after checking the space overlap, and the insertion point coordinate formula is:

[0092] Insertionpoint = [[position x +l|position y |0],[position x |position y +w|0]]

[0093] Where i is the number of items currently considered, j is the current weight sum, l k and weight k are the length and weight of the kth item;

[0094] Where position x is the x-direction coordinate of the selected existing column, position y is the y-direction coordinate of the selected existing column, l is the length of the selected existing column, w is the length of the selected existing column, and the insertion point is generated and looped.

[0095] It should be noted that, due to the existing domestic automobile KD parts due to the complex and diverse packaging specifications, many influencing factors, multi-level consolidation mutual influence, and the existing consolidation method has the limitations of low efficiency of manual consolidation, general consolidation method is not applicable, etc., leading to space waste, low efficiency, difficult to adapt to multi-level and multi-constraint problems, the consolidation method of the scheme optimizes the space layout, improves the space utilization rate, and realizes the precise utilization of the container space and the precise positioning of the goods, thereby significantly improving the consolidation efficiency; at the same time, through the intelligent stacking strategy, multi-angle rotation adaptation and priority fork direction, etc. Measures, effectively prevent goods damage and transportation risk, combined with recursive formula accurate calculation, space verification mechanism and automatic processing, greatly improve the compliance and safety of the consolidation operation, and strictly limit the center of gravity deviation, further enhance the stability and reliability of the goods transportation, and provide a safe and convenient solution for the logistics transportation industry.

[0096] Specifically, in the data arrangement stage of the present embodiment, the method integrates the full data of standard large parts, KD part cartons, secondary containers and tertiary containers, including name, outer diameter size, weight, stacking attribute, unique number, rotation method, inner and outer diameter size, fork direction, bearing capacity and other key information, providing a solid data support for the formulation of subsequent consolidation strategy, ensuring the accuracy and efficiency of the consolidation process;

[0097] Then, in the tray type secondary consolidation stage, by adopting the single container consolidation strategy and combining with the greedy algorithm, the method can efficiently select the starting point of the largest or the bottom area of the largest to be filled space, optimizing the space layout; at the same time, when generating simple blocks, preferentially selecting large volume or single block under space constraints, further improving the space utilization rate; in addition, through the scoring mechanism to select the optimal container scheme, and try to optimize the height, ensure the economy and efficiency of the consolidation scheme;

[0098] Subsequently, in the reverse algorithm optimization stacking stage, the method groups the containers according to the stacking attribute, and adopts the strategy of dynamically adjusting the column height, effectively improving the stability and safety of the stacking; through the same bottom area stacking and large pressure small layer height increasing way, as well as the specific arrangement order of the column content container, further enhance the stability of the stacking, reduce the risk in the transportation process;

[0099] In the frame type secondary consolidation stage, the method sets an initial space utilization rate threshold, and performs single container consolidation by circularly traversing the frame and the carton, realizing flexible adaptation to different sizes and shapes of goods; at the same time, the block strategy is adopted to circularly select the scheme with the highest space utilization rate, and when it fails, the threshold is reduced to consolidate again, ensuring the flexibility and adaptability of the consolidation scheme, and improving the overall consolidation effect;

[0100] Finally, in the three-level packing stage, the method groups the columns through a dynamic normalization algorithm, and calculates the insertion point coordinates of the columns in the container using a pole algorithm, thereby achieving precise utilization of the container space and precise positioning of the goods; the final coordinates are determined through verification of the space overlap, thereby ensuring stable loading of the goods in the container and improving the safety and efficiency of transportation;

[0101] Based on the KD packing experience of the packing personnel, the present application summarizes the greedy selection principle of space and block under different packing scenarios, and the specific content is shown in the following table:

[0102]

[0103]

[0104]

[0105] The present application uses 5 batches of actual data of Chery KD packing to carry out experiments, and the experimental results of the 5 batches of data are as follows:

[0106]

[0107]

[0108] Summary: The secondary space utilization rate of KD packing is about 85%, and the tertiary space utilization rate is about 90%; the number of containers used is basically the same as that of manual packing; the feasible scheme of each batch can be calculated within 30 minutes; under the premise of ensuring the feasibility of the packing scheme, fast calculation is achieved, which is the greatest economic benefit brought by the present application, which can reduce the workload from 2 weeks to 1 hour, greatly reduce the labor cost, and has a broad application prospect.

[0109] In further preferred embodiments of the present application, as shown in Figure 6 The scoring mechanism of the tray type secondary packing is:

[0110] The weight of the container number is the highest, the number of remaining boxes is the second, and the space utilization rate has the smallest influence;

[0111] The scoring formula is calculated by weighting the denominator, and the scheme with less containers, less remaining, and high utilization rate is preferred, and the formula is:

[0112] score=1 / (c_num+excess_box+(100-used_ratio) / 5)

[0113] Wherein c_num is the number of containers; excess_box is the number of remaining boxes; used_ratio is the container space utilization rate.

[0114] In the present embodiment, the scoring mechanism of the tray type secondary consolidation considers the three key factors of container quantity, remaining carton quantity and space utilization through the way of denominator weighting calculation, and preferentially selects the consolidation scheme with less containers, less remaining and high utilization; the advantage of this mechanism is that it can maximize the utilization of consolidation space, reduce resource waste, and at the same time ensure the efficiency and economy of the consolidation process; specifically, by giving the highest weight to the container quantity, the mechanism effectively limits the total number of required containers, reducing transportation costs; the secondary weight of the remaining carton quantity further reduces the cartons that are not fully utilized, improving the overall space utilization; although the space utilization has the smallest impact in the formula, it is still taken into account through the adjustment term in the denominator, ensuring that even if the space utilization is not the best, as long as the container and remaining carton quantity are properly controlled, a higher score can be obtained.

[0115] In further preferred embodiments of the present application, as shown in Figures 1-7 Method 1, same base area stacking: requires containers to match in length and width, and after arranging in descending order of height, each layer is screened;

[0116] Method 2, large stacking small: through interval stacking to increase height, every N containers are increased by one layer of container_2.outside_h height.

[0117] In the present embodiment, same base area stacking: by requiring containers to match in length and width, and after arranging in descending order of height, each layer is screened, this way ensures the flatness and tightness of each layer of stacking, thereby maximizing the utilization of consolidation space and reducing space waste, at the same time, the complete match in length and width also enhances the stability of the stacking, reducing the risk of goods falling or damage during transportation;

[0118] Large stacking small: through the strategy of interval stacking to increase height, every N containers are increased by one layer of specific height, this way ensures the stability of the stacking while effectively utilizing the vertical space, increasing the overall height and space utilization of the consolidation, the design of interval stacking can also disperse the stacking pressure to some extent, improve the stability of the stacking structure, further ensuring the safety of transportation.

[0119] In further preferred embodiments of the present application, as shown in Figures 1-7 The initial space utilization threshold of the frame gradually decreases from 90% to 85%, and each time the threshold is decreased by 5%, the consolidation is re-executed;

[0120] Successful consolidation requires space utilization to be greater than or equal to the current threshold, otherwise the frame size is switched.

[0121] In this embodiment, by gradually reducing the space utilization threshold, the system can more flexibly adapt to different sizes and shapes of goods, increasing the chances of successful consolidation, even if a suitable consolidation solution is not found when the initial space utilization threshold is high, the system can reattempt by reducing the threshold, thereby improving the overall success rate of consolidation

[0122] During the process of gradually reducing the threshold, the system will constantly find consolidation solutions with higher space utilization, and only when the space utilization reaches or exceeds the current threshold will the consolidation be considered successful. This approach ensures that the consolidation solution not only meets the transportation needs but also maximizes space utilization and reduces space waste.

[0123] Reducing the number of times the bounding box specification is switched: Although the strategy mentions switching the bounding box specification when the current threshold cannot be met, by gradually reducing the threshold, the system first attempts to find the optimal consolidation solution under the current bounding box specification. Only when it is indeed impossible to meet the threshold will the bounding box specification be switched. This approach reduces unnecessary switching of bounding box specifications and improves the efficiency of consolidation operations.

[0124] In further preferred embodiments of the present application, as shown in Figure 7 The state is defined as a two-dimensional array dp[i][j], tracking the total length i and total weight j of the first i columns.

[0125] The boundary condition limits the total length after adding a new column to not exceed the length of the container and the total weight to not exceed the upper limit of the load.

[0126] In this embodiment, by recording the total length and total weight of the columns through a two-dimensional array, the system can accurately grasp the state information of each column, providing reliable data support for subsequent column addition and layout planning. The setting of boundary conditions ensures that the total length and total weight after adding a new column do not exceed the limits of the container, effectively avoiding transportation risks or additional costs due to overloading. This forward-looking planning approach greatly improves the safety and economy of consolidation operations. In addition, under the premise of meeting the boundary conditions, the system can constantly try and adjust the layout of the columns to maximize the use of container space. This optimization approach not only improves space utilization but also reduces transportation costs, bringing significant economic benefits to the logistics and transportation industry.

[0127] In further preferred embodiments of the present application, as shown in Figures 1-7 The insertion point coordinates are ensured to have no overlap between columns through a recursive formula:

[0128] Insertion point = [[position x +l|position y |0],[position x|position y +w|0]]

[0129] wherein position x is the x-direction coordinate of the selected existing column, position y is the y-direction coordinate of the selected existing column, l is the length of the selected existing column, and w is the length of the selected existing column, the insertion point is generated and looped, and the final coordinate needs to pass the container space check to avoid exceeding the boundary or interfering with other columns.

[0130] In this embodiment, the application of the recursive formula makes the calculation of the insertion point coordinates more accurate, effectively avoiding the problem of column overlap; this accurate calculation not only improves the space utilization of the container, but also reduces the risk of damage to the goods caused by column overlap; through the container space check of the final coordinate, the system can ensure that each column is located within the legal space of the container, neither exceeding the boundary of the container nor interfering with other columns, and this check mechanism greatly improves the compliance and safety of the container loading operation, reducing the risk in the transportation process;

[0131] In addition, the automatic insertion point calculation and space check mechanism reduces the need for manual intervention, improves the automation and efficiency of the container loading operation, and at the same time, this mechanism also reduces the container loading problems caused by human error, improving the overall operation quality.

[0132] In further preferred embodiments of the present application, as shown in Figures 1-7 , the stacking attribute field of the standard large piece contains "whether stackable", "maximum stacking number", and "self-stacking limit";

[0133] The rotation mode field of the KD piece carton supports 0°, 90°, 180°, and 270° multi-angle adaptation.

[0134] In this embodiment, by clearly defining the stacking attributes of the standard large piece, the system can intelligently determine whether the goods are stackable, the maximum stackable number, and whether there is a self-stacking limit, thereby automatically avoiding unreasonable stacking schemes during the container loading process, effectively preventing damage or transportation risks caused by improper stacking, while maximizing the use of container space, and the multi-angle rotation adaptation function of the KD piece carton allows the carton to flexibly adjust the direction according to the space requirements, further optimizing the container loading layout and ensuring the close arrangement of goods in limited space, reducing space waste.

[0135] In further preferred embodiments of the present application, as shown in Figure 5 , the single-container container loading strategy further includes:

[0136] a. Preferentially selecting a forking direction aligned with the container door direction;

[0137] b. Fragile or light bubble pieces are forced to be distributed to the middle area of the container.

[0138] In the embodiment, the forking direction aligned with the direction of the container door is preferentially selected, which can ensure that the handling equipment such as a forklift operates more smoothly and efficiently when loading and unloading goods, and reduces the risk of operation delay or goods damage caused by improper forking direction; at the same time, the fragile or light bubble pieces are forced to be distributed to the middle area of the container, which takes advantage of the characteristics that the middle structure of the container is relatively stable and less affected by external forces, effectively reduces the possibility of damage of such goods in the transportation process due to jolt or collision, and further ensures the safety of goods transportation.

[0139] In the further preferred embodiment of the present application, as shown in Figure 3 The height correction logic of the stacking column includes:

[0140] a. If the column height is less than 80% of the height of the third-level container, a buffer layer is automatically inserted;

[0141] b. If the column height is greater than 120% of the height of the third-level container, the column is divided and the containers are redistributed.

[0142] In the embodiment, by setting that a buffer layer is automatically inserted when the column height is less than 80% of the height of the third-level container, the gap between the column and the container can be effectively filled, the collision risk caused by the shaking of goods during transportation is reduced, and the stability of the overall stacking structure is enhanced; when the column height exceeds 120% of the height of the third-level container, the system automatically divides the column and redistributes the containers, which avoids the problems of center of gravity deviation or structural instability caused by excessive stacking, and ensures the safety of goods during transportation.

[0143] In the further preferred embodiment of the present application, as shown in Figures 1-7 The weight balance factor is introduced into the state transition equation to avoid local overload of the container;

[0144] The final column arrangement scheme needs to satisfy that the center of gravity deviation of the container is less than 3% of the total length.

[0145] In the embodiment, the introduction of the weight balance factor can dynamically adjust the distribution of goods in the container, avoid local overload due to weight concentration, and effectively reduce the risk of structural damage or goods damage caused by uneven stress during transportation; at the same time, by strictly limiting the center of gravity deviation of the container, the stability of the goods during transportation is ensured, and the risk of shaking or overturning caused by the center of gravity deviation is reduced.

[0146] It should be noted that, for the foregoing embodiments, for the sake of simple description, they are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited by the order of the described actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily necessary for the present application.

[0147] In several embodiments provided in the present application, it should be understood that the disclosed device can be implemented by other ways. For example, the device embodiments described above are only illustrative, for example, the division of the above units, actual implementation can have another division way, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or communication connection between the displayed or discussed units can be through some interfaces, indirect coupling or communication connection between devices or units, which can be electrical or other forms.

[0148] The units described above as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or they can be distributed on multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0149] The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the protection scope of the application. Obviously, the described embodiments are only some of the embodiments of the present application, not all the embodiments. Based on these embodiments, all other embodiments obtained by those skilled in the art without creative labor belong to the scope of protection of the present application. Although the present application is described in detail with reference to the above embodiments, those skilled in the art can still combine, add or delete or make other adjustments to the features of the embodiments of the present application according to the circumstances without creative labor, so as to obtain different other technical solutions which do not deviate from the concept of the present application in essence. These technical solutions also belong to the scope of protection of the present application.

Claims

1. A consolidation method for KD export parts, characterized in that: The following steps are involved: S1. Data Collation: Integrate the full data of standard large pieces, KD cartons, secondary containers, and tertiary containers. Standard large pieces must include the name, outer diameter, weight, and stacking attributes; KD cartons must include the unique number, dimensions, weight, and rotation method; and containers must include the inner and outer diameters, fork entry direction, and load capacity. S2. Pallet-type secondary LCL: S21. Using a single container consolidation strategy, select the space to be filled with the highest starting point or the largest bottom area through a greedy algorithm; S22. When generating simple blocks, prioritize single large blocks with a volume greater than 500×500×500 or single blocks with space restrictions. S23. Through the scoring mechanism, use the formula: score=((10-len(groups)) / 10)*0.9+(mayh / 2540)*0.1 Where groups is the number of groups. The calculation method is to divide the containers obtained after layering into multiple groups. The height of each group is as close as possible to container_3.inside_h but not higher than that. mayh is the height of the container after layering. The optimal container solution is selected and the height of the container is attempted to be optimized for space utilization. S3. Reverse algorithm optimization stack: S31. Group the containers by stacking properties into non-stackable, stackable, and iron frame groups, and stack them in descending order of height within the same group; S32. Dynamically adjust column height: Method 1: stacking with the same base area; Method 2: Increase height by layering large and small, and improve stability by arranging the containers in the column in the order of width → material → weight → height; S33. Delete the single container or add a new container to correct the column height to ensure that the total height is close to the three-level container standard; S4. Second level LCL for frame type: S41. Set the initial space utilization threshold to ≥ 90%, and loop through the enclosures and cartons to perform single-container consolidation. S42. Use the block strategy to cyclically select the solution with the highest space utilization. If it fails, lower the threshold and re-consolidate the container. S5. Level 3 LCL: S51. Dynamic regularization algorithm groups columns, the target total length is close to the container length and the total weight is ≤ load. The state transition equation is: dp[i][j]=max(dp[i][j],dp[i-l k ][j-weight k ]+l k S52. Calculate the insertion point coordinates of the column in the container using the extreme point algorithm. After verifying spatial overlap, determine the final coordinates. The insertion point coordinate formula is: Where i is the number of items currently being considered, j is the current sum of weights, and l k and weight k is the length and weight of the kth item; Position x is the x-coordinate of the selected existing column, position y is the y-coordinate of the selected existing column, l is the length of the selected existing column, w is the length of the selected existing column, generates the insertion point and loops through the insertion points.

2. A consolidation method for KD export parts according to claim 1, characterized in that: In the scoring mechanism for secondary LCL of pallets: The number of containers has the highest weight, followed by the number of remaining cartons, and the space utilization has the least impact; The scoring formula uses a weighted denominator to prioritize solutions with fewer containers, less remaining capacity, and higher utilization. The formula used is: score=1 / (c_num+excess_box+(100-used_ratio) / 5) Where c_num is the number of containers; excess_box is the number of remaining cartons; used_ratio is the container space utilization ratio.

3. A consolidation method for KD export parts according to claim 1, characterized in that: Method 1: Stacking with the same bottom area: The length and width of the containers must match exactly, and they must be sorted in descending order of height before being screened layer by layer. Method 2: Stacking large containers on small ones: Increase the height by stacking them at intervals. After every N containers, add a layer of height container_2.outside_h.

4. A consolidation method for KD export parts according to claim 1, characterized in that: The initial space utilization threshold of the enclosure is gradually reduced from 90% to 85%, and LCL is re-executed each time the space utilization threshold is reduced by 5%; Successful consolidation requires that the space utilization rate ≥ the current threshold, otherwise the frame specifications will be switched.

5. A consolidation method for KD export parts according to claim 1, characterized in that: The state is defined as a two-dimensional array dp[i][j], which keeps track of the total length i and total weight j of the first i columns; Boundary conditions restrict the total length of the newly added columns to not exceed the length of the container, and the total weight to not exceed the upper limit of the load.

6. A consolidation method for KD export parts according to claim 1, characterized in that: The insertion point coordinates are calculated using a recursive formula to ensure that there is no overlap between columns: Among them pos ition x is the x-coordinate of the selected existing column, position y is the y-coordinate of the selected existing column, l is the length of the selected existing column, w is the length of the selected existing column, generates insertion points and loops through the insertion points, and the final coordinates must pass the container space check to avoid exceeding the boundary or interfering with other columns.

7. A consolidation method for KD export parts according to claim 1, characterized in that: The stacking attribute fields for standard large items include "Stackability", "Maximum number of stacking layers", and "Self-stacking limit". The rotation mode field of KD cartons supports multiple angle adaptations of 0°, 90°, 180°, and 270°.

8. A consolidation method for KD export parts according to claim 1, characterized in that: The single container LCL strategy further includes: a. Prioritize the entry direction that is aligned with the container door direction; b. Fragile items or lightweight items must be forcibly allocated to the middle area of ​​the container.

9. A consolidation method for KD export parts according to claim 1, characterized in that: The stacked column height correction logic includes: a. If the column height is less than 80% of the height of the third-level container, a buffer layer will be automatically inserted; b. If the column height is greater than 120% of the height of the third-level container, split the column and redistribute the containers.

10. A consolidation method for KD export parts according to claim 1, characterized in that: The state transfer equation introduces a weight balance factor to avoid local overloading of the container; The final column arrangement plan must ensure that the center of gravity offset of the container is ≤ 3% of the total length.

Images