A method and system for recycling scrap sheet material

Abstract

The application provides a method and system for recycling waste boards, and belongs to the technical field of board recycling, and comprises the following steps: determining an initial board sequence set to be arranged; the initial board sequence set to be arranged comprises a plurality of board sequences to be arranged, and the number of the boards in each board sequence to be arranged is in one-to-one correspondence with the minimum circumscribed rectangle of a board to be arranged and the posture of the minimum circumscribed rectangle; taking the initial board sequence set to be arranged as an initial population, calculating the fitness value of each board sequence to be arranged in the initial population according to the attribute information of the waste boards; the fitness value represents the utilization rate of the waste boards utilized by the corresponding board sequence to be arranged; performing a crossover and mutation operation on the initial population according to the fitness value, updating the initial population according to the crossover and mutation result, and determining the board sequence to be arranged with the highest fitness value as a processing guide scheme until a preset evolution generation number is reached, so that the utilization rate of the waste boards can be improved.

Description

Technical Field

[0001] This invention relates to the field of waste board recycling technology, and in particular to a method and system for recycling waste board. Background Technology

[0002] Solid wood panels are an important raw material for furniture manufacturing. However, during the production process, small defects such as creases and holes may occur on the surface of the panels due to processing errors. These defects can seriously affect the appearance and mechanical properties of the product, leading to the discarding of entire panels and resulting in waste and a high scrap rate. Therefore, it is necessary to reuse discarded panels. Summary of the Invention

[0003] The purpose of this invention is to provide a method and system for reusing waste boards, thereby improving the utilization rate of waste boards.

[0004] To achieve the above objectives, the present invention provides the following solution:

[0005] A method for reusing waste board materials includes the following steps:

[0006] Step 1: Determine the initial set of material sequences to be arranged; the initial set of material sequences to be arranged includes several material sequences to be arranged, and the material number in each material sequence to be arranged corresponds one-to-one with the minimum bounding rectangle of a material to be arranged and the orientation of the minimum bounding rectangle.

[0007] Step 2: Using the initial set of waste board sequences as the initial population, calculate the fitness value of each waste board sequence in the initial population based on the attribute information of the waste boards; the fitness value represents the utilization rate of the waste boards by the corresponding waste board sequence, and the attribute information of the waste boards includes waste board size information, waste area location information, and waste area size information;

[0008] Step 3: Perform crossover and mutation operations on the initial population based on the fitness value, and update the initial population based on the crossover and mutation results;

[0009] Step 4: Determine if the preset number of evolutionary generations has been reached. If yes, proceed to Step 5; otherwise, go back to Step 3.

[0010] Step 5: Determine the sequence of discarded boards with the highest fitness value in the initial population as the processing guidance scheme for the scrapped boards.

[0011] Optionally, determining the initial set of material sequences to be arranged specifically includes:

[0012] Step 11: Obtain the attribute information of several boards to be arranged; the attribute information of the boards to be arranged includes: board number that corresponds one-to-one with the minimum bounding rectangle of the board to be arranged and the orientation of the minimum bounding rectangle;

[0013] Step 12: Based on the board numbers of several boards to be arranged, an initial sequence of boards to be arranged is obtained;

[0014] Step 13: Change the orientation of a random number of the plates to be arranged in the initial sequence of plates to be arranged, and renumber the plates whose orientation has changed in the initial sequence of plates to be arranged to obtain a sequence of plates to be arranged.

[0015] Step 14: Repeat step 13 several times to obtain several sequences of boards to be arranged; these sequences of boards to be arranged form the initial set of sequences of boards to be arranged.

[0016] Optionally, changing the orientation of a random number of boards in the initial sequence of boards to be arranged, and renumbering the boards whose orientations have changed in the initial sequence of boards to be arranged to obtain a new sequence of boards to be arranged, specifically includes:

[0017] Step 131: Randomly determine several board numbers from the initial sequence of boards to be arranged;

[0018] Step 132: For any selected board number, change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number;

[0019] Step 133: For any selected board number, add a symbol to the board number to change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number, so as to obtain a sequence of boards to be arranged.

