Maintenance equipment dimension reduction type intelligent boxing method based on drawer medium

Abstract

The invention discloses a maintenance equipment dimension reduction type intelligent boxing method based on a drawer medium, and belongs to the technical field of equipment packaging and assembling. Comprising the following steps: step 1, data preprocessing and height grouping: grouping packaging boxes according to heights, and matching the packaging boxes with drawers; step 2, planning a two-dimensional area in the drawer, and processing each height group in parallel or in series on the basis of packaging grouping; in each calculation task, all the packaging boxes in the group are loaded into a drawer plane with specified depth and width; and finally, generating a specific two-dimensional layout for each drawer. 3, one-dimensional height stacking is conducted in the container, drawer blocks are reasonably arranged, and the sequence and the specific height positions of the drawer blocks inserted into the container are determined; step 4, outputting the scheme; according to the maintenance equipment dimension reduction type intelligent boxing method based on the drawer medium, the calculation complexity of the three-dimensional boxing problem can be remarkably reduced, and the boxing efficiency and the space utilization rate are improved.

Description

Technical Field

[0001] This invention relates to a drawer-based intelligent packing method for repair equipment, belonging to the field of equipment packaging and assembly technology. Background Technology

[0002] In the military equipment maintenance and material support system, "basic assembly and complete supply" is the core support model, requiring equipment maintenance materials to be assembled according to preset basic standards and then stored and transported in standardized packaging. However, equipment maintenance material packing is essentially a typical three-dimensional packing NP-hard problem, with its computational complexity increasing exponentially with the number of materials. Furthermore, traditional three-dimensional packing algorithms need to simultaneously optimize the spatial layout of the length, width, and height dimensions. The computation time for a single batch of 100 heterogeneous materials often exceeds 30 minutes, making it difficult to meet the needs of rapid packing.

[0003] Meanwhile, current equipment maintenance and material packing methods largely rely on manual sorting and trial packing, which presents the following problems: First, low space utilization, with manual trial packing generally having a space utilization rate of less than 45%, leading to increased container usage and serious waste of wartime transport capacity; second, numerous human interference factors, with arbitrary design schemes for different component units, resulting in multiple packaging and assembly schemes for the same type of equipment, lacking standardization; and third, poor adaptability. Although some dimensionality reduction methods exist in existing technologies, such as simplifying three-dimensional problems into two-dimensional problems, they are mostly designed for general logistics scenarios and do not take into account the characteristics of basic equipment assembly and complete supply. General dimensionality reduction methods often ignore the adaptability of equipment height and drawer depth, resulting in some equipment needing rework due to height deviations or serious waste of space in the drawer depth direction, failing to balance computational efficiency and practicality of the solution.

[0004] In addition, the special nature of equipment maintenance materials imposes additional constraints on the packing scheme: on the one hand, precision equipment (such as radar parts and optical instruments) should avoid being stacked and compressed; on the other hand, complete sets of equipment (such as engine repair kits) should be ensured to be in the same packaging unit. However, traditional three-dimensional packing algorithms and general dimensionality reduction methods are difficult to meet these constraints at the same time, resulting in packing schemes that do not meet the storage specifications of equipment maintenance materials or have low computational efficiency, and cannot adapt to the wartime requirements of "rapid response and precise support".

[0005] Therefore, in order to solve the above problems, it is urgent to design a three-dimensional packing optimization method that can combine the characteristics of the equipment and take into account both computational efficiency and practicality of the solution. Summary of the Invention

[0006] To address the aforementioned issues, this invention proposes a dimensionality-reduced intelligent packing method for maintenance equipment based on drawer mediation. By using a drawer as an intermediary, the complex three-dimensional packing problem is decomposed into a two-stage solution logic: two-dimensional area planning within the drawer and one-dimensional height planning within the container. This reduces computational complexity while ensuring that the solution meets the constraints of equipment standardization and complete sets, ultimately achieving the triple goals of improved packing efficiency, optimized space utilization, and guaranteed practicality of the solution.

