A method, apparatus, medium, and device for discharging

Abstract

The application discloses a kind of discharging method, device, medium and equipment, it is related to discharging technical field.The application first determines the long side optional discharging condition and short side optional discharging condition of discharging unit to carry out combination, to determine the discharging result of combination result on rectangular whole material in the mode of center symmetry arrangement discharging unit, remove the discharging result of discharging unit overlap, and keep the discharging result corresponding to the combination result of discharging unit full horizontal row or full vertical row, then according to current maximum discharging number, the discharging result is pruned, and the remaining un-discharged rectangle in the discharging result after pruning is iteratively discharged, until the area of remaining un-discharged rectangle is less than the area of discharging unit, so that the discharging result corresponding to current maximum discharging number is used as the final discharging result.The application improves the concentration of remaining space, so that the remaining space can be further discharged to the greatest extent, thereby improving the use rate of whole material space, and improving the discharging effect.

Description

Technical Field

[0001] This invention relates to the field of material discharge technology, and in particular to a material discharge method, apparatus, medium and equipment. Background Technology

[0002] Currently, nesting algorithms are widely used in various fields such as apparel and sheet metal processing. In the apparel industry, nesting algorithms are used to optimize fabric usage, reduce fabric waste, and lower costs. In sheet metal processing, nesting algorithms help to rationally arrange the shape and size of workpieces, maximizing material utilization.

[0003] Material nesting algorithms can be divided into several layers: low-level geometric algorithms, nesting strategies, and optimization algorithms. Low-level geometric algorithms handle the positional and distance relationships between polygons, while nesting strategies determine whether the initial solution is feasible or acceptablely infeasible, optimizing the layout by progressively removing overlaps. Optimization algorithms further reduce material waste and may employ intelligent optimization algorithms such as simulated annealing and genetic algorithms.

[0004] Existing nesting algorithms include order-based nesting algorithms, combinatorial optimization (intelligent optimization) algorithms, greedy algorithms, and minimum arrays. Order-based nesting algorithms, which use the left bottom as a basis and incorporate parameters such as fit to calculate relevant values, are inefficient and have a high fabric waste rate. Intelligent optimization algorithms (regardless of type) offer very limited improvement for cases with more than one hundred parts and require a relatively long running time. Greedy algorithms only show significant effects at large scales, but perform poorly when the size of nesting units (such as fabric or mechanical parts) is not significantly different. Minimum arrays, concerning the arrangement of lattices, can achieve near-optimal results. Arrays are suitable for similar types of parts; for example, if there are 100 A's, 120 B's, and 30 C's, then A / B / C can be arranged into three separate arrays and then combined into a complete layout.

[0005] In summary, when the unit size of the material layout is similar, most current material layout methods are based on the left bottom algorithm, with some auxiliary means, such as fit evaluation, which have a certain optimization effect. However, they are basically simple single-array arrangements, which have a high waste rate of the entire material space. Summary of the Invention

[0006] Therefore, it is necessary to provide a discharge method, apparatus, medium, and equipment to address the aforementioned technical problems.

[0007] The present invention adopts the following technical solution:

[0008] This invention provides a material layout method, in which material is laid out on a rectangular block of material, using the smallest circumscribed rectangle corresponding to the material to be laid out as the layout unit; the method includes:

[0009] Determine the possible arrangement of several vertically arranged units and several horizontally arranged units along the long side of a rectangular whole material, and determine the possible arrangement of several vertically arranged units and several horizontally arranged units along the short side of a rectangular whole material.

[0010] The options for long-side and short-side layout are combined, and the layout result on the rectangular whole material is determined by arranging the layout units in a centrally symmetrical manner. The layout results with overlapping layout units are removed, and the layout results corresponding to the combination results of layout units arranged horizontally or vertically are retained.

[0011] Determine the number of already arranged units and the current maximum number of units in the remaining material arrangement results, and determine the area of ​​the remaining unarranged rectangles in the middle of the rectangular whole; based on the ratio of the area of ​​the remaining unarranged rectangles to the area of ​​the arranged units, determine the potential maximum number of units that can be arranged in the remaining unarranged rectangles.