[0020] Optionally, the step of calculating the fitness value of each sequence of boards to be eliminated in the initial population based on the attribute information of the scrapped boards specifically includes:

[0021] Step 21: For any sequence of boards to be arranged, determine the optimal arrangement scheme for the sequence of boards to be arranged based on the attribute information of the scrapped boards and the arrangement constraints; the optimal arrangement scheme includes multiple board numbers that can be arranged into the scrapped boards; the arrangement constraints include: the boundary of the boards to be arranged does not exceed the boundary of the scrapped boards and the boards to be arranged do not cover the scrapped area;

[0022] Step 22: For any sequence of boards to be arranged, calculate the fitness value of the sequence of boards to be arranged based on the total area of ​​the multiple boards to be arranged in the optimal arrangement scheme corresponding to the sequence of boards to be arranged and the area of ​​the scrapped boards.

[0023] Optionally, the fitness value of the sequence of plates to be arranged is calculated according to the following formula:

[0024]

[0025] Where r is the number of board numbers in the optimal placement scheme corresponding to the board sequence to be arranged, si is the area of ​​the board to be arranged corresponding to the i-th board number, and SA is the area of ​​the scrapped board.

[0026] Optionally, the arrangement constraint condition is as follows:

[0027]

[0028] Where r is the number of boards placed in the same layer, and k is the number of boards placed in the same column. sl is the number of boards placed in the same layer from the left edge of the scrapped board to the scrapping point, sr is the number of boards placed in the same layer from the right edge of the scrapped board to the scrapping point; tt is the number of boards placed in the same column from the top edge of the scrapped board to the scrapping point, and tb is the number of boards placed in the same column from the bottom edge of the scrapped board to the scrapping point. w1 is the width of the first board, h1 is the height of the first board. W is the width of the scrapped board, and H is the height of the scrapped board. L l L is the horizontal width from the left edge of the scrapped sheet to the scrapped area. r H is the horizontal width from the right edge of the scrapped board to the scrapped area. t H is the vertical height from the top edge of the scrapped sheet to the scrapping area. b This refers to the vertical height from the bottom edge of the scrapped board to the scrapped area.

[0029] Optionally, the step of performing crossover and mutation operations on the initial population based on the fitness value, and updating the initial population based on the crossover and mutation results, specifically includes:

[0030] Step 31: Perform a crossover operation on every two unsorted plate sequences in the initial population to obtain a crossover population;

[0031] Step 32: Calculate the fitness value of each undiscarded board sequence in the crossover population based on the attribute information of the scrapped boards;

[0032] Step 33: Sort the unpicked board sequences in the crossover population in descending order of fitness value, select the first m / 2 unpicked board sequences, and replace the last m / 2 unpicked board sequences to obtain the intermediate population; m is the number of unpicked board sequences in the crossover population;

[0033] Step 34: Perform mutation operations on each of the unsorted plate sequences in the intermediate population to obtain the first mutant population;

[0034] Step 35: Calculate the fitness value of each undiscarded board sequence in the first mutant population based on the attribute information of the scrapped boards;

[0035] Step 36: Sort the sequences of the plates to be processed in the first mutant population in descending order of fitness value, and perform mutation operation again on the last m / 2 sequences of the plates to be processed to obtain the second mutant population;

[0036] Step 37: Calculate the fitness value of each undiscarded board sequence in the second mutant population based on the attribute information of the scrapped boards;

[0037] Step 38: Sort the unsorted plate sequences in the initial population, the first variant population, and the second variant population in descending order of fitness value, and select the first m unsorted plate sequences as the new initial population.

[0038] Optionally, the step of performing a crossover operation on every two unsorted plate sequences in the initial population specifically includes:

[0039] Step 311: For any two sequences of boards to be arranged, determine a random starting point in each of the two sequences;

[0040] Step 312: Select multiple board numbers of the same length at the random starting points of the two sequences of boards to be arranged, to obtain the first cross sequence and the second cross sequence;

[0041] Step 313: Swap the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two material sequences to be arranged.