[0007] The present invention provides a drawer-mediated intelligent packing method for maintenance equipment, applicable to standardized and refined assembly and packing scenarios for military equipment maintenance equipment (such as mechanical parts, electronic components, and precision instruments). It is particularly suitable for the storage and support model of military maintenance equipment based on basic assembly and complete supply, significantly reducing the computational complexity of three-dimensional packing problems and improving packing efficiency and space utilization. The method includes the following steps: Step 1: Data preprocessing and height grouping, Group the boxes by height and match them with drawers; first, sort all the boxes to be packed by height, and then formulate grouping rules according to the available drawer model depths; second, set the height tolerance range in the model parameters to divide the boxes into different height groups, with each group corresponding to a drawer of a certain depth. Step 2: Two-dimensional area planning inside the drawer. Based on the packaging grouping, this step processes each height group in parallel or serially; each calculation task loads all the boxes in the group into the drawer plane of a specified depth and width; where only the length and width of the boxes need to be considered, and the boxes do not overlap or exceed the drawer boundaries; finally, a specific two-dimensional layout diagram is generated for each drawer, and the representative height of the drawer is based on the height of the tallest box in the drawer, i.e., the representative height of the group. Step 3: Stack the containers one-dimensionally. Treat all loaded drawers as multiple drawer blocks with known heights; and, without exceeding the total height of the container, arrange the drawer blocks reasonably, determining the order and specific height of these drawer blocks when inserting them into the container. Step 4: Output the solution. Output the two-dimensional coordinates (x, y) of the packaging boxes inside each drawer, the stacking height of the drawer inside the container, and the overall space utilization rate; and output the final three-dimensional packing plan, including the specific three-dimensional coordinates (X, Y, Z) of each drawer in the container; at the same time, generate a standardized packing plan to provide a basis for actual operation and subsequent traceability.

[0008] Furthermore, the specific operation steps of step 1 are as follows: Step 1.1: Collect the basic parameters of the packaging box for the equipment to be packed for repair. The basic parameters of the packaging box include the length L, width W, height H, weight G, and protection level P of the packaging box. At the same time, collect the specifications of the available drawers, including the drawer depth D and length L. d Width W d Rated load G d and container specifications, including container length L c Width W c High H c Rated load G c ; Step 1.2: Sort the packaging boxes in ascending order of height H, set the height tolerance threshold ΔH=5mm, group the equipment whose height meets D-ΔH≤H≤D into the same height group, establish the mapping relationship between height group and drawer model, and ensure that the height of each group of equipment matches the corresponding drawer depth.

[0009] Furthermore, in step 1.2, if the height H of a certain equipment's packaging box exceeds the range of D-ΔH≤H≤D for all drawer depths D, the packaging box is marked as an irregularly shaped packaging box, and a container frame is used for adaptation. The height of the container frame is set according to the packaging box height H+10mm buffer space, and the weight of the container frame is included in the container load calculation.

[0010] Furthermore, the specific operation steps of step 2 are as follows: Step 2.1: For each height group, fix the equipment packaging box height H = corresponding drawer depth D, and only optimize the packaging box in drawer L. d ×W d A two-dimensional layout; Step 2.2: Initialize the layout using the lowest horizontal line + left alignment algorithm: Take the bottom left corner of the drawer as the origin (0,0), dynamically maintain the height of the lowest horizontal line inside the drawer, prioritize placing the equipment with the largest bottom area, and place the packaging boxes along the lowest horizontal line to the left to ensure no overlap and do not exceed the drawer boundary; Step 2.3: Calculate drawer space utilization rate η = Σ bottom area of ​​packaging box / (L) d ×W d ) × 100%, if η < 75%, adjust the orientation of the equipment and repeat step 2.1; until η ≥ 75% or traverse all orientation combinations.

[0011] Furthermore, in step 2.2, if multiple packaging boxes are packaging boxes for complete sets of equipment (marked according to the equipment quantity list), the packaging boxes for complete sets of equipment should be placed in the same drawer first, and the placement area of ​​the packaging boxes for complete sets of equipment in the drawer must meet the protection requirement of a boundary distance ≥ 20mm.

[0012] Furthermore, in step 2.3, when adjusting the orientation of the equipment, rotation is only permitted around an axis perpendicular to the plane of the drawer by multiples of 90°.

[0013] Furthermore, the specific steps of step 3 are as follows: Step 3.1: Extract the actual height of each loaded drawer, that is, the maximum equipment height and weight of the corresponding height group, and sort them in descending order of weight → descending order of height to form a drawer stacking sequence; Step 3.2: Initialize the remaining height H of the container c’ =H c Remaining load G c’ =G c Place them in the drawers in the order of stacking; Step 3.2.1: If the drawer height is ≤ H c’ And the drawer weight ≤ G c’ Place the drawer at the lowest effective support surface inside the container and update H. c’ =H c’ -Drawer height, G c’ =G c’ -Drawer weight; Step 3.2.2: If the above conditions are not met, start a new container and repeat step 3.2 until all drawers are loaded.