[0012] When the sum of the number of already arranged units and the potential maximum number of units in the remaining layout results is less than the current maximum number of units, the corresponding layout results are pruned.

[0013] The remaining un-laid rectangles in the pruned layout result are iteratively laid out to update the layout result and the current maximum number of layouts, until the area of ​​the remaining un-laid rectangles is less than the area of ​​the layout unit; the layout result corresponding to the current maximum number of layouts is taken as the final layout result.

[0014] Optionally, determining the possible layout of several vertically arranged and horizontally arranged units along the long side of the rectangular material, and determining the possible layout of several vertically arranged and horizontally arranged units along the short side of the rectangular material, specifically includes:

[0015] Determine the maximum number of vertically arranged units along the long side of a rectangular block when they are arranged side by side.

[0016] For each possible long side vertical arrangement from zero to the maximum number of long side vertical arrangements, determine the maximum number of long side horizontal arrangements when the remaining space on the long side of the rectangular whole material is arranged in parallel horizontal arrangement units, and combine this possible long side vertical arrangement with the corresponding maximum number of long side horizontal arrangements to obtain the long side optional material arrangement corresponding to this possible long side vertical arrangement.

[0017] Determine the maximum number of vertically arranged units along the short side of a rectangular block when they are arranged side by side.

[0018] For each possible short side vertical arrangement from zero to the maximum number of short side vertical arrangements, determine the maximum number of short side horizontal arrangements when the remaining space of the short side of the rectangular material is arranged in parallel horizontal arrangements. Combine this possible short side vertical arrangement with the corresponding maximum number of short side horizontal arrangements to obtain the segment side optional arrangement corresponding to this possible short side vertical arrangement.

[0019] Optionally, the iterative arrangement of the remaining unarranged rectangles in the pruned arrangement result to update the arrangement result and the current maximum arrangement number, until the area of ​​the remaining unarranged rectangles is less than the area of ​​the arrangement unit, specifically includes:

[0020] Iteratively arrange the remaining unarranged rectangles in the pruned arrangement results to update the arrangement results and the current maximum number of arrangement rectangles;

[0021] The iteration of layout is terminated when the area of ​​the remaining un-laid rectangle is less than the area of ​​the layout unit, or when the sum of the number of layout units already laid out and the potential maximum number of layout units in the remaining layout results is less than or equal to the current maximum number of layout units.

[0022] Optionally, the iterative arrangement of the remaining unarranged rectangles in the pruned arrangement result specifically includes:

[0023] Based on the long-side and short-side layout results after pruning, the layout coordinates of the pruning results are formed.

[0024] Determine the baseline layout coordinates based on the long-side and short-side layout conditions corresponding to the current maximum number of material outputs;

[0025] The distances between the pruned layout coordinates and the baseline layout coordinates are sorted in ascending order, and a preset number of pruned layout results are selected from front to back for iterative layout.

[0026] This invention provides a material discharge device that discharges material onto a rectangular block of material, using the smallest circumscribed rectangle corresponding to the object to be discharged as the discharge unit; comprising:

[0027] The side arrangement determination module is used to determine the possible arrangement of several vertical and horizontal arrangement units along the long side of the rectangular whole material, as well as the possible arrangement of several vertical and horizontal arrangement units along the short side of the rectangular whole material.

[0028] The combination module is used to combine the long side optional layout with the short side optional layout, and determine the layout result on the rectangular whole material by arranging the layout units in a centrally symmetrical manner. It removes the layout results where the layout units overlap, and retains the layout results corresponding to the combination results where the layout units are arranged horizontally or vertically.

[0029] The fitness determination module is used to determine the number of already arranged layout units and the current maximum layout number in the remaining layout results, and to determine the area of ​​the remaining un-laid rectangle in the middle of the rectangular whole; based on the ratio of the area of ​​the remaining un-laid rectangle to the area of ​​the layout unit, the potential maximum layout number of the remaining un-laid rectangle is determined.