[0042] Optionally, the mutation operation on each unsorted plate sequence in the intermediate population specifically includes:

[0043] Step 341: For any sequence of plates to be arranged, change the orientation of multiple random plates in the sequence.

[0044] Corresponding to the aforementioned method for reusing scrapped boards, the present invention also provides a system for reusing scrapped boards, wherein the system is executed by a computer to perform the method for reusing scrapped boards as described above.

[0045] According to specific embodiments provided by the present invention, the present invention discloses the following technical effects:

[0046] This invention provides a method and system for reusing scrap board materials. The method includes: determining an initial set of board material sequences to be processed; the initial set of board material sequences to be processed includes several sequences of board materials to be processed, and the board number in each sequence corresponds one-to-one with the minimum bounding rectangle and the orientation of the minimum bounding rectangle of a board material to be processed; using the initial set of board material sequences to be processed as an initial population, calculating the fitness value of each sequence of board materials to be processed in the initial population based on the attribute information of the scrap boards; the fitness value represents the utilization rate of the scrap boards by the corresponding sequence of board materials to be processed; performing crossover and mutation operations on the initial population based on the fitness values, and updating the initial population based on the crossover and mutation results; determining whether a preset number of generations has been reached, and if not, continuing to perform crossover and mutation operations on the initial population; if so, determining the sequence of board materials to be processed with the highest fitness value in the initial population as the processing guidance scheme for the scrap boards. This invention constructs an initial population and continuously iterates and crossovers it, enriching the different order and method of placing several unsorted boards into scrap boards. It also evaluates the utilization rate of each unsorted board sequence to the scrap boards as a fitness value. After evolution for a preset number of generations, it can determine the target board sequence with the highest utilization rate of scrap boards, thereby cutting the scrap boards and improving the utilization rate of scrap boards. Attached Figure Description

[0047] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0048] Figure 1 This is a flowchart of a method for reusing scrapped boards provided in Embodiment 1 of the present invention;

[0049] Figure 2 This is a schematic diagram of the horizontal edge set in the waste board recycling method provided in Embodiment 1 of the present invention;

[0050] Figure 3 This is a schematic diagram of the optimal discharge scheme in the waste board recycling method provided in Embodiment 1 of the present invention;

[0051] Figure 4 This is a cutting path diagram of the processing guidance scheme in the waste board recycling method provided in Embodiment 1 of the present invention;

[0052] Figure 5 This is a schematic diagram of a waste board recycling system provided in Embodiment 2 of the present invention. Detailed Implementation

[0053] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0054] The purpose of this invention is to provide a method and system for reusing waste boards, thereby improving the utilization rate of waste boards.

[0055] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0056] Example 1:

[0057] This embodiment provides a method for reusing scrapped wood panels, such as... Figure 1 The flowchart shown illustrates the following steps in this method for reusing waste boards:

[0058] Step 1: Determine the initial set of material sequences to be arranged; the initial set of material sequences to be arranged includes several material sequences to be arranged, and the material number in each material sequence corresponds one-to-one with the minimum bounding rectangle of a material to be arranged and the orientation of the minimum bounding rectangle; in this embodiment, Step 1 specifically includes:

[0059] Step 11: Obtain the attribute information of several boards to be arranged; the attribute information of the boards to be arranged includes: board number corresponding one-to-one with the minimum bounding rectangle of the board to be arranged and the posture of the minimum bounding rectangle; in some embodiments, the attribute information of the boards to be arranged also includes the actual height and actual width of the board to be arranged, as well as the height and width values ​​of the minimum bounding rectangle of the board to be arranged.

[0060] In this embodiment, each board to be arranged is represented by a number, such as "1" representing the first board to be arranged and "2" representing the second board to be arranged. The orientation of the board to be arranged is indicated by adding symbols to the numbers, such as "-1" representing the first board to be arranged in a 90° rotation orientation. It is understood that in some implementations, since the board number corresponds one-to-one with the minimum bounding rectangle of the board to be arranged, the orientation of the minimum bounding rectangle of the board to be arranged can only be represented in two different ways.