[0014] Furthermore, in step 3.2, the stacking of drawers inside the container must satisfy a center-of-gravity projection deviation of ≤10mm: calculate the overall center-of-gravity coordinates (X) of the loaded drawers. c ,Y c If it is related to the geometric center of the container (L) c / 2,W c If the deviation of / 2) exceeds 10mm, swap the positions of adjacent drawers until the deviation is ≤10mm.

[0015] Compared with existing technologies, the drawer-mediated intelligent packing method for repair equipment of the present invention has the following advantages: 1. The computational complexity is significantly reduced. By using drawer mediation, the three-dimensional bin packing problem is decomposed into a two-stage solution of two-dimensional + one-dimensional, which significantly improves computational efficiency and is suitable for the rapid bin packing needs in wartime. 2. Space utilization is greatly improved. The space utilization rate of the two-dimensional layout inside the drawer is ≥75%, and the overall space utilization rate of the container is ≥80%, which is far higher than that of manual trial loading, significantly reducing wartime transportation capacity consumption; 3. The solution is highly adaptable. Combining the standardized drawer-type packaging and basic set assembly characteristics of military equipment maintenance materials, the solution ensures compliance with GJB10882-2023 specifications through designs such as height tolerance control, priority layout of complete sets of materials, and center of gravity offset constraints, effectively reducing the damage rate of precision equipment during transportation. 4. Balancing practicality and traceability, the solution outputs standardized packing lists, positioning diagrams, and adjustment logs, supporting on-site operation guidance and subsequent traceability. Furthermore, the design features such as container frame adaptation for irregularly shaped equipment and dynamic center of gravity adjustment, further enhancing the practical adaptability of the solution. Attached Figure Description

[0016] Figure 1 This is a schematic diagram of the workflow of the data preprocessing module of the present invention.

[0017] Figure 2 This is a schematic diagram of the workflow of the two-dimensional layout module of the present invention.

[0018] Figure 3 This is a schematic diagram of the workflow of the one-dimensional layout module of the present invention.

[0019] Figure 4 This is a schematic diagram of the overall workflow of the present invention. Detailed Implementation

[0020] The present invention provides a dimensionality-reduced intelligent packing method for maintenance equipment based on drawer mediation. By introducing a "drawer" physical medium, the complex strong NP-hard three-dimensional packing problem is decoupled into three serial and logically clear sub-modules: a data preprocessing module, a two-dimensional layout module, and a one-dimensional layout module. Through the collaboration and data transfer between the modules, the model systematically reduces the dimensionality of the three-dimensional optimization problem, thereby achieving a balance between computational complexity and solution quality. The model operates according to a strict data flow-driven principle. The workflow begins with a data preprocessing module, which validates, groups, and matches the inputs to generate structured task packages. These task packages are then passed to a 2D layout module, which performs independent 2D spatial optimization on each height group in parallel or serially, outputting a series of loaded drawer layouts with defined planar coordinates and final heights. Finally, all these drawer layouts are aggregated and input into a 1D layout module, which performs global height-oriented optimization and ultimately outputs a complete 3D packing layout, including the precise 3D coordinates of each packing box within the container and its corresponding drawer number. The entire process significantly reduces the difficulty of solving the problem and ensures the physical feasibility of the solution by decomposing the 3D problem into a sequential step of grouping → 2D layout → 1D layout.

