CN115600696A - Method and system for recycling scrapped plates - Google Patents
Method and system for recycling scrapped plates Download PDFInfo
- Publication number
- CN115600696A CN115600696A CN202211100708.5A CN202211100708A CN115600696A CN 115600696 A CN115600696 A CN 115600696A CN 202211100708 A CN202211100708 A CN 202211100708A CN 115600696 A CN115600696 A CN 115600696A
- Authority
- CN
- China
- Prior art keywords
- plate
- scrapped
- sequence
- plates
- initial
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004064 recycling Methods 0.000 title claims abstract description 35
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000036544 posture Effects 0.000 claims description 30
- 230000009191 jumping Effects 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims description 3
- 238000007599 discharging Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000003860 storage Methods 0.000 description 5
- 238000004519 manufacturing process Methods 0.000 description 4
- 238000005520 cutting process Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 210000000349 chromosome Anatomy 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000003754 machining Methods 0.000 description 2
- 230000015654 memory Effects 0.000 description 2
- 230000035772 mutation Effects 0.000 description 2
- 108090000623 proteins and genes Proteins 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 101150076211 TH gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 239000002994 raw material Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 108700026220 vif Genes Proteins 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/30—Administration of product recycling or disposal
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Biomedical Technology (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Sustainable Development (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Operations Research (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a system for recycling scrapped plates, which belong to the technical field of plate recycling and comprise the following steps: determining an initial plate sequence set to be arranged; the initial plate sequence set to be arranged comprises a plurality of plate sequences to be arranged, and the plate number in each plate sequence to be arranged corresponds to the minimum external rectangle of a plate to be arranged and the posture of the minimum external rectangle one by one; taking the initial plate sequence set to be arranged as an initial population, and calculating the fitness value of each plate sequence to be arranged in the initial population according to the attribute information of the scrapped plate; the fitness value represents the utilization rate of the scrapped plate utilized by the corresponding plate sequence to be arranged; and carrying out cross variation operation on the initial population according to the fitness value, updating the initial population according to a cross variation result until a preset evolution algebra is reached, and determining a to-be-arranged plate sequence with the highest fitness value as a processing guidance scheme, so that the utilization rate of the scrapped plates can be improved.
Description
Technical Field
The invention relates to the technical field of scrap plate recycling, in particular to a scrap plate recycling method and a scrap plate recycling system.
Background
The solid wood board is an important raw material for manufacturing furniture, and in the manufacturing process of the furniture, some small-range defects such as creases, holes and the like may be generated on the surface of the board due to processing operation errors, and the small-range defects such as the creases, the holes and the like can seriously affect the appearance and the mechanical property of the product, so that the whole board is discarded, the board is wasted, and the problem of high waste rate exists. Therefore, it is necessary to reuse the scrap plate.
Disclosure of Invention
The invention aims to provide a method and a system for recycling a scrapped plate, which improve the utilization rate of the scrapped plate.
In order to achieve the purpose, the invention provides the following scheme:
a method for recycling a scrapped plate comprises the following steps:
step 1: determining an initial plate sequence set to be arranged; the initial plate sequence set to be arranged comprises a plurality of plate sequences to be arranged, and the plate number in each plate sequence to be arranged corresponds to the minimum external rectangle of a plate to be arranged and the posture of the minimum external rectangle one by one;
step 2: calculating the fitness value of each plate sequence to be arranged in the initial population according to the attribute information of the scrapped plate by taking the initial plate sequence set to be arranged as the initial population; the fitness value represents the utilization rate of the scrapped plate utilized by the corresponding plate sequence to be arranged, and the attribute information of the scrapped plate comprises scrapped plate size information, scrapped area position information and scrapped area size information;
and step 3: carrying out cross variation operation on the initial population according to the fitness value, and updating the initial population according to a cross variation result;
and 4, step 4: judging whether a preset evolution algebra is reached, if so, executing a step 5, otherwise, jumping to a step 3;
and 5: and determining the sequence of the plates to be arranged with the highest fitness value in the initial population as the processing guidance scheme of the scrapped plates.
Optionally, the determining the initial sheet sequence set to be arranged specifically includes:
step 11: acquiring attribute information of a plurality of plates to be arranged; the attribute information of the plate to be arranged comprises: the plate numbers correspond to the minimum external rectangle of the plate to be arranged and the posture of the minimum external rectangle one by one;
step 12: according to the plate numbers of a plurality of plates to be arranged, an initial plate sequence to be arranged is obtained through construction;
step 13: changing the postures of the random number of the plates to be arranged in the initial plate sequence to be arranged, and numbering the plates to be arranged with the changed postures in the initial plate sequence to be arranged again to obtain a plate sequence to be arranged;
step 14: step 13 is repeatedly executed for a plurality of times to obtain a plurality of plate sequences to be arranged; and the plurality of plate sequences to be arranged form an initial plate sequence set to be arranged.
Optionally, the changing of the postures of the boards to be arranged in the random number in the initial board sequence to be arranged is performed, and the initial boards to be arranged, of which the postures in the initial board sequence to be arranged are changed, are renumbered to obtain a board sequence to be arranged, and specifically includes:
step 131: randomly determining the serial numbers of a plurality of plates in the initial plate sequence to be arranged;
step 132: aiming at any selected plate number, changing the posture of the minimum external rectangle of the plate to be arranged corresponding to the plate number;
step 133: and adding symbols to the plate numbers aiming at any selected plate number so as to change the posture representation of the minimum external rectangle of the plate to be arranged corresponding to the plate number, and obtain a plate sequence to be arranged.
Optionally, the calculating, according to the attribute information of the scrapped plates, the fitness value of each sequence of plates to be arranged in the initial population specifically includes:
step 21: aiming at any plate sequence to be arranged, determining an optimal arrangement scheme of the plate sequence to be arranged according to the attribute information of scrapped plates and plate arrangement constraint conditions; the optimal arrangement scheme comprises a plurality of plate numbers which can be arranged into the scrapped plates; the row plate constraint conditions comprise: the boundary of the plate to be arranged does not exceed the boundary of the scrapped plate and the plate to be arranged does not cover the scrapped area;
step 22: and aiming at any plate sequence to be arranged, calculating the adaptability value of the plate sequence to be arranged according to the total area of a plurality of plates to be arranged in the optimal arrangement scheme corresponding to the plate sequence to be arranged and the area of the scrapped plate.
Optionally, the fitness value of the sequence of the sheets to be arranged is calculated according to the following formula:
and r is the number of the plate numbers in the optimal arrangement scheme corresponding to the plate sequence to be arranged, and si is the area of the plate to be arranged corresponding to the ith plate number. And SA is the area of the scrapped plate.
Optionally, the bank constraint is as follows:
wherein r is the number of the plates arranged in the same layer, and k is the number of the plates arranged in the same row. sl is the number of the plates discharged from the left edge of the scrapped plate to the scrapped part on the same layer, and sr is the number of the plates discharged from the right edge of the scrapped plate to the scrapped part on the same layer; tt is the number of the plates discharged from the upper edge of the scrapped plate to the scrapped part in the same row, and tb is the number of the plates discharged from the lower edge of the scrapped plate to the scrapped part in the same row. w is a 1 Width of the 1 st plate, h 1 Is the height of the 1 st plate. W is the width of the scrapped plate, and H is the height of the scrapped plate. L is l Is the horizontal width from the left edge of the scrapped plate to the scrapped area, L r Is the horizontal width from the right edge of the scrapped plate to the scrapped area H t Vertical height from upper edge of scrapped plate to scrapped area, H b Is the vertical height from the lower edge of the scrapped plate to the scrapping area.
Optionally, the performing a cross variation operation on the initial population according to the fitness value, and updating the initial population according to a cross variation result specifically includes:
step 31: performing cross operation on every two plate sequences to be arranged in the initial population to obtain a cross population;
step 32: calculating the fitness value of each plate sequence to be arranged in the cross population according to the attribute information of the scrapped plates;
step 33: sorting the plate sequences to be arranged in the cross population in a descending order of the fitness value, selecting the front m/2 plate sequences to be arranged, and replacing the front m/2 plate sequences to be arranged to obtain an intermediate population; m is the number of the plate sequences to be arranged in the cross population;
step 34: carrying out variation operation on the sequences of the plates to be arranged in the intermediate population to obtain a first variation population;
step 35: calculating the fitness value of each to-be-arranged plate sequence in the first variation population according to the attribute information of the scrapped plates;
step 36: sorting the plate sequences to be arranged in the first variation population in a descending order according to the fitness value, and performing variation operation on the m/2 plate sequences to be arranged again to obtain a second variation population;
step 37: calculating the fitness value of each plate sequence to be arranged in the second variation population according to the attribute information of the scrapped plates;
step 38: and sorting the plate sequences to be arranged in the initial population, the first variation population and the second variation population in a descending order of fitness values, and selecting the first m plate sequences to be arranged as a new initial population.
Optionally, the crossing operation is performed on every two to-be-arranged plate sequences in the initial population, and specifically includes:
step 311: aiming at any two sequences of the plates to be arranged, respectively determining random starting points in the two sequences of the plates to be arranged;
step 312: selecting a plurality of plate numbers with the same length at random starting points of two plate sequences to be arranged respectively to obtain a first cross sequence and a second cross sequence;
step 313: and interchanging the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two sequences of the plates to be arranged.
Optionally, the performing a mutation operation on each sequence of the plates to be arranged in the intermediate population specifically includes:
step 341: and aiming at any plate sequence to be arranged, changing the postures of a plurality of plates to be arranged randomly in the plate sequence to be arranged.
Corresponding to the scrapped plate recycling method, the invention also provides a scrapped plate recycling system, and when the scrapped plate recycling system is operated by a computer, the scrapped plate recycling method is executed.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a method and a system for recycling a scrapped plate, wherein the method for recycling the scrapped plate comprises the following steps: determining a sequence set of initial plates to be arranged; the initial plate sequence set to be arranged comprises a plurality of plate sequences to be arranged, and the plate number in each plate sequence to be arranged corresponds to the minimum external rectangle of a plate to be arranged and the posture of the minimum external rectangle one by one; taking the initial plate sequence set to be arranged as an initial population, and calculating the fitness value of each plate sequence to be arranged in the initial population according to the attribute information of the scrapped plate; the fitness value represents the utilization rate of the scrapped plate utilized by the corresponding plate sequence to be arranged; carrying out cross variation operation on the initial population according to the fitness value, and updating the initial population according to a cross variation result; judging whether a preset evolution algebra is reached, and if not, continuing to perform cross variation operation on the initial population; and if so, determining the sequence of the plates to be arranged with the highest fitness value in the initial population as a processing guidance scheme of the scrapped plates. According to the invention, by constructing the initial population and carrying out continuous iterative cross variation on the initial population, different discharging sequences and discharging modes for discharging a plurality of plates to be discharged into the scrapped plates are enriched, the utilization rate of each plate to be discharged to the scrapped plates is evaluated as an adaptive value according to the sequence of each plate to be discharged, and after evolution of a preset evolution algebra is carried out, a target plate sequence with the highest utilization rate of the scrapped plates can be determined, so that the scrapped plates are cut, and the utilization rate of the scrapped plates is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required in the embodiments will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a method for recycling a scrapped plate according to embodiment 1 of the present invention;
FIG. 2 is a schematic view of a horizontal edge set in the method for recycling a scrapped plate according to embodiment 1 of the present invention;
fig. 3 is a schematic diagram of an optimal discharge scheme in the method for recycling a scrapped plate according to embodiment 1 of the present invention;
fig. 4 is a cutting path diagram of a processing guidance scheme in the scrap plate recycling method provided in embodiment 1 of the present invention;
fig. 5 is a schematic structural diagram of a scrapped plate recycling system according to embodiment 2 of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
The invention aims to provide a method and a system for recycling a scrapped plate, which improve the utilization rate of the scrapped plate.
In order to make the aforementioned objects, features and advantages of the present invention more comprehensible, the present invention is described in detail with reference to the accompanying drawings and the detailed description thereof.
Example 1:
the embodiment provides a method for recycling a scrapped plate, which comprises the following steps as shown in a flow chart of fig. 1:
step 1: determining an initial plate sequence set to be arranged; the initial plate sequence set to be arranged comprises a plurality of plate sequences to be arranged, and the plate number in each plate sequence to be arranged corresponds to the minimum external rectangle of a plate to be arranged and the posture of the minimum external rectangle one by one; in this embodiment, step 1 specifically includes:
step 11: acquiring attribute information of a plurality of plates to be arranged; the attribute information of the plate to be arranged comprises: the plate numbers correspond to the minimum external rectangle of the plate to be arranged and the posture of the minimum external rectangle one by one; in some embodiments, the attribute information of the plate to be arranged further includes an actual height and an actual width of the plate to be arranged, and a height value and a width value of a minimum bounding rectangle of the plate to be arranged.
In this embodiment, one plate to be arranged is represented by one number, for example, "1" represents a first plate to be arranged, "2" represents a second plate to be arranged, and the posture of the plate to be arranged is represented by adding a symbol to the number, for example "-1" represents that the first plate to be arranged is represented by a posture rotated by 90 °. It can be understood that in some embodiments, since the plate numbers correspond to the minimum bounding rectangles of the plates to be arranged one by one, the postures of the minimum bounding rectangles of the plates to be arranged are only represented in two different ways.
Step 12: according to the plate numbers of a plurality of plates to be arranged, an initial plate sequence to be arranged is obtained through construction; if there are 9 boards to be arranged, the obtained initial board sequence to be arranged is p = [1,2,3,4,5,6,7,8,9].
Step 13: changing the postures of the random number of the plates to be arranged in the initial plate sequence to be arranged, and numbering the plates to be arranged with the changed postures in the initial plate sequence to be arranged again to obtain a plate sequence to be arranged; in this embodiment, step 13 specifically includes:
step 131: randomly determining the serial numbers of a plurality of plates in the initial plate sequence to be arranged; such as randomly determining several numbers between 1 and 9 as "1,4,6".
Step 132: aiming at any selected plate number, changing the posture of the minimum external rectangle of the plate to be arranged corresponding to the plate number; the postures of the plates to be arranged, which are numbered 1,4 and 6, are changed respectively.
Step 133: adding symbols to the plate numbers according to any selected plate number to change the posture representation of the minimum external rectangle of the plate to be arranged corresponding to the plate number, so as to obtain a plate sequence to be arranged; the resulting sequence of sheets to be arranged, e.g. p 1 ＝[-1,2,3,-4,5,-6,7,8,9]。
Step 14: step 13 is repeatedly executed for a plurality of times to obtain a plurality of plate sequences to be arranged; forming an initial plate sequence set by the plurality of plate sequences to be arranged; for example, the final initial sheet sequence set P to be arranged is shown as follows:
wherein the numerical sequence of each row represents a sequence of plates to be arranged.
Before step 1, the information of the scrapped plate is also required to be obtained, the information of the scrapped plate comprises the width (W), the height (H), the area (SA) and the scrapped area information of the scrapped plate, the scrapped area information comprises the position and the length of a crease and the position and the diameter of a hole, and the information of the scrapped plate is stored in a database.
Step 2: calculating the fitness value of each plate sequence to be arranged in the initial population according to the attribute information of the scrapped plate by taking the initial plate sequence set to be arranged as the initial population; the fitness value represents the utilization rate of the scrapped plate utilized by the corresponding plate sequence to be arranged, and the attribute information of the scrapped plate comprises scrapped plate size information, scrapped area position information and scrapped area size information; in the embodiment, a plurality of to-be-arranged plate sequences are selected from the initial to-be-arranged plate sequence set as an initial population according to an empirical selection or random strategy; the step 2 specifically comprises the following steps:
step 21: aiming at any plate sequence to be arranged, determining an optimal arrangement scheme of the plate sequence to be arranged according to the attribute information of the scrapped plates and the plate arrangement constraint conditions; the optimal arrangement scheme comprises a plurality of plate numbers which can be arranged into the scrapped plates; the row plate constraint conditions comprise: the boundary of the plate to be arranged does not exceed the boundary of the scrapped plate and the plate to be arranged does not cover the scrapped area.
In some embodiments, the step "determining an optimal arrangement scheme of a to-be-arranged plate sequence according to attribute information of a scrapped plate and a plate arrangement constraint condition for any to-be-arranged plate sequence" may specifically include:
step 211: and taking the longest side length of the scrapped plate as the bottom edge of the scrapped plate.
Step 212: constructing a horizontal edge set according to the plates discharged into the scrapped plates; the horizontal edge set comprises a plurality of horizontal edges which are parallel to the bottom edge of the scrapped plate and are not overlapped with other plates; as shown in fig. 2, no new board is ejected on the horizontal edge, and the horizontal edge set OTW = { OTW1, OTW2, OTW3, OTW4}. Of course, in other permutation schemes, the set of horizontal edges may also be OTW = { OTW1, OTW2, OTW3, \8230;, otwi }, where i represents the number of the highest horizontal edge.
Step 213: determining a target horizontal edge in the horizontal edge set; the target horizontal edge is the horizontal edge which is closest to the bottom edge of the scrapped plate in the horizontal edge set, and the initial target horizontal edge is the bottom edge of the scrapped plate; and if the horizontal edge closest to the bottom edge of the scrapped plate has a plurality of sections, selecting the section at the leftmost side as a target horizontal edge.
Step 214: and selecting the plate to be arranged with the width information less than or equal to the width of the target horizontal edge in the plate sequence to be arranged as a target to be arranged into the plate.
Step 215: and discharging the target into the plate to be discharged into the scrapped plate according to the attribute information of the scrapped plate and the plate discharge constraint condition. In this embodiment, the plate arrangement constraint conditions are as follows:
wherein r is the number of the plates discharged into the same layer, and k is the number of the plates discharged into the same row. sl is the number of the plates discharged from the left edge of the scrapped plate to the same layer of the scrapped part, and sr is the number of the plates discharged from the right edge of the scrapped plate to the same layer of the scrapped part; tt is the number of the plates discharged from the upper edge of the scrapped plate to the scrapped part in the same row, and tb is the number of the plates discharged from the lower edge of the scrapped plate to the scrapped part in the same row. w is a 1 Is the width of the 1 st plate, h 1 Is the height of the 1 st plate. W is the width of the scrapped plate, and H is the height of the scrapped plate. L is l Is the horizontal width from the left edge of the scrapped plate to the scrapped area, L r Is the horizontal width from the right edge of the scrapped plate to the scrapped area H t For the vertical height from the upper edge of the scrapped plate to the scrapping area, H b Is the vertical height from the lower edge of the scrapped plate to the scrapped area.
It is understood that the height and width of the other sheets described herein, except for the scrap sheet, refer to the height and width of the sheet corresponding to the minimum bounding rectangle.
Step 216: if the target plate is successfully discharged into the scrapped plate, step 217 is executed.
Step 217: updating the sequence of the plates to be arranged and the horizontal edge set; and jumps to step 213.
Step 218: if the target is discharged into the plate and cannot be discharged into the scrapped plate, step 219 is executed.
Step 219: and moving the target horizontal edge upwards to exceed the scrapping area, and jumping to step 214 until a new plate cannot be discharged on the target horizontal edge.
In step 214, if there are a plurality of boards to be arranged in the sequence of boards to be arranged that meet the condition that the width information is less than or equal to the target horizontal edge width, then:
selecting the plate to be arranged with the highest width and the lowest height as a target to be arranged into the plate; so that more boards to be arranged can be discharged into the scrapped boards.
Step 22: and aiming at any plate sequence to be arranged, calculating the adaptability value of the plate sequence to be arranged according to the total area of a plurality of plates to be arranged in the optimal arrangement scheme corresponding to the plate sequence to be arranged and the area of the scrapped plate. In this embodiment, the fitness value of the sequence of the sheets to be arranged may be calculated according to the following formula:
and r is the number of the plate numbers in the optimal arrangement scheme corresponding to the plate sequence to be arranged, and si is the area of the plate to be arranged corresponding to the ith plate number. And SA is the area of the scrapped plate.
And step 3: carrying out cross variation operation on the initial population according to the fitness value, and updating the initial population according to a cross variation result; in this embodiment, step 3 specifically includes:
step 31: performing cross operation on every two plate sequences to be arranged in the initial population to obtain a cross population; in the embodiment, annular intersection is adopted, the crossed genes can surround the two ends of the whole chromosome, and are not only concentrated in the middle part of the chromosome, and the probability of each gene being selected is equal, thereby being beneficial to improving the global search capability of the algorithm; the crossover operation specifically includes:
step 311: aiming at any two plate sequences to be arranged, respectively determining random starting points in the two plate sequences to be arranged; if the sequence of two plates to be arranged is p 1 ＝[-1,2,3,-4,5,-6,7,8,9]And p 4 ＝[1,2,3,4,5,-6,7,8,-9]In the range of 1 to 9, each is p 1 And p 4 The randomly determined starting points in (1) are 2 and 5;
step 312: selecting a plurality of plate numbers with the same length at random starting points of two plate sequences to be arranged respectively to obtain a first cross sequence and a second cross sequence; due to p 4 The selected starting point is 5, and the randomly generated length value should be [1,9-5+1 ]]In the present embodiment, the length is 3, and is in p 1 At the 2 nd gene, a cross-over sequence [2,3, -4 ] with a length of 3 was selected]At p of 2 At the 5 th gene, a cross-over sequence of length 3 [5, -6,7 ] was selected]。
Step 313: exchanging the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two sequences of the plates to be arranged; such as mixing p 1 And p 2 To obtain two cross sequences p 1 ’＝[-1,5,-6,7,5,-6,7,8,9]And p 4 ’＝[1,2,3,4,2,3,-4,8,-9]。
Step 32: and calculating the fitness value of each plate sequence to be arranged in the cross population according to the attribute information of the scrapped plates.
Step 33: sorting the sequences of the plates to be arranged in the cross population in a descending order of fitness values, selecting the first m/2 sequences of the plates to be arranged, and replacing the first m/2 sequences of the plates to be arranged to obtain an intermediate population; and m is the number of the plate sequences to be arranged in the cross population.
Step 34: carrying out variation operation on the sequences of the plates to be arranged in the intermediate population to obtain a first variation population; in this embodiment, the mutation operation specifically includes: and aiming at any plate sequence to be arranged, changing the postures of a random number of plates to be arranged in the plate sequence to be arranged.
Step 35: and calculating the fitness value of each to-be-arranged plate sequence in the first variation population according to the attribute information of the scrapped plate.
Step 36: and sorting the plate sequences to be arranged in the first variation population in a descending order of the fitness value, and performing variation operation on the m/2 plate sequences to be arranged again to obtain a second variation population.
Step 37: and calculating the fitness value of each sequence of the plates to be arranged in the second variation population according to the attribute information of the scrapped plates.
Step 38: and sorting the plate sequences to be arranged in the initial population, the first variation population and the second variation population in a descending order of fitness values, and selecting the first m plate sequences to be arranged as a new initial population.
And 4, step 4: and (5) judging whether a preset evolution algebra is reached, if so, executing the step 5, otherwise, jumping to the step 3.
And 5: determining a sequence of the plates to be arranged with the highest fitness value in the initial population as a processing guidance scheme of the scrapped plates; as shown in fig. 3, the optimal arrangement scheme in the sequence of the to-be-arranged boards with the highest fitness value selected in this embodiment is p best ＝[1,-2,-3,4,5,6,-7,-8,-9]。
After the optimal entering scheme is obtained as the processing guidance scheme, as shown in fig. 5, coordinates of the remaining inflection points of the sheet can be obtained according to the processing guidance scheme, with the lower left corner of the first sheet as the origin, and according to the actual width and height information of the sheet. And then the origin coordinate and each inflection point coordinate of the second plate can be obtained, so that the inflection point coordinates of each plate in the whole processing guidance scheme can be traversed, and the coordinate SET is SET:
SET＝[{(x1,y1),(x2,y2),...,(xi,yi)},...]
the method comprises the steps of obtaining a coordinate SET of each plate, storing the coordinate SET of each plate in a SET array, and obtaining a machining guidance scheme, wherein [ ] represents the coordinate SET of each plate, { } represents the coordinate information of one plate, the coordinate information of each inflection point of one plate is stored inside, i is the number of the inflection points corresponding to one plate, and the number of { } in the SET array represents the number of plates in the machining guidance scheme.
Furthermore, according to the coordinates of the inflection points of each plate and the distance between the inflection points, a cutting path diagram can be obtained, as shown in fig. 4. And automatically cutting the scrapped plate according to the obtained path diagram.
According to the invention, by constructing the initial population and carrying out continuous iterative cross variation on the initial population, different discharging sequences and discharging modes for discharging a plurality of plates to be discharged into the scrapped plates are enriched, the utilization rate of each plate to be discharged to the scrapped plates is evaluated as an adaptive value according to the sequence of each plate to be discharged, and after evolution of a preset evolution algebra is carried out, a target plate sequence with the highest utilization rate of the scrapped plates can be determined, so that the scrapped plates are cut, and the utilization rate of the scrapped plates is improved. With the development of computer technology and the improvement of stock layout algorithm, the intelligent and rapid computing capability of a computer is utilized to apply the computer to the production of furniture plates, so that the defect of long time consumption of manual stock layout is overcome to a certain extent, and the waste of the plates is avoided.
Example 2:
in addition, the method of embodiment 1 of the present invention can also be implemented by means of the architecture of the scrap plate recycling system shown in fig. 5. As shown in fig. 5, the scrapped plate recycling system may include an initial plate sequence set determining module 1 to be arranged, an initial population determining module 2, an adaptability value calculating module 3, an initial population updating module 4, a first judging module 5, and a processing scheme determining module 6; some modules may also have sub-units for performing their functions, for example, the plate material discharge-to-be-into unit 3-1 and the utilization rate determination unit 3-2 are also included in the fitness value calculation module 3. Of course, the architecture shown in fig. 5 is merely exemplary, and one or at least two components of the system shown in fig. 5 may be omitted as needed to implement different functions.
Portions of the technology may be considered "articles" or "articles of manufacture" in the form of executable code and/or associated data, which may be embodied or carried out by a computer readable medium. Tangible, non-transitory storage media may include memory or storage for use by any computer, processor, or similar device or associated module. For example, various semiconductor memories, tape drives, disk drives, or any similar device capable of providing a storage function for software.
All or a portion of the software may sometimes communicate over a network, such as the internet or other communication network. Such communication may load software from one computer device or processor to another. For example: from a server or host computer of the video object detection device to a hardware platform of a computer environment, or other computer environment implementing the system, or similar functionality associated with providing information needed for object detection. Thus, another medium capable of transferring software elements may also be used as a physical connection between local devices, such as optical, electrical, electromagnetic waves, etc., propagating through cables, optical cables, air, etc. The physical medium used for the carrier wave, such as an electrical, wireless connection, or optical cable, etc., can also be considered to be the medium carrying the software. As used herein, unless limited to a tangible "storage" medium, other terms referring to a computer or machine "readable medium" refer to media that participate in the execution of any instructions by a processor.
Although specific examples are employed herein, the foregoing description is only illustrative of the principles and implementations of the present invention, and the following examples are provided only to facilitate the understanding of the method and its core concepts; it will be understood by those skilled in the art that the above-described modules or steps of the present invention may be implemented by a general-purpose computer device, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by the computing device, or separately fabricated into individual integrated circuit modules, or multiple modules or steps thereof may be fabricated into a single integrated circuit module. The present invention is not limited to any specific combination of hardware and software.
Meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.
Claims (10)
1. A method for recycling a scrapped plate is characterized by comprising the following steps:
step 1: determining an initial plate sequence set to be arranged; the initial plate sequence set to be arranged comprises a plurality of plate sequences to be arranged, and the plate number in each plate sequence to be arranged corresponds to the minimum external rectangle of a plate to be arranged and the posture of the minimum external rectangle one by one;
step 2: calculating the fitness value of each plate sequence to be arranged in the initial population according to the attribute information of the scrapped plate by taking the initial plate sequence set to be arranged as the initial population; the fitness value represents the utilization rate of the scrapped plate utilized by the corresponding plate sequence to be arranged, and the attribute information of the scrapped plate comprises scrapped plate size information, scrapped area position information and scrapped area size information;
and step 3: carrying out cross variation operation on the initial population according to the fitness value, and updating the initial population according to a cross variation result;
and 4, step 4: judging whether a preset evolution algebra is reached, if so, executing a step 5, otherwise, jumping to a step 3;
and 5: and determining the sequence of the plates to be arranged with the highest fitness value in the initial population as the processing guidance scheme of the scrapped plates.
2. The method for recycling the scrapped plate according to claim 1, wherein the determining of the initial plate sequence set to be arranged specifically comprises:
step 11: acquiring attribute information of a plurality of plates to be arranged; the attribute information of the plate to be arranged comprises: the plate numbers correspond to the minimum external rectangle of the plate to be arranged and the posture of the minimum external rectangle one by one;
step 12: according to the plate numbers of a plurality of plates to be arranged, an initial plate sequence to be arranged is obtained through construction;
step 13: changing the postures of the random number of the plates to be arranged in the initial plate sequence to be arranged, and numbering the plates to be arranged with the changed postures in the initial plate sequence to be arranged again to obtain a plate sequence to be arranged;
step 14: step 13 is repeatedly executed for a plurality of times to obtain a plurality of plate sequences to be arranged; and the plurality of plate sequences to be arranged form an initial plate sequence set to be arranged.
3. The method for recycling the scrapped plate according to claim 2, wherein the changing of the postures of the plates to be arranged in random number in the initial plate sequence to be arranged and the renumbering of the plates to be arranged with changed postures in the initial plate sequence to be arranged are performed to obtain a plate sequence to be arranged, specifically comprising:
step 131: randomly determining the serial numbers of a plurality of plates in the initial plate sequence to be arranged;
step 132: aiming at any selected plate number, changing the posture of the minimum external rectangle of the plate to be arranged corresponding to the plate number;
step 133: and adding symbols to the plate numbers according to any selected plate number to change the posture representation of the minimum external rectangle of the plate to be arranged corresponding to the plate number, so as to obtain a plate sequence to be arranged.
4. The method for recycling the scrapped plate according to claim 1, wherein the calculating the fitness value of each sequence of plates to be arranged in the initial population according to the attribute information of the scrapped plate specifically comprises:
step 21: aiming at any plate sequence to be arranged, determining an optimal arrangement scheme of the plate sequence to be arranged according to the attribute information of scrapped plates and plate arrangement constraint conditions; the optimal arrangement scheme comprises a plurality of plate numbers which can be arranged into the scrapped plates; the row plate constraint conditions comprise: the boundary of the plate to be arranged does not exceed the boundary of the scrapped plate and the plate to be arranged does not cover the scrapped area;
step 22: and calculating the adaptability value of the plate sequence to be arranged according to the total area of a plurality of plates to be arranged in the optimal arrangement scheme corresponding to the plate sequence to be arranged and the area of the scrapped plate aiming at any plate sequence to be arranged.
5. The method for recycling the scrapped plate according to claim 4, wherein the fitness value of the plate sequence to be arranged is calculated according to the following formula:
and r is the number of the plate numbers in the optimal arrangement scheme corresponding to the plate sequence to be arranged, si is the area of the plate to be arranged corresponding to the ith plate number, and SA is the area of the scrapped plate.
6. The method for recycling the scrapped plate according to claim 4, wherein the plate arrangement constraint condition is as follows:
wherein r is the number of the plates discharged into the same layer, k is the number of the plates discharged into the same row, sl is the number of the plates discharged into the same layer from the left edge of the scrapped plate to the scrapped part, and sr is the number of the plates discharged into the same layer from the right edge of the scrapped plate to the scrapped part; tt is the number of the plates from the upper edge of the scrapped plate to the scrapped part in the same row, tb is the number of the plates from the lower edge of the scrapped plate to the scrapped part in the same row, and w is 1 Width of the 1 st plate, h 1 Is the height of the 1 st plate, W is the width of the scrapped plate, H is the height of the scrapped plate, L l Is the horizontal width from the left edge of the scrapped plate to the scrapped area, L r Is the horizontal width from the right edge of the scrapped plate to the scrapped area H t For the vertical height from the upper edge of the scrapped plate to the scrapping area, H b Is the vertical height from the lower edge of the scrapped plate to the scrapping area.
7. The method according to claim 1, wherein the performing a cross variation operation on the initial population according to the fitness value and updating the initial population according to a cross variation result specifically comprises:
step 31: performing cross operation on every two plate sequences to be arranged in the initial population to obtain a cross population;
step 32: calculating the fitness value of each plate sequence to be arranged in the cross population according to the attribute information of the scrapped plates;
step 33: sorting the plate sequences to be arranged in the cross population in a descending order of the fitness value, selecting the front m/2 plate sequences to be arranged, and replacing the front m/2 plate sequences to be arranged to obtain an intermediate population; m is the number of the plate sequences to be arranged in the cross population;
step 34: carrying out variation operation on the sequences of the plates to be arranged in the intermediate population to obtain a first variation population;
step 35: calculating the fitness value of each to-be-arranged plate sequence in the first variation population according to the attribute information of the scrapped plates;
step 36: sorting the plate sequences to be arranged in the first variation population in a descending order according to the fitness value, and performing variation operation on m/2 plate sequences to be arranged again to obtain a second variation population;
step 37: calculating the fitness value of each plate sequence to be arranged in the second variation population according to the attribute information of the scrapped plates;
step 38: and sorting the plate sequences to be arranged in the initial population, the first variation population and the second variation population in a descending order of fitness values, and selecting the first m plate sequences to be arranged as a new initial population.
8. The method for recycling the scrapped plate according to claim 7, wherein the step of performing cross operation on every two plate sequences to be arranged in the initial population specifically comprises the following steps:
step 311: aiming at any two sequences of the plates to be arranged, respectively determining random starting points in the two sequences of the plates to be arranged;
step 312: selecting a plurality of plate numbers with the same length at random starting points of two plate sequences to be arranged respectively to obtain a first cross sequence and a second cross sequence;
step 313: and exchanging the positions of the first cross sequence and the second cross sequence to obtain two cross sequences of the two sequences of the plates to be arranged.
9. The method for recycling the scrapped plate according to claim 7, wherein the step of performing variation operation on the sequence of the plates to be arranged in the intermediate population specifically comprises the following steps:
step 341: and aiming at any plate sequence to be arranged, changing the postures of a plurality of plates to be arranged randomly in the plate sequence to be arranged.
10. A scrap plate recycling system, wherein the scrap plate recycling system is operated by a computer to execute the scrap plate recycling method according to any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211100708.5A CN115600696A (en) | 2022-09-09 | 2022-09-09 | Method and system for recycling scrapped plates |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211100708.5A CN115600696A (en) | 2022-09-09 | 2022-09-09 | Method and system for recycling scrapped plates |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115600696A true CN115600696A (en) | 2023-01-13 |
Family
ID=84843981
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211100708.5A Pending CN115600696A (en) | 2022-09-09 | 2022-09-09 | Method and system for recycling scrapped plates |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115600696A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118212288A (en) * | 2024-05-15 | 2024-06-18 | 佛山科学技术学院 | Machine vision-based flexible layout method and system for scrapped plates |
-
2022
- 2022-09-09 CN CN202211100708.5A patent/CN115600696A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118212288A (en) * | 2024-05-15 | 2024-06-18 | 佛山科学技术学院 | Machine vision-based flexible layout method and system for scrapped plates |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110570038B (en) | Rectangular layout method and device for irregular plates with defects | |
| CN103500255A (en) | Intelligent layout method used for rectangular part | |
| US10614386B2 (en) | PCB board assembling method and assembling system | |
| CN106845726B (en) | Rectangular piece optimized blanking method oriented to excess material concentration | |
| US7870527B2 (en) | Method for stacked pattern design of printed circuit board and system thereof | |
| CN115600696A (en) | Method and system for recycling scrapped plates | |
| CN111598290A (en) | PCB splicing and blanking optimization method | |
| CN103092132A (en) | Numerical control (NC) drilling path optimization method and system and NC drilling equipment | |
| US20110167400A1 (en) | Method and mechanism for extraction and recognition of polygons in an ic design | |
| CN105956663A (en) | Parallel stock layout optimization method of special shaped part blanking | |
| CN111597768A (en) | Method, apparatus and computer-readable storage medium for constructing a set of layout patterns | |
| CN114417444A (en) | Determination method and device for layout scheme and electronic equipment | |
| CN117891143B (en) | Photoetching hot spot detection method based on 2D overlapping judgment | |
| CN101686636B (en) | Component placement apparatus, component placement setting calculation apparatus, program, and component placement setting calculation method | |
| CN116600495A (en) | Circuit board production method and device and electronic equipment | |
| CN114996781A (en) | Two-dimensional irregular part layout method and system based on actors-critics | |
| CN114462714A (en) | Information determination method and device and electronic equipment | |
| JP2008258283A (en) | Method for determining component mounting order | |
| CN111103327B (en) | Equivalent electromagnetic parameter inversion method and device for artificial structure with non-uniform dielectric material | |
| CN114037700A (en) | Panel defect detection method and device, electronic equipment and storage medium | |
| Lin et al. | PPOM: an effective post-global placement optimization methodology for better wirelength and routability | |
| CN114118000A (en) | PCB splicing and blanking method based on deep intelligent genetic optimization algorithm | |
| Guohui et al. | A hybrid genetic algorithm to optimize the printed circuit board assembly process | |
| CN110274608A (en) | Intelligent paths planning method, device and computer readable storage medium | |
| CN108805503A (en) | High-end Hydraulic Elements manufacturing based on digital workshop stores the method and system of parts |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 528225 Section B, Guanghong Section, Nonferrous Metals Industrial Park, Shishan Town, Nanhai District, Foshan City, Guangdong Province Applicant after: FOSHAN WEISHANG FURNITURE MANUFACTURING Co.,Ltd. Applicant after: Foshan University Address before: 528225 Section B, Guanghong Section, Nonferrous Metals Industrial Park, Shishan Town, Nanhai District, Foshan City, Guangdong Province Applicant before: FOSHAN WEISHANG FURNITURE MANUFACTURING Co.,Ltd. Country or region before: China Applicant before: FOSHAN University |
|
| CB02 | Change of applicant information |