[0030] The pruning module is used to prune the corresponding layout results when the sum of the number of layout units already arranged and the potential maximum number of layout units in the remaining layout results is less than the current maximum number of layout units.

[0031] The iterative layout module is used to iteratively layout the remaining un-layed rectangles in the pruned layout result to update the layout result and the current maximum number of layouts, until the area of ​​the remaining un-layed rectangles is less than the area of ​​the layout unit; the layout result corresponding to the current maximum number of layouts is taken as the final layout result.

[0032] The present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described material feeding method.

[0033] The present invention provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the above-described material feeding method.

[0034] The above-mentioned at least one technical solution adopted in this invention can achieve the following beneficial effects:

[0035] When traditional material layout algorithms are based on the left bottom, the final layout result often squeezes the remaining gaps to one side of the whole material, forming long and scattered remaining spaces, resulting in a high waste rate.

[0036] This invention arranges layout units of the same size on a rectangular whole material (the whole material can be rectangular materials, including fabrics, mechanical manufacturing materials, etc.). The remaining layout rectangle uses a mixed horizontal and vertical layout method on both its long and short sides, forming a centrally symmetrical rotating layout result. This concentrates the remaining space near the center of the whole material after each round of layout, increasing the concentration of the remaining space and allowing for maximum further layout. The entire layout process forms a combination of multi-array rotating arrangements plus a central layout array. This multi-array layout method increases the concentration of the remaining space, improves the utilization rate of the whole material space, and enhances the layout effect. Attached Figure Description

[0037] The accompanying drawings, which are included to provide a further understanding of the invention and form part of this invention, illustrate exemplary embodiments of the invention and are used to explain the invention, but do not constitute an undue limitation of the invention. In the drawings:

[0038] Figure 1 A schematic diagram of a material discharge method provided by the present invention;

[0039] Figure 2 This is a schematic diagram of a small rectangle arranged horizontally according to the present invention;

[0040] Figure 3 A schematic diagram of a small rectangle arranged vertically according to the present invention;

[0041] Figure 4 A schematic diagram of a small rectangular center-symmetric rotational arrangement provided by the present invention;

[0042] Figure 5 This invention provides an example of a material layout result diagram;

[0043] Figure 6 This invention provides a schematic diagram of a second round of iterative material arrangement.

[0044] Figure 7 A schematic diagram of the final material layout provided by the present invention;

[0045] Figure 8 A schematic diagram of a discharge device provided by the present invention;

[0046] Figure 9 This is a schematic diagram of a computer device for implementing a material discharge method according to the present invention. Detailed Implementation

[0047] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this invention, and not all of them. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0048] The technical solutions provided by the various embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0049] Figure 1 This is a schematic diagram of a material layout method according to the present invention. The method involves laying out materials on a rectangular block, using the smallest bounding rectangle corresponding to the material to be laid out as the layout unit. Specifically, it includes the following steps:

[0050] S101: Determine the possible arrangement of several vertically arranged and horizontally arranged units along the long side of the rectangular material, and determine the possible arrangement of several vertically arranged and horizontally arranged units along the short side of the rectangular material.

[0051] S102: Combine the optional layout options on the long side with the optional layout options on the short side, and determine the layout result on the rectangular whole material by arranging the layout units in a centrally symmetrical manner. Remove the layout results where the layout units overlap, and retain the layout results corresponding to the combination results where the layout units are arranged horizontally or vertically.

[0052] S103: Determine the number of already arranged material units and the current maximum number of material units in the remaining material arrangement results, and determine the area of ​​the remaining unarranged rectangles in the middle of the rectangular whole; based on the ratio of the area of ​​the remaining unarranged rectangles to the area of ​​the material units, determine the potential maximum number of material units that can be arranged in the remaining unarranged rectangles.

[0053] S104: When the sum of the number of already arranged layout units and the potential maximum number of layout units in the remaining layout results is less than the current maximum number of layout units, the corresponding layout results are pruned.

[0054] S105: Iterate through the remaining un-laid rectangles in the pruned layout result to update the layout result and the current maximum number of layouts, until the area of ​​the remaining un-laid rectangles is less than the area of ​​the layout unit; take the layout result corresponding to the current maximum number of layouts as the final layout result.