[0061] Step 12: Based on the board numbers of several boards to be arranged, construct an initial sequence of boards to be arranged; for example, if there are 9 boards to be arranged, the initial sequence of boards to be arranged is p = [1,2,3,4,5,6,7,8,9].

[0062] Step 13: Change the orientation of a random number of boards in the initial sequence of boards to be arranged, and renumber the boards whose orientations have changed in the initial sequence of boards to be arranged to obtain a sequence of boards to be arranged; In this embodiment, step 13 specifically includes:

[0063] Step 131: Randomly determine several board numbers from the initial sequence of boards to be arranged; for example, randomly determine several numbers between 1 and 9 as "1,4,6".

[0064] Step 132: For any selected board number, change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number; change the orientation of the boards numbered 1, 4, and 6 respectively.

[0065] Step 133: For any selected board number, add a symbol to the board number to change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number, so as to obtain a sequence of boards to be arranged; the final sequence of boards to be arranged is as follows: p1 = [-1,2,3,-4,5,-6,7,8,9].

[0066] Step 14: Repeat step 13 several times to obtain several sequences of boards to be arranged; these sequences form an initial set of boards to be arranged; for example, the final initial set of boards to be arranged, P, is shown in the following formula:

[0067]

[0068] Each row of numbers represents a sequence of boards to be arranged.

[0069] Before step 1, it is also necessary to obtain information about the scrapped boards. The scrapped board information includes the width (W), height (H), area (SA) of the scrapped boards, as well as information about the scrapped areas. The scrapped area information includes, for example, the location and length of creases, and the location and diameter of holes. The information about the scrapped boards is then stored in the database.

[0070] Step 2: Using the initial set of waste board sequences as the initial population, calculate the fitness value of each waste board sequence in the initial population based on the attribute information of the waste boards; the fitness value represents the utilization rate of the waste board by the corresponding waste board sequence, and the attribute information of the waste board includes waste board size information, waste area location information, and waste area size information; in this embodiment, based on experience selection or a random strategy, several waste board sequences are selected from the initial set of waste board sequences as the initial population; Step 2 specifically includes:

[0071] Step 21: For any sequence of boards to be arranged, determine the optimal arrangement scheme for the sequence of boards to be arranged based on the attribute information of the scrapped boards and the arrangement constraints; the optimal arrangement scheme includes multiple board numbers that can be arranged into the scrapped boards; the arrangement constraints include: the boundary of the boards to be arranged does not exceed the boundary of the scrapped boards and the boards to be arranged do not cover the scrapped area.

[0072] In some implementations, the step "for any sequence of boards to be arranged, determine the optimal placement scheme for the sequence of scrapped boards based on the attribute information of the scrapped boards and the board arrangement constraints" may specifically include:

[0073] Step 211: Use the longest side of the scrapped board as the bottom edge of the scrapped board.

[0074] Step 212: Construct a horizontal edge set based on the boards already included in the scrapped boards; the horizontal edge set includes several horizontal edges parallel to the bottom edge of the scrapped boards and not overlapping with other boards; such as Figure 2 As shown, no new boards are placed on the horizontal edges, and the horizontal edge set OTW = {otw1, otw2, otw3, otw4}. Of course, in other placement schemes, the horizontal edge set can also be OTW = {otw1, otw2, otw3, ..., otwi}, where i represents the number of the highest horizontal edges.

[0075] Step 213: In the set of horizontal edges, determine the target horizontal edge; the target horizontal edge is the horizontal edge in the set of horizontal edges that is closest to the bottom edge of the scrapped board, and the initial target horizontal edge is the bottom edge of the scrapped board; if there are several segments of the horizontal edge that is closest to the bottom edge of the scrapped board, then select the leftmost segment as the target horizontal edge.

[0076] Step 214: In the sequence of boards to be arranged, select boards with width information less than or equal to the target horizontal edge width as target boards to be arranged.

[0077] Step 215: Based on the attribute information of the scrapped boards and the layout constraints, the target board is placed into the scrapped boards. In this embodiment, the layout constraints are as follows:

[0078]