[0021] First, the data preprocessing module is the foundation of the entire algorithm. It is responsible for receiving and standardizing the raw input data, including the set of packaging box dimensions, the specifications of available drawer models, and the specifications and dimensions of the container. Its core function is to execute the "height-based depth" strategy, that is, to cluster and group the packaging boxes according to their height attributes, and assign a drawer model with the best depth matching to each height group. This transforms the original unordered set of packaging boxes into a series of two-dimensional layout sub-problems that are bound to specific drawer models, laying the foundation for subsequent dimensionality reduction calculations. like Figure 1 As shown, the workflow of the data preprocessing module is as follows: ① Start: Initiate the data preprocessing process; ② Input raw data: Receive the model of the packaging box, drawer, and the size data of the container; ③ Data validation: Check the validity and rationality of the input data (e.g., dimensions are positive, width constraints, etc.); ④ Data Validity: Determine if the data passes all validation rules; ⑤ Yes: Confirm the data is valid and proceed to the core processing stage; ⑥ Sort and group by height: Arrange the boxes in ascending order of height and divide them into several groups; ⑦ Match the best drawer for each group: Select the drawer model with the best matching depth for each height group; ⑧ Output preprocessing results: Generate and output grouping information and drawer matching relationships; 9. No: Data is confirmed to be invalid; proceed to error handling. ⑩ Error reporting and termination: Output error message and stop the process; Secondly, the two-dimensional layout module is the core of spatial planning, responsible for solving the two-dimensional rectangular packing problem of "packing boxes into drawers". It receives grouped packing box data and their corresponding drawer bottom dimensions from the preprocessing module. The module uses a heuristic spatial partitioning algorithm or the best fitness descent algorithm to optimize the utilization rate of the drawer bottom area. It calculates the optimal or near-optimal planar layout scheme in one or more drawers for each group and determines the actual height occupied by each drawer in the container, that is, the maximum height of its internal packing box. like Figure 2 As shown, the workflow of the 2D layout module is as follows: ① Start: The module starts and receives data (a list of pre-grouped bins) from the preprocessing module. ② Process each group: Process each height group in a loop; ③ Create drawers for groups: Assign a new (first) drawer to the current group; ④ Packing boxes into drawers: Repeatedly try to put the boxes in the group into the currently open drawer; ⑤ Try placing it: Use an algorithm (such as the lowest horizontal line algorithm) to find an empty space at the bottom of the drawer to place the box; ⑥ Success: If an empty space is found, place the box in it and record the position; ⑦ Failure: If the current drawer can no longer hold any more boxes, "close" it and open a brand new drawer to continue storing; ⑧ Output: After all boxes in all groups have been placed, output the final layout, indicating which drawer each box is located in and its specific position; Secondly, the one-dimensional layout module is responsible for solving the one-dimensional strip packing problem of "drawers being loaded into containers". It receives all the loaded drawers and their determined height values ​​from the two-dimensional layout module. The core task of the module is to treat these drawers as indivisible blocks and arrange them optimally along the height direction of the container. The goal is to minimize the waste of vertical space without exceeding the total height of the container. The module uses a greedy algorithm (best-fitting decreasing algorithm) or a height-first algorithm to determine the stacking order and position of the drawers. like Figure 3 As shown, the workflow of the one-dimensional layout module is as follows: ① Input: Receive the result from the 2D layout module, which is all the drawers that are already filled with boxes (each drawer has a known length, width, and height). ② Sorting: Sort the drawers in descending order of their height; this is a key strategy, prioritizing taller drawers can create a stable base at the bottom of the container, similar to the principle of "heavier items at the bottom" when stacking items in real life; ③ Finding a location: For the drawer to be placed, find the lowest effective support surface inside the container; this means that the drawer must be placed stably at the bottom of the container or on top of existing drawers, and cannot be suspended in the air; ④ Placement and Update: Place the drawer in the found location and update the container's space occupancy status, marking the area as occupied; ⑤ Calculate the utilization rate: When all drawers are placed or no more drawers can be placed, calculate the space utilization rate of the entire container (the percentage of the container's total volume that has been used). This is a key indicator for evaluating the quality of the algorithm. Finally, the final 3D packing plan is output, including the specific 3D coordinates (X, Y, Z) of each drawer in the container.