[0055] For ease of explanation, the following description focuses solely on the server as the executing entity. The server mentioned in this invention can be a server set up on a business platform, or a device such as a desktop computer or laptop computer capable of executing the solution of this invention.

[0056] For ease of understanding, in one or more embodiments of the present invention, assume a fabric layout scenario as follows: a large rectangular piece of leather is 75×60 (hereinafter referred to as the large rectangle), and it is necessary to divide it into smaller rectangular pieces of leather, each 8.5×6.5 (hereinafter referred to as the small matrix). What is the maximum number of smaller rectangular pieces that can be divided into?

[0057] Theoretically, we can get 75 × 60 / (8.5 × 6.5) = 81.44, rounded down to 81, meaning the theoretical maximum is 81. Considering that both the length and width need to be rounded, assuming all the small rectangles are arranged horizontally, 60 / 6.5 × (75 / 8.5) = 9.23 × 8.82 = 72. Figure 2 The small rectangle shown is complete. Figure 2 This is a schematic diagram of a small rectangle arranged horizontally in this invention.

[0058] Assuming the small rectangles are all arranged vertically, 75 / 6.5*(60 / 8.5) = 11.2*7.06 = 77 rectangles. Figure 3 As shown, Figure 3 This is a schematic diagram of a vertical arrangement of small rectangles in this invention.

[0059] Figure 4 This is a schematic diagram of a centrally symmetrical rotational arrangement of small rectangles according to the present invention. Figure 4 As can be seen, the purple part is arranged vertically, the green part is arranged horizontally, the grass green part is arranged vertically, and the red part is arranged horizontally. It is a centrally symmetrical figure. By rotating and arranging the remaining space in the middle of the large rectangle through central symmetry, a small rectangle can still be arranged. The total number of arrangements reaches the theoretical maximum of 81.

[0060] Based on this, in one or more embodiments of the present invention, the server can first determine the possible material arrangement when the material units are arranged vertically and horizontally along the sides of the rectangular whole material.

[0061] Specifically, the server can first determine the maximum number of vertically arranged units along the long side of the rectangular material. Then, for each optional vertical arrangement of the long side from zero to the maximum number of vertically arranged units, it can determine the maximum number of horizontally arranged units along the long side of the rectangular material when the remaining space along the long side is used for horizontal arrangement. The server can then combine this optional vertical arrangement with the corresponding maximum number of horizontally arranged units to obtain the optional arrangement of the long side.

[0062] Similarly, determine the maximum number of vertically arranged units along the short side of the rectangular material when arranging them side by side. Then, for each possible vertical arrangement of the short side from zero to the maximum number of vertically arranged units, determine the maximum number of horizontally arranged units along the short side of the rectangular material when arranging them side by side in the remaining space along the short side. Combine this possible vertical arrangement of the short side with the corresponding maximum number of horizontally arranged units to obtain the possible arrangement of the segment side corresponding to this possible vertical arrangement of the short side.

[0063] Continuing with the hypothetical material discharge scenario described above, in order to achieve... Figure 4 The optimal material arrangement is shown below. Let the purple part have x1 units in the X-axis direction and y1 units in the Y-axis direction, and the green part have x2 units in the X-axis direction and y2 units in the Y-axis direction.

[0064] Then there is

[0065] On the X-axis: Based on 6.5x1 + 8.5x2 <= 75, when x1 = 1, 2, ..., 11, the corresponding maximum x2 can be calculated, as shown in Table 1. drop means discard.

[0066] Table 1. Round 1 (x1, x2)

[0067]

[0068] Among them, (0, 8) is definitely not the optimal point relative to (1, 8), so this case is discarded.

[0069] After discarding certain cases that are definitely not better solutions, we can obtain Table 2.

[0070] Table 2 shows the optimized first round (x1, x2).

[0071]

[0072] Similarly, on the y-axis: according to 8.5y1+6.5y2<=60, when y2=1,2……,9, the maximum y1 can be found, as shown in Table 3.

[0073] Table 3. First round (y2, y1)