[0079] Where r is the number of boards placed in the same layer, and k is the number of boards placed in the same column. sl is the number of boards placed in the same layer from the left edge of the scrapped board to the scrapping point, sr is the number of boards placed in the same layer from the right edge of the scrapped board to the scrapping point; tt is the number of boards placed in the same column from the top edge of the scrapped board to the scrapping point, and tb is the number of boards placed in the same column from the bottom edge of the scrapped board to the scrapping point. w1 is the width of the first board, h1 is the height of the first board. W is the width of the scrapped board, and H is the height of the scrapped board. L l L is the horizontal width from the left edge of the scrapped sheet to the scrapped area. r H is the horizontal width from the right edge of the scrapped board to the scrapped area. t H is the vertical height from the top edge of the scrapped sheet to the scrapping area. b This refers to the vertical height from the bottom edge of the scrapped board to the scrapped area.

[0080] It is understandable that, apart from scrapped boards, the height and width of other boards described here refer to the height and width of the minimum bounding rectangle corresponding to the board.

[0081] Step 216: If the target material is successfully discharged into the scrap material, proceed to step 217.

[0082] Step 217: Update the sequence of plates to be arranged and the horizontal edge set; and jump to step 213.

[0083] Step 218: If the target material cannot be discharged into the scrapped material, proceed to step 219.

[0084] Step 219: Move the target horizontal edge up beyond the scrap area and jump to step 214 until no more new boards can be placed on the target horizontal edge.

[0085] In step 214, if there are multiple boards in the sequence of boards to be arranged that meet the condition that "width information is less than or equal to the target horizontal edge width", then:

[0086] Select the widest and shortest board material as the target board material to be discharged, so that more boards can be discharged into the scrapped board material.

[0087] Step 22: For any sequence of boards to be arranged, calculate the fitness value of the sequence based on the total area of ​​the multiple boards to be arranged in the optimal arrangement scheme corresponding to the sequence and the area of ​​the scrapped boards. In this embodiment, the fitness value of the sequence of boards to be arranged can be calculated according to the following formula:

[0088]

[0089] Where r is the number of board numbers in the optimal placement scheme corresponding to the board sequence to be arranged, si is the area of ​​the board to be arranged corresponding to the i-th board number, and SA is the area of ​​the scrapped board.

[0090] Step 3: Perform crossover and mutation operations on the initial population based on the fitness value, and update the initial population based on the crossover and mutation results; in this embodiment, step 3 specifically includes:

[0091] Step 31: Perform a crossover operation on every two unselected plate sequences in the initial population to obtain a crossover population; in this embodiment, circular crossover is used, where the crossover genes can circle around both ends of the entire chromosome, rather than just being concentrated in the middle part of the chromosome. Each gene has an equal probability of being selected, which helps to improve the global search capability of the algorithm; the crossover operation specifically includes:

[0092] Step 311: For any two sequences of boards to be arranged, determine random starting points in each sequence. For example, if the two sequences of boards to be arranged for crossover are p1 = [-1,2,3,-4,5,-6,7,8,9] and p4 = [1,2,3,4,5,-6,7,8,-9], the starting points randomly determined in p1 and p4 within the range of 1 to 9 are 2 and 5 respectively.

[0093] Step 312: Select multiple board numbers of the same length at the random starting points of the two board sequences to be arranged, respectively, to obtain the first crossover sequence and the second crossover sequence; since the starting point selected for p4 is 5, the randomly generated length value should be in the range of [1,9-5+1]. In this embodiment, the length value is 3. Therefore, at the second gene of p1, a crossover sequence of length 3 [2,3,-4] is selected, and at the fifth gene of p2, a crossover sequence of length 3 [5,-6,7] is selected.

[0094] Step 313: Interchange the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two material sequences to be arranged; for example, by interchanging the positions of the cross sequences of p1 and p2, two cross sequences are obtained: p1' = [-1,5,-6,7,5,-6,7,8,9] and p4' = [1,2,3,4,2,3,-4,8,-9].

[0095] Step 32: Calculate the fitness value of each unsorted board sequence in the crossover population based on the attribute information of the scrapped boards.