[0022] like Figure 4 The drawer-mediated intelligent packing method for repair equipment, as shown, specifically includes the following steps: Step 1: Data preprocessing and height grouping, Group the boxes by height and match them with drawers. First, sort all the boxes to be packed by height, then define the grouping rules based on the available drawer depths. Second, set the height tolerance range in the model parameters to divide the boxes into different height groups, with each group corresponding to a drawer depth. The specific steps are as follows: Step 1.1: Basic Parameter Acquisition. Basic parameters of the equipment to be packed for repair are collected using devices such as a volumetric weighing machine and a handheld barcode scanner. These basic parameters include, but are not limited to: The equipment packaging box should include the following dimensions: length (L, mm), width (W, mm), height (H, mm), weight (G, kg), and protection level (P, classified as precision, standard, and heavy-duty according to GJB10882-2023). Also, collect the available drawer specifications (drawer depth D, length L). d Width W d Rated load G d ) and container specifications (container length L) c Width W c Height H c Rated load G c ); The drawer depth D can be preset to three specifications of 100mm, 200mm and 300mm according to the basic equipment standard. The container adopts a military 1-ton ordinary container (size: 900mm×1300mm×1300mm) or a 3-ton non-standard container (size: 2220mm×1450mm×1600mm). Step 1.2: Group by height and match with drawers. Sort by packaging box height H in ascending order, and set a height tolerance threshold ΔH = 5mm (which can be set based on the equipment's protection and cushioning requirements). Group equipment whose height meets the condition D - ΔH ≤ H ≤ D into the same height group. For example, when the drawer depth D = 200mm, packaging boxes of equipment with heights between 195mm and 200mm should be grouped into the same height group. This ensures that the height of each group of packaging boxes matches the corresponding drawer depth, avoiding height discrepancies or wasted space. Establish a one-to-one mapping relationship between height groups and drawer models (e.g., ...). Height group H1 corresponds to drawer model D1, height group H2 corresponds to drawer model D2). If the height H of a certain equipment's packaging box exceeds the range of D-ΔH≤H≤D for all drawer depths, it is marked as irregular equipment, and the container frame is used for adaptation: the height of the container frame is set according to the equipment height H+10mm buffer space (the buffer space is used to place shockproof materials), and the weight of the container frame (preset to 5kg / piece) is included in the subsequent container load calculation. A mapping relationship between height groups and drawer models is established to ensure that the height of each group of equipment is adapted to the corresponding drawer depth. Step 2: Two-dimensional area planning inside the drawer. Based on the packaging grouping, this step processes each height group in parallel or sequentially; each calculation task loads all the boxes in the group into a drawer plane with a specified depth and width; where only the length and width of the boxes need to be considered, and the boxes do not overlap or exceed the drawer boundaries; finally, a specific two-dimensional layout diagram is generated for each drawer, and the representative height of the drawer is based on the height of the tallest box in the drawer, i.e., the representative height of the group; the specific operation is as follows: Step 2.1: Layout algorithm selection and initialization. For each height group, fix the equipment packaging box height H = corresponding drawer depth D, and only optimize the packaging box in drawer L. d ×W d A two-dimensional layout; Step 2.2: Initialize the layout using the lowest horizontal line + left alignment algorithm: With the bottom left corner of the drawer as the origin (0,0), dynamically maintain the height of the lowest horizontal line inside the drawer (initially 0). Prioritize placing equipment with the largest base area (length × width). Place the packaging boxes along the lowest horizontal line to the left, ensuring no overlap and that they do not exceed the drawer boundary (i.e., the x-coordinate of any vertex of the packaging box ≤ L). d y-coordinate ≤ W d ); If multiple boxes are boxes containing complete sets of equipment (marked according to the equipment list, such as engine repair kits), prioritize placing the boxes containing complete sets of equipment in the same drawer, and the placement area of ​​the boxes containing complete sets of equipment in the drawer must meet the protection requirement of a boundary distance of ≥20mm (to avoid collision damage during transportation). Step 2.3: Layout optimization and verification, calculate drawer space utilization rate η = Σ bottom area of ​​packaging box / (drawer length L) d ×Drawer width W d If η < 75% (which can be set based on equipment space utilization standards), adjust the equipment orientation (only allow rotation around an axis perpendicular to the drawer plane by multiples of 90° to avoid damage to the equipment protective structure), and repeat step 2.1; if η is still < 75% after traversing all orientation combinations, then re-merge and sort the packaging boxes in the current drawer with the next batch of packaging boxes of the same height, and rearrange them in descending order of bottom area + descending order of weight, until η ≥ 75% or it is determined that the packaging boxes of the current batch of equipment cannot meet the utilization requirements (at this time, start a new drawer). Step 3: Stack the containers one-dimensionally. Treat all loaded drawers as multiple drawer blocks with known heights; and, without exceeding the total height of the container, rationally arrange the drawer blocks, determining the order and specific height positions of these drawer blocks when inserting them into the container to ensure container space utilization and transportation stability; the specific operation is as follows: Step 3.1: Drawer block parameter extraction and sorting. Extract the actual height of each loaded drawer (i.e., the maximum packaging box height of the corresponding height group; for example, if the maximum packaging box height of height group H1 is 200mm, then the actual height of the drawer is 200mm) and the total weight (e.g., the drawer's own weight is 5kg + the total weight of the equipment and packaging box). Sort the drawers in descending order of weight → descending order of height to form a drawer stacking sequence. For example, a drawer weighing 80kg and with a height of 200mm is prioritized over a drawer weighing 50kg and with a height of 195mm to ensure that heavy items are at the bottom and light items are at the top, thereby lowering the center of gravity of the container and improving transportation stability. Step 3.2: Adapt drawer stacking to container, initialize remaining container height H c’ =H c Remaining load G c’ =G c Drawers are placed into the container in the order of stacking. Step 3.2.1: If the drawer height is ≤ H c’ And the drawer weight ≤ G c’ Place the drawer on the lowest effective support surface inside the container (initially the bottom of the container, then the top of the already placed drawer), and update the remaining height H. c’ =H c’ -Drawer height, remaining load capacity G c’ =G c’ -Drawer weight; Step 3.2.2: If the above conditions are not met (drawer height > H) c' Or drawer weight > G c' Start a new container of the same specifications and repeat step 3.2 until all drawers are loaded; Among these requirements, the stacking of drawers inside the container must meet the condition that the center of gravity projection deviation is ≤10mm: Calculate the overall center of gravity coordinates (X) of the loaded drawers. c ,Y c ), X c =Σ(drawer geometric center x × drawer weight) / Σ drawer weight, Y c =Σ(drawer geometric center y × drawer weight) / Σ drawer weight; if the center of gravity is the same as the geometric center of the container (L... c / 2,W c If the deviation of / 2) exceeds 10mm (which can be set based on transportation stability requirements), swap the positions of adjacent drawers until the deviation is ≤10mm; Step 4: Output the solution. Output the two-dimensional coordinates (x, y) of the packaging boxes inside each drawer. These coordinates are relative to the drawer's origin and the drawer's stacking height within the container, such as drawer 1: height 0-200mm; drawer 2: height 200-395mm. Also output the overall space utilization rate, calculated as the sum of the volumes of all equipment packaging boxes / the sum of the usable volumes of all containers × 100%. Output the final three-dimensional packing plan, including the specific three-dimensional coordinates (X, Y, Z) of each drawer within the container. Output the equipment protection process list (including dust removal, cleaning, and cushioning material types). Simultaneously, generate a standardized packing plan to provide a basis for actual operations and subsequent traceability. Specifically, the packing plan, along with the equipment list and adjustment logs (such as records of handling irregularly shaped equipment and center of gravity adjustments), is stored in a database using the TIDB storage algorithm. This allows for subsequent traceability queries using keywords such as equipment codes and container numbers. The plan is also exported as a PDF packing design and positioning diagram for on-site operational guidance.

[0023] The above embodiments are merely preferred embodiments of the present invention. Therefore, all equivalent changes or modifications made to the structure, features and principles described in the claims of this patent application are included within the scope of this patent application.

Claims

1. A method for intelligent packing of repair equipment based on drawer mediation, characterized in that, Includes the following steps: Step 1: Data preprocessing and height grouping, Group the boxes by height and match them with drawers; first, sort all the boxes to be packed by height, and then formulate grouping rules according to the available drawer model depths; second, set the height tolerance range in the model parameters to divide the boxes into different height groups, with each group corresponding to a drawer of a certain depth. Step 2: Two-dimensional area planning inside the drawer. Based on the packaging grouping, this step processes each height group in parallel or serially; each calculation task loads all the boxes in the group into the drawer plane of a specified depth and width; where only the length and width of the boxes need to be considered, and the boxes do not overlap or exceed the drawer boundaries; finally, a specific two-dimensional layout diagram is generated for each drawer, and the representative height of the drawer is based on the height of the tallest box in the drawer, i.e., the representative height of the group. Step 3: Stack containers one-dimensionally. Treat all loaded drawers as multiple drawer blocks with known heights; and, without exceeding the total height of the container, arrange the drawer blocks reasonably, determining the order and specific height of these drawer blocks when inserting them into the container. Step 4: Output the solution. Output the two-dimensional coordinates (x, y) of the packaging boxes inside each drawer, the stacking height of the drawer inside the container, and the overall space utilization rate; and output the final three-dimensional packing plan, including the specific three-dimensional coordinates (X, Y, Z) of each drawer in the container; at the same time, generate a standardized packing plan to provide a basis for actual operation and subsequent traceability.

2. The intelligent packing method for repair equipment based on drawer mediation as described in claim 1, characterized in that, The specific steps for step 1 are as follows: Step 1.1: Collect the basic parameters of the packaging box for the equipment to be packed for repair. The basic parameters of the packaging box include the length L, width W, height H, weight G, and protection level P of the packaging box. At the same time, collect the specifications of the available drawers, including the drawer depth D and length L. d Width W d Rated load G d and container specifications, including container length L c Width W c High H c Rated load G c ; Step 1.2: Sort the packaging boxes in ascending order of height H, set the height tolerance threshold ΔH=5mm, group the equipment whose height meets D-ΔH≤H≤D into the same height group, establish the mapping relationship between height group and drawer model, and ensure that the height of each group of equipment matches the corresponding drawer depth.

3. The intelligent packing method for repair equipment based on drawer mediation as described in claim 2, characterized in that, In step 1.2, if the height H of a certain equipment's packaging box exceeds the range of D-ΔH≤H≤D for all drawer depths D, the packaging box is marked as an irregularly shaped packaging box, and a container frame is called for adaptation. The height of the container frame is set according to the packaging box height H+10mm buffer space, and the weight of the container frame is included in the container load calculation.

4. The intelligent packing method for repair equipment based on drawer mediation as described in claim 1, characterized in that, The specific steps for step 2 are as follows: Step 2.1: For each height group, fix the equipment packaging box height H = corresponding drawer depth D, and only optimize the packaging box in drawer L. d ×W d A two-dimensional layout; Step 2.2: Initialize the layout using the lowest horizontal line + left alignment algorithm: Take the bottom left corner of the drawer as the origin (0,0), dynamically maintain the height of the lowest horizontal line inside the drawer, prioritize placing the equipment with the largest bottom area, and place the packaging boxes along the lowest horizontal line to the left to ensure no overlap and do not exceed the drawer boundary; Step 2.3: Calculate drawer space utilization rate η = Σ bottom area of ​​packaging box / (L) d ×W d ) × 100%, if η < 75%, adjust the orientation of the equipment and repeat step 2.1; until η ≥ 75% or traverse all orientation combinations.