[0074]

[0075] After discarding certain cases that are definitely not better solutions, we can obtain Table 4.

[0076] Table 4 shows the optimized first round (y2, y1).

[0077]

[0078] The server can then combine the long-side optional layout options with the short-side optional layout options, and determine the layout result on the rectangular whole material by arranging the layout units in a centrally symmetrical manner, as shown in Table 5.

[0079] Table 5: Number of small rectangles accumulated in the first round

[0080]

[0081] Since when x1>11 / 2 and y1>7 / 2, or x2>8 / 2 and y2>9 / 2, the layout results on the rectangular whole material are determined by the centrally symmetrical arrangement of the layout units, there are overlapping layout results. If the centrally symmetrical arrangement of the layout units is not adopted, the remaining part is not concentrated in the center of the matrix, which does not meet the goal of concentrating and maximizing the remaining area. These combination results are discarded, and only the layout results corresponding to the combination results of the layout units being arranged horizontally or vertically are retained, that is, the two combination results in the upper left and lower right corners of Table 5.

[0082] At this point, the server can use 2×x1×y1+2×x2×y2 to calculate the number of already arranged units in the remaining arrangement results and determine the current maximum arrangement number, as shown in Table 5, the current maximum arrangement number is 80.

[0083] Furthermore, the server can determine the area of ​​the remaining undistributed rectangle in the middle of the rectangular block:

[0084] When x1 <= 11 / 2 and y2 <= 9 / 2, the values ​​of the long and short sides of the remaining unfilled rectangle are (75 - 2 × 6.5 × x1, 60 - 2 × 6.5 × y2).

[0085] When x1 > 11 / 2 and y2 > 9 / 2, the values ​​of the remaining unfilled rectangle's long and short sides are (60 - 2 × 8.5 × x2, 60 - 2 × 8.5 × y1), as shown in Table 6.

[0086] Table 6. Sizes (length, width) of the remaining central rectangle

[0087]

[0088] The server can determine the maximum potential number of remaining unfilled rectangles to be filled based on the ratio of the area of ​​the remaining unfilled rectangles to the area of ​​the filling unit.

[0089] Then, the server can determine the fitness of the remaining layout results based on the sum of the number of layout units already arranged and the potential maximum number of layout units in the remaining layout results.

[0090] Calculation of appropriateness: Solving for 2×x1×y1+2×x2×y2+the potential maximum number of remaining un-distributed rectangles, we can obtain the theoretical maximum value of the number of small matrices corresponding to the distribution result.

[0091] Taking points (7,3) and (6,2) as an example: 64 + 26 × 24 / 6.5 / 8.5 = 75.29. Table 7 can be obtained from Table 6 above.

[0092] Table 7 shows the fitness of the remaining material discharge results according to the (x1,x2) and (y2,y1) classification method.

[0093]

[0094] Then, pruning can be performed based on fitness. When the fitness is less than the current maximum number of discharges, the corresponding discharge result will be pruned.

[0095] Taking points (7,3) and (6,2) as an example: 75.29 < 80, the material layout result is pruned. For points (1,8), (9,0) and (11,0), (0,7), the maximum number of matrices that can be directly calculated are 72 + 7 = 79 and 77 respectively, and they are also pruned.

[0096] After pruning those values ​​less than or equal to 80, Table 8 is obtained.

[0097] Table 8 After pruning

[0098]

[0099] Among them, (11,0) and (9,0) are also discarded because such an arrangement is meaningless.

[0100] Based on the above process, the server can iteratively arrange the remaining unarranged rectangles in the pruned layout result until a termination condition is met. In one or more embodiments of the present invention, the server can iteratively arrange the remaining unarranged rectangles in the pruned layout result to update the layout result and the current maximum number of layouts. The iterative layout is terminated when the area of ​​the remaining unarranged rectangle is less than the area of ​​the layout unit, or when the sum of the number of layout units already arranged and the potential maximum number of layouts in the remaining layout result is less than or equal to the current maximum number of layouts.