[0096] Step 33: Sort the material sequences to be sorted in the crossover population in descending order of fitness value, select the first m / 2 material sequences to be sorted, and replace the last m / 2 material sequences to be sorted to obtain the intermediate population; m is the number of material sequences to be sorted in the crossover population.

[0097] Step 34: Perform mutation operation on each of the un-discarded board sequences in the intermediate population to obtain the first mutated population; in this embodiment, the mutation operation specifically includes: for any un-discarded board sequence, changing the posture of a random number of un-discarded boards in the un-discarded board sequence.

[0098] Step 35: Calculate the fitness value of each undiscarded board sequence in the first mutant population based on the attribute information of the scrapped boards.

[0099] Step 36: Sort the sequences of the plates to be processed in the first mutant population in descending order of fitness value, and perform mutation operation again on the last m / 2 sequences of the plates to be processed to obtain the second mutant population.

[0100] Step 37: Calculate the fitness value of each undiscarded board sequence in the second mutant population based on the attribute information of the scrapped boards.

[0101] Step 38: Sort the unsorted plate sequences in the initial population, the first variant population, and the second variant population in descending order of fitness value, and select the first m unsorted plate sequences as the new initial population.

[0102] Step 4: Determine if the preset number of generations has been reached. If yes, proceed to Step 5; otherwise, go back to Step 3.

[0103] Step 5: Determine the sequence of discarded boards with the highest fitness value in the initial population as the processing guidance scheme for the scrapped boards; such as... Figure 3 As shown, in this embodiment, the optimal placement scheme from the sequence of boards to be placed with the highest fitness value is p. best =[1,-2,-3,4,5,6,-7,-8,-9].

[0104] After obtaining the optimal discharge scheme as a processing guide, such as Figure 5 As shown, based on the processing guidelines, taking the lower left corner of the first board as the origin, and using the actual width and height information of the board, the coordinates of the remaining inflection points of the board can be obtained. Then, the origin coordinates and the coordinates of each inflection point of the second board can be obtained. Thus, the coordinates of the inflection points of all boards in the entire processing guidelines can be traversed, resulting in a coordinate set SET.

[0105] SET=[{(x1,y1),(x2,y2),...,(xi,yi)},...]

[0106] Where [] represents the coordinate set of each board, {} represents the coordinate information of a board, which stores the coordinate information of each inflection point of a board, i is the number of inflection points corresponding to a board, and the number of {} in the SET array represents the number of boards in the processing guidance scheme.

[0107] Furthermore, based on the coordinates of the inflection points of each board and the distances between them, the cutting path diagram can be obtained, such as... Figure 4 As shown in the diagram, the scrapped boards can be automatically cut based on the obtained path diagram.

[0108] This invention constructs an initial population and iterates and mutates it to enrich the different order and methods of arranging several unarranged board materials into scrap board materials. It evaluates the utilization rate of each unarranged board material sequence to the scrap board material as a fitness value. After a preset number of generations of evolution, it can determine the target board material sequence with the highest utilization rate of scrap board materials, thereby cutting the scrap board materials and improving the utilization rate. Furthermore, with the development of computer technology and the improvement of sorting algorithms, the intelligent and rapid computing power of computers can be applied to the production of furniture boards, overcoming the time-consuming disadvantage of manual sorting to a certain extent, while saving board materials and avoiding waste.

[0109] Example 2:

[0110] Furthermore, the method of Embodiment 1 of the present invention can also be used by means of Figure 5 The architecture of the waste material recycling system shown is implemented as follows. Figure 5 As shown, the waste board recycling system may include an initial board sequence determination module 1, an initial population determination module 2, a fitness value calculation module 3, an initial population update module 4, a first judgment module 5, and a processing scheme determination module 6; some modules may also have sub-units for implementing their functions, for example, the fitness value calculation module 3 also includes a board proposed placement unit 3-1 and a utilization rate determination unit 3-2. Of course, Figure 5 The architecture shown is merely exemplary; it can be omitted as needed when implementing different functionalities. Figure 5 One or at least two components of the system shown.