5. The intelligent packing method for repair equipment based on drawer mediation as described in claim 4, characterized in that, In step 2.2, if multiple boxes are boxes for complete sets of equipment, the boxes for complete sets of equipment should be placed in the same drawer first, and the placement area of ​​the boxes for complete sets of equipment in the drawer must meet the protection requirement of a boundary distance ≥ 20mm.

6. The intelligent packing method for repair equipment based on drawer mediation according to claim 4, characterized in that, In step 2.3, when adjusting the orientation of the equipment, it is only allowed to rotate by multiples of 90° around an axis perpendicular to the plane of the drawer.

7. The intelligent packing method for repair equipment based on drawer mediation as described in claim 1, characterized in that, The specific steps for step 3 are as follows: Step 3.1: Extract the actual height of each loaded drawer, that is, the maximum equipment height and weight of the corresponding height group, and sort them in descending order of weight → descending order of height to form a drawer stacking sequence; Step 3.2: Initialize the remaining height H of the container c’ =H c Remaining load G c’ =G c Place them in the drawers in the order of stacking; Step 3.2.1: If the drawer height ≤ H c’ And the drawer weight ≤ G c’ Place the drawer at the lowest effective support surface inside the container and update H. c’ =H c’ -Drawer height, G c’ =G c’ -Drawer weight; Step 3.2.2: If the above conditions are not met, start a new container and repeat step 3.2 until all drawers are loaded.

8. The intelligent packing method for repair equipment based on drawer mediation according to claim 7, characterized in that, In step 3.2, the stacking of drawers inside the container must meet the requirement that the center of gravity projection deviation is ≤10mm: Calculate the overall center of gravity coordinates (X) of the loaded drawers. c ,Y c If it is related to the geometric center of the container (L) c / 2,W c If the deviation of / 2) exceeds 10mm, swap the positions of adjacent drawers until the deviation is ≤10mm.

Images