[0101] Furthermore, in one or more embodiments of the present invention, the server can form the layout coordinates of the pruned layout results based on the long side layout and short side layout of the pruned layout results, and then determine the reference layout coordinates formed by the long side layout and short side layout of the layout results corresponding to the current maximum number of layouts, so as to sort the distance between the layout coordinates of the pruned layout results and the reference layout coordinates in ascending order, and select a preset number of pruned layout results from front to back for iterative layout.

[0102] For example, the server can use the genetic algorithm described above to select the eight closest layout results to the center for iterative layout. Taking points (5,5) and (4,4) as an example: the remaining points are (10,8), and a small rectangle (8.5,6.5) can be placed there. The number of small rectangles that can be placed is 80 + 1 = 81. The final result is as follows. Figure 4 As shown.

[0103] Furthermore, in one or more embodiments of the present invention, when pruning, a depth-first algorithm can be used to prune, perform a depth search on the material distribution result corresponding to the current maximum material distribution number, and accumulate the iterative maximum material distribution number obtained by the depth search to the current maximum material distribution number to obtain the updated current maximum material distribution number, and prune branches that are less than or equal to the updated current maximum material distribution number.

[0104] Taking the layout results of (7,3) and (6,2) as an example, the depth pruning process is illustrated: the remaining un-layed rectangle (24,26) is as follows. Figure 5 As shown, Figure 5 This is a schematic diagram of an example material layout result in this invention.

[0105] A second round of material arrangement is performed based on the remaining unarranged rectangle (24, 26), as shown in Table 9 on the X-axis:

[0106] Table 9. Round 2 (x1, x2)

[0107]

[0108] On the Y-axis, as shown in Table 10:

[0109] Table 10 Second Round (y2, y1)

[0110]

[0111] and then:

[0112] Table 11: Number of small rectangles accumulated in the second round

[0113]

[0114] Table 12 Sizes (length, width) of the remaining unfilled rectangles

[0115]

[0116] For example, (7,26) Figure 6 As shown, Figure 6 This is a schematic diagram of a second round of iterative material arrangement in this invention.

[0117] 7*26 / (6,5*8.5)=3.29, rounded down to 3. The rectangle (7,26) can hold three smaller matrices vertically, as shown below. Figure 7 As shown, Figure 7 This is a schematic diagram illustrating the final material layout in one example of this invention. The current cycle then ends.

[0118] After exiting the current loop, the calculation is 24*26 / (6.5*8.5) = 11.29. The upper loop only needs to find a layout with a value of 11 to exit. The remaining space can hold a maximum of 3 small rectangles, so a total of 64 + 8 + 3 = 75 matrices can be placed. Finally, during the iteration process, a matrix of the shape shown can be found. Figure 4 The optimal solution.

[0119] based on Figure 1 The material arrangement method shown in this invention uses a mixed horizontal and vertical arrangement of material arrangement units on both the long and short sides of the remaining unarranged rectangle of the whole material to form a centrally symmetrical rotational material arrangement result. Thus, after each round of material arrangement, the remaining space is concentrated near the center of the whole material, which increases the concentration of the remaining space and allows the remaining space to be arranged to the maximum extent, thereby improving the utilization rate of the whole material space and improving the material arrangement effect.

[0120] The rotary cutting method of this invention ensures the central region is concentrated and maximized. The combined application of inequality equations to obtain the optimal point on the boundary, genetic sorting algorithm, and deep pruning method improves the convergence speed of material arrangement and increases the efficiency of the material arrangement method.

[0121] When applying the material discharge method provided by this invention, it is not necessary to follow the instructions provided. Figure 1 The steps shown are executed in sequence. The specific execution order of each step can be determined as needed, and this invention does not impose any restrictions on it.

[0122] The above describes a material discharge method provided by one or more embodiments of the present invention. Based on the same idea, the present invention also provides a corresponding material discharge device, such as... Figure 8 As shown.

[0123] Figure 8 This is a schematic diagram of a material discharge device provided by the present invention. On a rectangular material block, material is discharged using the smallest circumscribed rectangle corresponding to the discharge object as the discharge unit; including:

[0124] The side arrangement determination module 201 is used to determine the possible arrangement of several arrangement units arranged vertically and horizontally along the long side of the rectangular whole material, and to determine the possible arrangement of several arrangement units arranged vertically and horizontally along the short side of the rectangular whole material.

[0125] Combination module 202 is used to combine the long side optional material layout with the short side optional material layout, and determine the material layout result on the rectangular whole material by arranging the material layout units in a centrally symmetrical manner. It removes the material layout results where the material layout units overlap, and retains the material layout results corresponding to the combination results of the material layout units being arranged horizontally or vertically.

[0126] The fitness determination module 203 is used to determine the number of already arranged layout units and the current maximum number of layout units in the remaining layout results, and to determine the area of ​​the remaining un-laid rectangle in the middle of the rectangular whole; based on the ratio of the area of ​​the remaining un-laid rectangle to the area of ​​the layout unit, the potential maximum number of layout units of the remaining un-laid rectangle is determined.

[0127] The pruning module 204 is used to prune the corresponding layout results when the sum of the number of layout units already arranged and the potential maximum number of layout units in the remaining layout results is less than the current maximum number of layout units.

[0128] The iterative layout module 205 is used to iteratively layout the remaining un-layed rectangles in the pruned layout result to update the layout result and the current maximum number of layouts, until the area of ​​the remaining un-layed rectangles is less than the area of ​​the layout unit; the layout result corresponding to the current maximum number of layouts is taken as the final layout result.

[0129] Specific limitations regarding the material feeding device can be found in the limitations on the material feeding method above, and will not be repeated here. Each module in the aforementioned material feeding device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device in hardware form, or stored in the memory of a computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0130] The present invention also provides a computer-readable storage medium storing a computer program that can be used to execute the above-described... Figure 1 The provided material discharge method.

[0131] The present invention also provides Figure 9 The schematic diagram of the computer device shown is as follows: Figure 9 As shown, at the hardware level, this computer device includes a processor, internal bus, network interface, memory, and non-volatile memory, and may also include other hardware required for business operations. The processor reads the corresponding computer program from the non-volatile memory into memory and then executes it to achieve the above. Figure 1 The provided material discharge method.

[0132] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. Any references to memory, storage, databases, or other media used in the embodiments provided by this invention can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0133] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this invention.

Claims

1. A method of discharging material, characterized by, The method comprises the following steps: determining the maximum number of long-side vertical arrangement of the material units along the long side of the rectangular material; for each optional long-side vertical arrangement from zero to the maximum number of long-side vertical arrangement, determining the maximum number of long-side horizontal arrangement of the material units arranged in the remaining space of the long side of the rectangular material, and combining the optional long-side vertical arrangement with the corresponding maximum number of long-side horizontal arrangement to obtain the long-side optional arrangement condition corresponding to the optional long-side vertical arrangement; determining the maximum number of short-side vertical arrangement of the material units along the short side of the rectangular material; for each optional short-side vertical arrangement from zero to the maximum number of short-side vertical arrangement, determining the maximum number of short-side horizontal arrangement of the material units arranged in the remaining space of the short side of the rectangular material, and combining the optional short-side vertical arrangement with the corresponding maximum number of short-side horizontal arrangement to obtain the short-side optional arrangement condition corresponding to the optional short-side vertical arrangement; combining the long-side optional arrangement condition with the short-side optional arrangement condition to determine the arrangement result of the combination result on the rectangular material in a center-symmetrical arrangement manner of the material units, removing the arrangement result with overlapping material units, and retaining the arrangement result corresponding to the combination result of full horizontal arrangement or full vertical arrangement of the material units; determining the number of arranged material units in the remaining arrangement result and the current maximum number of material units, and determining the area of the remaining unarranged rectangular material in the middle of the rectangular material; determining the potential maximum number of material units of the remaining unarranged rectangular material according to the ratio of the area of the remaining unarranged rectangular material to the area of the material unit; pruning the corresponding arrangement result when the sum of the number of arranged material units in the remaining arrangement result and the potential maximum number of material units is less than the current maximum number of material units; determining the arrangement coordinates of the pruned arrangement result according to the long-side arrangement condition and the short-side arrangement condition of the pruned arrangement result; determining the reference arrangement coordinates formed by the long-side arrangement condition and the short-side arrangement condition of the arrangement result corresponding to the current maximum number of material units; sorting the distance between the arrangement coordinates of the pruned arrangement result and the reference arrangement coordinates in ascending order, and selecting a preset number of pruned arrangement results from front to back for iterative arrangement; updating the arrangement result and the current maximum number of material units; terminating the iterative arrangement when the area of the remaining unarranged rectangular material is less than the area of the material unit, or the sum of the number of arranged material units in the remaining arrangement result and the potential maximum number of material units is less than or equal to the current maximum number of material units; taking the arrangement result corresponding to the current maximum number of material units as the final arrangement result.