[0111] The program portion of a technology can be considered a "product" or "artifact" existing in the form of executable code and / or related data, and is involved in or implemented through a computer-readable medium. Tangible, permanent storage media can include memory or storage used by any computer, processor, or similar device or related module. For example, various semiconductor memories, tape drives, disk drives, or any similar device capable of providing storage functionality for software.

[0112] All software, or parts thereof, may sometimes communicate via networks, such as the Internet or other communication networks. Such communication can load software from one computer device or processor to another. For example, loading software from a server or host computer of a video object detection device to a hardware platform of a computer environment, or another computer environment that implements the system, or a system with similar functionality related to providing the information needed for object detection. Therefore, another medium capable of transmitting software elements can also be used as a physical connection between local devices, such as light waves, radio waves, electromagnetic waves, etc., propagated through cables, fiber optic cables, or air. Physical media used for carrier waves, such as cables, wireless connections, or fiber optic cables, can also be considered as media carrying software. In this context, unless limited to tangible "storage" media, the term "readable medium" for a computer or machine refers to the medium involved in the execution of any instructions by the processor.

[0113] Specific examples are used in this article, but the above description is only to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of the present invention. Those skilled in the art should understand that the various modules or steps of the present invention described above can be implemented using general-purpose computer devices. Optionally, they can be implemented using computer-executable program code, and thus, they can be stored in a storage device for execution by a computer device, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. The present invention is not limited to any specific combination of hardware and software.

[0114] Furthermore, those skilled in the art will recognize that, based on the principles of this invention, there will be variations in the specific implementation methods and application scope. Therefore, the content of this specification should not be construed as limiting the invention.

Claims

1. A method for reusing waste board materials, characterized in that, The method for reusing the scrapped boards includes: Step 1: Determine the initial set of material sequences to be arranged; the initial set of material sequences to be arranged includes several material sequences to be arranged, and the material number in each material sequence corresponds one-to-one with the minimum bounding rectangle of a material to be arranged and the orientation of the minimum bounding rectangle; Step 1 specifically includes: Step 11: Obtain the attribute information of several boards to be arranged; the attribute information of the boards to be arranged includes: board number that corresponds one-to-one with the minimum bounding rectangle of the board to be arranged and the orientation of the minimum bounding rectangle; Step 12: Based on the board numbers of several boards to be arranged, an initial sequence of boards to be arranged is obtained; Step 13: Change the orientation of a random number of the plates to be arranged in the initial sequence of plates to be arranged, and renumber the plates whose orientation has changed in the initial sequence of plates to be arranged to obtain a sequence of plates to be arranged. Step 14: Repeat step 13 several times to obtain several sequences of boards to be arranged; these sequences of boards to be arranged form an initial set of sequences of boards to be arranged. Step 2: Using the initial set of waste board sequences as the initial population, calculate the fitness value of each waste board sequence in the initial population based on the attribute information of the waste boards; the fitness value represents the utilization rate of the waste board by the corresponding waste board sequence, and the attribute information of the waste board includes waste board size information, waste area location information, and waste area size information; Step 2 specifically includes: Step 21: For any sequence of boards to be arranged, determine the optimal arrangement scheme for the sequence of boards to be arranged based on the attribute information of the scrapped boards and the arrangement constraints; the optimal arrangement scheme includes multiple board numbers that can be arranged into the scrapped boards; the arrangement constraints include: the boundary of the boards to be arranged does not exceed the boundary of the scrapped boards and the boards to be arranged do not cover the scrapped area; Step 22: For any sequence of boards to be arranged, calculate the fitness value of the sequence based on the total area of ​​the multiple boards to be arranged in the optimal arrangement scheme corresponding to the sequence and the area of ​​the scrapped boards; calculate the fitness value of the sequence based on the following formula: in, r This represents the number of board numbers in the optimal placement scheme corresponding to the sequence of boards to be arranged. si For the first i The area of ​​the board to be arranged corresponding to each board number. SA The area of ​​the scrapped board material; Step 3: Perform crossover and mutation operations on the initial population based on the fitness value, and update the initial population based on the crossover and mutation results; Step 3 specifically includes: Step 31: Perform a crossover operation on every two unsorted plate sequences in the initial population to obtain a crossover population; Step 32: Calculate the fitness value of each undiscarded board sequence in the crossover population based on the attribute information of the scrapped boards; Step 33: Sort the sequences of plates to be processed in the crossover population in descending order of fitness value, and select the top... m / 2 sequences of boards to be arranged, after replacement m / 2 unsorted plate sequences were used to obtain the intermediate population; m This represents the number of unsorted plate sequences in the crossover population; Step 34: Perform mutation operations on each of the unsorted plate sequences in the intermediate population to obtain the first mutant population; Step 35: Calculate the fitness value of each undiscarded board sequence in the first mutant population based on the attribute information of the scrapped boards; Step 36: Sort the sequences of plates to be processed in the first mutant population in descending order of fitness value, and then... m The two unsorted plate sequences were mutated again to obtain the second mutant population; Step 37: Calculate the fitness value of each undiscarded board sequence in the second mutant population based on the attribute information of the scrapped boards; Step 38: Sort the unselected plate sequences in the initial population, the first variant population, and the second variant population in descending order of fitness value, and select the top... m One sequence of plates to be sorted is used as a new initial population; Step 4: Determine if the preset number of evolutionary generations has been reached. If yes, proceed to Step 5; otherwise, go back to Step 3. Step 5: The sequence of boards with the highest fitness value in the initial population is determined as the processing guidance scheme for the scrapped boards; the processing guidance scheme is used to generate cutting paths by calculating the inflection point coordinates of each board.

2. The method for reusing scrapped boards according to claim 1, characterized in that, The step of changing the orientation of a random number of boards in the initial sequence of boards to be arranged, and renumbering the boards whose orientations have changed in the initial sequence of boards to be arranged to obtain a new sequence of boards to be arranged, specifically includes: Step 131: Randomly determine several board numbers from the initial sequence of boards to be arranged; Step 132: For any selected board number, change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number; Step 133: For any selected board number, add a symbol to the board number to change the orientation of the minimum bounding rectangle of the board to be arranged corresponding to the board number, so as to obtain a sequence of boards to be arranged.

3. The method for reusing scrapped boards according to claim 1, characterized in that, The constraint conditions for the arrangement of the plates are shown in the following formula: in, r This refers to the number of boards arranged on the same floor. k This refers to the number of boards arranged in the same column. sl This refers to the number of boards placed on the same floor from the left edge of the scrapped board to the scrapping location. sr This refers to the number of boards placed on the same layer from the right edge of the scrapped board to the scrapping location; tt This refers to the number of boards arranged in the same column from the top edge of the scrapped board to the scrapping point. tb This refers to the number of boards arranged in the same column from the bottom edge of the scrapped board to the scrapping point. w 1 represents the width of the first board. h 1 represents the height of the first board. W The width of the scrapped sheet material. H The height of the scrapped boards, L l The horizontal width from the left edge of the scrapped board to the scrapped area. L r The horizontal width from the right edge of the scrapped board to the scrapped area. H t The vertical height from the top edge of the scrapped board to the scrapped area. H b This refers to the vertical height from the bottom edge of the scrapped board to the scrapped area.

4. The method for reusing scrapped boards according to claim 1, characterized in that, The step of performing a crossover operation on every two unsorted plate sequences in the initial population specifically includes: Step 311: For any two sequences of boards to be arranged, determine a random starting point in each of the two sequences; Step 312: Select multiple board numbers of the same length at the random starting points of the two sequences of boards to be arranged, to obtain the first cross sequence and the second cross sequence; Step 313: Swap the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two material sequences to be arranged.

5. The method for reusing waste board materials according to claim 1, characterized in that, The mutation operation on each unsorted plate sequence in the intermediate population specifically includes: Step 341: For any sequence of plates to be arranged, change the orientation of multiple random plates in the sequence.

6. A system for recycling waste wood panels, characterized in that, When the waste board recycling system is run by a computer, it executes the waste board recycling method as described in any one of claims 1 to 5.

Images