2. A discharge apparatus characterized by, The method comprises the following steps: The edge row determination module is configured to determine a maximum long-edge vertical row quantity when the material units are arranged in long-edge vertical rows along the long edges of the rectangular whole material; for each selectable long-edge vertical row condition from zero to the maximum long-edge vertical row quantity, determine a maximum long-edge horizontal row quantity when the material units are arranged in long-edge horizontal rows in the remaining space of the long edges of the rectangular whole material, and combine the selectable long-edge vertical row condition and the corresponding maximum long-edge horizontal row quantity to obtain a long-edge selectable arrangement condition corresponding to the selectable long-edge vertical row condition; determine a maximum short-edge vertical row quantity when the material units are arranged in short-edge vertical rows along the short edges of the rectangular whole material; for each selectable short-edge vertical row condition from zero to the maximum short-edge vertical row quantity, determine a maximum short-edge horizontal row quantity when the material units are arranged in short-edge horizontal rows in the remaining space of the short edges of the rectangular whole material, and combine the selectable short-edge vertical row condition and the corresponding maximum short-edge horizontal row quantity to obtain a short-edge selectable arrangement condition corresponding to the selectable short-edge vertical row condition; The combination module is configured to combine the long-edge selectable arrangement condition and the short-edge selectable arrangement condition to determine a combination result on the rectangular whole material in a manner of arranging the material units in a central symmetry, remove the arrangement result in which the material units overlap, and retain the arrangement result corresponding to the combination result in which the material units are arranged in full horizontal rows or full vertical rows; The fitness determination module is configured to determine the number of the arranged material units in the remaining arrangement result and the current maximum arrangement quantity, and determine the area of the remaining unarranged rectangle in the middle of the rectangular whole material; determine the potential maximum arrangement quantity of the remaining unarranged rectangle according to the ratio of the area of the remaining unarranged rectangle to the area of the material unit; The pruning module is configured to prune the corresponding arrangement result when the sum of the number of the arranged material units in the remaining arrangement result and the potential maximum arrangement quantity is less than the current maximum arrangement quantity; The iterative arrangement module is configured to form arrangement coordinates of the pruned arrangement result according to the long-edge arrangement condition and the short-edge arrangement condition of the pruned arrangement result; determine reference arrangement coordinates formed by the long-edge arrangement condition and the short-edge arrangement condition of the arrangement result corresponding to the current maximum arrangement quantity; sort distances between the arrangement coordinates of the pruned arrangement result and the reference arrangement coordinates in ascending order, and select a preset number of the pruned arrangement results from front to back to perform iterative arrangement; update the arrangement result and the current maximum arrangement quantity; terminate the iterative arrangement when the area of the remaining unarranged rectangle is less than the area of the material unit, or the sum of the number of the arranged material units in the remaining arrangement result and the potential maximum arrangement quantity is less than or equal to the current maximum arrangement quantity; and take the arrangement result corresponding to the current maximum arrangement quantity as the final arrangement result.

3. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and the computer program is executed by the processor to implement the method in claim 1.

4. A computer device, comprising: The computer program is stored in the memory and executable on the processor, and the processor implements the method in claim 1 when executing the program. The computer program is stored in the memory and executable on the processor, and the processor implements the method in claim 1 when executing the program.

Images