CN106447089A - Cutting bed-based cutting sorting method - Google Patents

Cutting bed-based cutting sorting method Download PDF

Info

Publication number
CN106447089A
CN106447089A CN201610812379.5A CN201610812379A CN106447089A CN 106447089 A CN106447089 A CN 106447089A CN 201610812379 A CN201610812379 A CN 201610812379A CN 106447089 A CN106447089 A CN 106447089A
Authority
CN
China
Prior art keywords
bed
cutting
proportioning
model
model print
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
Application number
CN201610812379.5A
Other languages
Chinese (zh)
Inventor
董辉
江丽林
崔玉启
陈宇杰
宋文超
刘家林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Co Ltd Of Yiwu Scientific And Technical Research Institute Of Zhejiang Polytechnical University
Original Assignee
Co Ltd Of Yiwu Scientific And Technical Research Institute Of Zhejiang Polytechnical University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Co Ltd Of Yiwu Scientific And Technical Research Institute Of Zhejiang Polytechnical University filed Critical Co Ltd Of Yiwu Scientific And Technical Research Institute Of Zhejiang Polytechnical University
Priority to CN201610812379.5A priority Critical patent/CN106447089A/en
Publication of CN106447089A publication Critical patent/CN106447089A/en
Pending legal-status Critical Current

Links

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Treatment Of Fiber Materials (AREA)

Abstract

The invention discloses a cutting bed-based cutting sorting method. The method comprises the following steps of 1, setting a few initial limitation conditions; 2, calculating a possibly needed sorting quantity according to a total cutting quantity required by sample wafers of each type, upper and lower limits of a quantity of cloth laying layers of each bed, and upper and lower limits of a total quantity of cuttable cloth pieces of each layer; 3, determining a ratio range according to the total cutting quantity required by the sample wafers of each type and the upper and lower limits of the total quantity of cuttable cloth pieces of each layer, and determining all ratios, meeting requirements, of the sample wafers of each type according to the upper limit of the quantity of cloth pieces of each bed under each type for each possibly needed sorting quantity; and 4, combining the ratios meeting the requirements, calculating the quantity of cloth laying layers of each bed, calculating the required quantity of sample wafers of each type according to the calculated quantity of cloth laying layers and the corresponding ratio, comparing the quantity with the required cutting quantity, and if a difference value is in an allowed quantity error range, accepting the scheme, otherwise, rejecting the scheme. The method is relatively low in cost and relatively high in efficiency.

Description

A kind of divide bed process based on the cutting of cutting
Technical field
The invention belongs to area of computer aided partial bed technique field, it is related to a kind of cutting being applied to cutting and divides bed process.
Background technology
Competition with garment market is more and more fierce, and garment enterprise wants to obtain higher economic benefit, not only will Increase in terms of the quality and production efficiency of product it is necessary to control production cost, the cost of raw material and efficient Management.Wherein how clothing cloth carried out with effective cutting fabrication plan manage oneself becoming the key of impact dress-goods cost.
Cutting divides a scheme to determine one of principal element of cost and efficiency in dress-goods process.Cutting divides the bed to be First procedure of tailoring work, its quality directly decides the production cost of dress-goods, so quality to be improved Reduces cost, has been necessary for an efficient cutting plan, i.e. cutting divides a scheme.Cutting divides the life that bed is according to garment enterprise Product condition and order situation, are in a planned way optimized proportioning the clothes model in order, quantity, including whole production task Points several, every bed which floor, spread several models, each model spreads several, and make cloth loss is minimum, production efficiency highest Cutting operation scheme.Rational cutting divides a scheme to be by the premise of cutting, and it is not only cutter and is embodied as offer Scheme, also provides for each operation in Apparel Manufacturing and produces foundation.
Cutting partial bed technique is not still overripened, due to clothes model, the isoparametric variation of quantity, many softwares at present The process that cutting is divided with bed excessively idealizes, and operability is by force it is impossible to meet actual production demand well.A kind of good dividing Bed scheme to garment enterprise bring be not only cloth and manpower consumption saving, more can improve the fast reaction energy of enterprise Power.
Content of the invention
In order to overcome the shortcomings of that existing cutting divides the relatively costly, less efficient of a mode, the present invention is with cost-effective For the purpose of improving efficiency, the quality that cutting is divided a scheme is quantified as calculating the utilization rate of raw materials of each scheme and cuts out required The bed number dividing, when both reach overall minimum, judges that it is preferred plan.
The technical solution adopted for the present invention to solve the technical problems is：
A kind of divide bed process based on the cutting of cutting, comprise the steps：
The first step, divides bed to set initial definition condition to cutting：It is set by the user permission cutting quantitative error scope first Value w, upper limit L of every bed cloth number of plies LuWith lower limit Ld, every layer of cloth can cutting total number of packages T upper limit TuWith lower limit Td, each model Upper limit P of quantity P of every row of printu, quantity S of cutting needed for each model print1、S2、S3、S4、S5、S6；
Second step, the initial definition condition being set according to user, calculate possible point bed quantity：According to each model print Required cutting quantity calculates required cutting quantity summation S, averagely every bed cloth number of plies Laver, averagely every layer cloth cutting number of packages Taver, thus calculating upper limit C of required point of bed quantity CuWith lower limit Cd；
3rd step, determines that each model print is all and meets the proportioning requiring.
Calculate the bound of institute's score bed quantity C according to second step, from lower limit CdTo upper limit CuRound numbers divides a quantity successively Ci, wherein i mark works as external crucible number, it is then determined that the lower limit Pb of each model print proportioning Pbjmin, upper limit Pbjmax, every kind of model The all possible proportioning of print has BjKind, the quantitative relation in each bed for each model print is included according to permutation and combination principle All combinations, then judge each possible proportioning Pb whether in corresponding proportioning bound Pb one by onejmax、PBjminBetween, full Sufficient then retain, otherwise give up this kind of proportioning；Calculate the satisfactory all proportioning situations of other model prints in the same manner；
4th step, calculates paving cloth number of plies L of each bed.
The satisfactory proportioning of each model print above calculating is combined, constructs a proportioning matrix A, every kind of Model print proportioning Pb respectively to should matrix a line, each bed cloth number of plies L of required solution is as unknown column vector X, structure Build matrix equation A*X=B, the column vector that wherein B cutting quantity required by respective model print forms, solve this square Battle array equation, draws a least square solution of each bed cloth number of plies L, this least square solution is an approximate solution, more successively to each Bed cloth number of plies L is floated in the range of given threshold；Again the value of each bed different paving cloth number of plies L is combined successively, and right Proportioning Pb answered calculates respective model print total number of packages Si, by SiCompared with this model print cutting quantity of order requirements Relatively, compare difference whether in the range of set cutting quantitative error w, if it is satisfied, then retaining this proportioning Pb and paving layer of cloth Number L, as a kind of scheme, otherwise gives up, and verifies other combinations in the same manner；If tested when all possible combination of external crucible number all calculates QED, then return the 3rd step, continue to solve the possible combination of other point of bed quantity, until all possible point of bed quantity all solves Complete；All point bed schemes meeting and requiring finally are provided.
Further, in described second step, needed for according to needed for each model print, the quantity of cutting calculates each model print The quantity summation of cutting
S=∑ Si
Averagely every bed cloth number of plies
The number of packages of averagely every layer cloth cutting
Point bed quantity C according to needed for result above calculatesiThe upper limit
Required point bed numerical lower limits
Wherein ceil and floor represents respectively and rounds up and round downwards.
Further, in described 3rd step, determine the lower limit of proportioning Pb of each model print
Pbjmin=ceil (1.0*Sj/Lu)
The upper limit
Wherein ceil and floor represents respectively and rounds up and round downwards, all possible for every kind of model print Proportioning has BjKind
Each model print is included at all groups of quantitative relation (proportioning) of each bed according to the principle of permutation and combination Close, then judge each possible proportioning Pb whether in corresponding proportioning bound Pb one by onejmax、PbjminBetween, that is,
Pbjmin<∑Pb<Pbjmax
Meet and then retain, otherwise give up this kind of proportioning.Calculate the satisfactory all proportioning feelings of other model prints in the same manner Condition.
The print species of wanted cutting in actual production is more (more than three kinds), tests carrying out each model print proportioning solution When card, the step that the present invention realizes is as follows：Consider that proportioning Pb of first three model and each bed cloth number of plies L are counted first Calculate, retain wherein satisfactory combination, in advance some undesirable proportioning situations are given up, reduce calculating group below The quantity closed.Then increase a kind of model print successively, can with proportioning satisfactory in first three and the 4th kind of model print The row combination again of the proportioning of energy, solves the satisfactory combination of four kinds of model prints, by that analogy, finally draws and meet the requirements Scheme.
Beneficial effects of the present invention are mainly manifested in：To initial definition condition set after, using from less to more, by letter to Numerous principle is combined calculating；This cutting divides point bed scheme that bed process provides many, and the time that calculates is short, point bed efficiency high.
Brief description
Fig. 1 divides the program flow diagram of bed process for cutting.
Fig. 2 produces order schematic diagram for certain cutting.
Fig. 3 divides point bed scenario outcomes schematic diagram of bed process realization for cutting.
Specific embodiments
Below in conjunction with the accompanying drawings and instantiation the invention will be further described.
In conjunction with Fig. 1～Fig. 3, a kind of divide bed process based on the cutting of cutting, comprise the following steps：
The first step, divides bed to set initial definition condition to cutting.As shown in Fig. 2 present invention assumes that to 6 kinds of models XS, S, M, L, XL, XXL launch narration, first be set by the user allow cutting quantitative error value range w=4, every bed cloth number of plies L upper Limit Lu=1000 and lower limit Ld=50, every layer of cloth can cutting total number of packages T upper limit Tu=6 and lower limit Td=0, each model print Upper limit P of quantity P of every rowu=2, cutting quantity S needed for each model printiIt is respectively S1=123, S2=543, S3=447, S4=761, S5=384, S6=981.
Second step, the initial definition condition being set according to user, the primary condition being given as shown in Figure 2, calculate possibility Point bed quantity.Cutting quantity according to needed for each model print calculates cutting quantity summation needed for each model print
S=∑ Si=S1+SS+S3+S4+S5+S6=3203
Averagely every bed cloth number of plies
The number of packages of averagely every layer cloth cutting
Point bed quantity C according to needed for result above calculatesiThe upper limit
Required point bed numerical lower limits
Wherein ceil and floor represents respectively and rounds up and round downwards.
3rd step, determines that each model print is all and meets proportioning Pb requiring.Calculate point bed number of gained according to second step Amount bound Cu、Cd, round numbers divides quantity C successively to be first limited to the upper limit from downi, wherein i mark is when external crucible number (hypothesis i=3, table Show and need points 3 to carry out cutting), it is then determined that the lower limit of each model print proportioning Pb
Pbjmin=ceil (1.0*Sj/Lu)
The upper limit
Wherein ceil and floor represents respectively and rounds up and round downwards, such as XS model
PbXSmin=ceil (1.0 × 123 ÷ 1000)=1
PbXSmax=floor (1.0 × 123 ÷ 50)=2
Be possible to proportioning species B for every kind of model printj：
If dividing 3, XS model print may proportioning species B1：
B1=(2+1)3=27
Each model print is included at all groups of quantitative relation (proportioning) of each bed according to the principle of permutation and combination Close, then judge each possible proportioning Pb whether in corresponding proportioning bound Pb one by onejmax、PbjminBetween, meet and then retain, no Then give up this kind of proportioning.Calculate the satisfactory all proportioning situations of other model prints in the same manner.
4th step, calculates paving cloth number of plies L of each point of bed quantity.According to each model print satisfactory above tried to achieve Proportioning Pb is combined, and constitutes a proportioning matrix A, proportioning Pb of every kind of model print respectively to should matrix a line.False If any print XS, S, the M of three kinds of models, their proportioning is Pb respectivelyi, Pbj, Pbk, it is the row vector of a line three row, then Matrix A
Required each bed cloth number of plies regards column vector X as
Cutting quantity required by each model print regards column vector B as
So construct a matrix equation
A*X=B
Obtain the least square solution of X, this solution is an approximate solution.
Further, in the first step, to the initial definition condition setting, precision allows to cut out operator to set according to demand Error range value w cutting quantity is, upper limit L determining every bed cloth number of plies L according to the mechanical property of cuttinguWith lower limit Ld, basis Cutting size is determining upper limit T of every layer of cloth cutting quantity TuWith lower limit Td, each model print every row quantity P the upper limit Pu, the number of packages S of cutting needed for each model print is determined according to order specificationi.
Further, in the third step, point bed quantity C being calculated according to second stepiBound Cu、Cd, right successively Possible point bed quantity carries out calculating checking.For example：Cd=2, Cu=3, then point bed quantity CiPossible value has 2,3.
Further, in the third step, according to each model print proportioning lower limit Pb calculatingjmin, upper limit Pbjmax, and Number of packages upper limit P that each every layer of model print is arrangeduThe proportioning situation possible to determine each model print.For example：Assume certain The Pb of one modeljmin=1, Pbjmax=2, Pu=2, point bed quantity Ci=3, then this model print in the proportioning of each bed may be 27 kinds of (0,0,0), (0,0,1), (0,0,2), (0,1,0) (2,2,2) etc., but due to being limited by proportioning bound, The proportioning value sum of each bed just meets the requirements, that is, between the bound of proportioning
Pbjmin<∑Pb<Pbjmax
So (0,0,0), (1,1,1) (0,2,2), the just undesirable (1+1+1=such as (1,1,2) (2,2,2) 3 ＞ Pbjmax) it should give up.
Further, in the 4th step, the satisfactory proportioning of each model print tried to achieve according to the 3rd step, then to difference The various proportionings of model print are combined, and constitute a proportioning matrix A, and proportioning Pb of every kind of model print is respectively to should square A line of battle array.As shown in Figure 2：There are print XS, S, the M of three kinds of models, their proportioning is Pb respectivelyi, Pbj, Pbk, it is a line The row vectors of three row, then matrix A is just
Required each bed cloth number of plies regards column vector X as
The quantity of the wanted cutting of each model print regards column vector B as
So construct a matrix equation
A*X=B
Obtain the least square solution of X
This solution is an approximate solution；Successively each bed cloth number of plies L is floated in the threshold range setting again, carry out one by one Solve and whether meet the requirements.
Further, in the 4th step, each bed cloth number of plies tried to achieve is floated successively in the range of given threshold, It is specially：Assume that given threshold is 2, the least square solution tried to achieve is
The paving cloth number of plies of so first is the integer that (a-2) arrives between (a+2), can obtain second and third paving cloth in the same manner Number of plies value, more each bed difference value is combined successively, calculate respective model print sum with corresponding proportioning Pb, and order Single total S requiring is compared, and compares difference whether in the range of set quantitative error w, if it is satisfied, then retain should Proportioning Pb and paving cloth number of plies L, as a kind of scheme, are otherwise given up, and verify other combinations in the same manner.If the currently institute of point bed quantity It is possible to combine all to calculate verified, then return the 3rd step, the possibility continuing to solve other point of bed quantity combines, until all can Point bed quantity of energy has all solved.Finally provide all schemes meeting and requiring, as shown in Figure 3.
Further, in the 4th step, the print species of wanted cutting in actual production is more (more than three kinds), is carrying out When each model print proportioning solves checking, the step that the present invention realizes is as follows：Consider proportioning Pb of first three model first Calculated with each bed cloth number of plies L, retained wherein satisfactory combination, in advance by some undesirable proportioning situations Give up, reduce the quantity calculating combination below.Then increase a kind of model print successively, joined with satisfactory in first three Row combines ratio again with the possible proportioning of the 4th kind of model print, solves the satisfactory combination of four kinds of model prints, with such Push away, draw finally satisfactory scheme, as shown in Figure 3 point bed result.The purpose of do so is to reduce the calculating time, carrying The efficiency of high score bed.

Claims (4)

1. a kind of divide bed process based on the cutting of cutting it is characterised in that：Comprise the steps：
The first step, divides bed to set initial definition condition to cutting：It is set by the user permission cutting quantitative error value range w first, Upper limit L of every bed cloth number of plies LuWith lower limit Ld, every layer of cloth can cutting total number of packages T upper limit TuWith lower limit Td, each model print Upper limit P of quantity P of every rowu, quantity S of cutting needed for each model printi；
Second step, the initial definition condition being set according to user, calculate possible point bed quantity：According to needed for each model print Cutting quantity calculates required cutting quantity summation S, averagely every bed cloth number of plies Laver, averagely every layer cloth cutting number of packages Taver, from And calculate upper limit C of required point of bed quantity CuWith lower limit Cd；
3rd step, determines that each model print is all and meets the proportioning requiring
Calculate the bound of institute's score bed quantity C according to second step, from lower limit CdTo upper limit CuRound numbers divides quantity C successivelyi, Wherein i mark works as external crucible number, it is then determined that the lower limit Pb of each model print proportioning Pbjmin, upper limit Pbjmax, every kind of model print All possible proportioning has BjKind, the institute of the quantitative relation in each bed for each model print is included according to permutation and combination principle There is combination, then judge each possible proportioning Pb whether in corresponding proportioning bound Pb one by onejmax、PbjminBetween, meet then Retain, otherwise give up this kind of proportioning；Calculate the satisfactory all proportioning situations of other model prints in the same manner；
4th step, calculates paving cloth number of plies L of each bed
The satisfactory proportioning of each model print above calculating is combined, constructs a proportioning matrix A, every kind of model Print proportioning Pb respectively to should matrix a line, each bed cloth number of plies L of required solution, as unknown column vector X, builds square Battle array equation A*X=B, the column vector that wherein B cutting quantity required by respective model print forms, solve this matrix side Journey, draws a least square solution of each bed cloth number of plies L, and this least square solution is an approximate solution, more successively to each bed Cloth number of plies L is floated in the range of given threshold；Again the value of each bed different paving cloth number of plies L is combined successively, and corresponding Proportioning Pb calculates respective model print total number of packages Si, by SiIt is compared with this model print cutting quantity of order requirements, than Compared with difference whether in the range of set cutting quantitative error w, if it is satisfied, then retaining this proportioning Pb and paving cloth number of plies L work For a kind of scheme, otherwise give up, verify other combinations in the same manner；If verified when all possible combination of external crucible number all calculates, Then return the 3rd step, continue to solve the possible combination of other point of bed quantity, until all possible point of bed quantity has all solved；? All point bed schemes meeting and requiring are provided afterwards.
2. as claimed in claim 1 a kind of divide bed process based on the cutting of cutting it is characterised in that：In described second step, root Calculate the quantity summation of cutting needed for each model print according to the quantity of cutting needed for each model print
S=∑ Si
Averagely every bed cloth number of plies
L a v e r = L u + L d 2
The number of packages of averagely every layer cloth cutting
T a v e r = T u + T d 2
Point bed quantity C according to needed for result above calculatesiThe upper limit
C u = c e i l &lsqb; 1.0 * S L a v e r + T a v e r &rsqb;
Required point bed numerical lower limits
C d = f l o o r &lsqb; 1.0 * S L a v e r + T a v e r &rsqb;
Wherein ceil and floor represents respectively and rounds up and round downwards.
3. as claimed in claim 1 or 2 a kind of divide bed process based on the cutting of cutting it is characterised in that：In described 3rd step, Determine the lower limit of proportioning Pb of each model print
Pbjmin=ceil (1.0*Sj/Lu)
The upper limit
Pb j m a x = f l o o r ( 1.0 * S j L d )
Wherein ceil and floor represents respectively and rounds up and round downwards, all possible proportioning for every kind of model print There is BjKind
B j = ( P u + 1 ) C i
Include all combinations of the quantitative relation (proportioning) in each bed for each model print according to the principle of permutation and combination, then Judge each possible proportioning Pb whether in corresponding proportioning bound Pb one by onejmax、PbjminBetween, that is,
Pbjmin<∑Pb<Pbjmax
Meet and then retain, otherwise give up this kind of proportioning.Calculate the satisfactory all proportioning situations of other model prints in the same manner.
4. as claimed in claim 1 or 2 a kind of divide bed process based on the cutting of cutting it is characterised in that：In described 4th step, The process that each model print proportioning solves checking is as follows：Consider that proportioning Pb of first three model and each bed cloth number of plies L are entered first Row calculates, and retains wherein satisfactory combination, gives up some undesirable proportioning situations in advance, reduces meter below Calculate the quantity of combination.Then increase a kind of model print successively, with proportioning satisfactory in first three and the 4th kind of model sample The row combination again of the possible proportioning of piece, solves the satisfactory combination of four kinds of model prints, by that analogy, finally draws and meet The scheme requiring.
CN201610812379.5A 2016-09-09 2016-09-09 Cutting bed-based cutting sorting method Pending CN106447089A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610812379.5A CN106447089A (en) 2016-09-09 2016-09-09 Cutting bed-based cutting sorting method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610812379.5A CN106447089A (en) 2016-09-09 2016-09-09 Cutting bed-based cutting sorting method

Publications (1)

Publication Number Publication Date
CN106447089A true CN106447089A (en) 2017-02-22

Family

ID=58165355

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610812379.5A Pending CN106447089A (en) 2016-09-09 2016-09-09 Cutting bed-based cutting sorting method

Country Status (1)

Country Link
CN (1) CN106447089A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107341564A (en) * 2017-06-13 2017-11-10 浙江工业大学 A kind of cutting based on adaptive accelerated factor particle swarm optimization algorithm divides bed process
CN108716100A (en) * 2018-07-20 2018-10-30 圣凯诺服饰有限公司 A kind of different automatic cutting bed method of cutting out of fabric thickness and system
CN109118002A (en) * 2018-08-09 2019-01-01 广东工业大学 A kind of board-like product cutting stock and branch mailbox divide frame integrated optimization method
CN109214657A (en) * 2018-08-13 2019-01-15 浙江工业大学 It is a kind of to combine the polychrome tailoring of least square hybrid algorithm to divide bed process based on heredity
CN109359313A (en) * 2018-08-07 2019-02-19 浙江工业大学 It is a kind of the tailoring of Particle Swarm Mixed Algorithm is gathered based on examination to divide bed process
CN109685247A (en) * 2018-11-14 2019-04-26 浙江工业大学 Divide bed process based on the tailoring for improving Real Coding Genetic Algorithm

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107341564A (en) * 2017-06-13 2017-11-10 浙江工业大学 A kind of cutting based on adaptive accelerated factor particle swarm optimization algorithm divides bed process
CN108716100A (en) * 2018-07-20 2018-10-30 圣凯诺服饰有限公司 A kind of different automatic cutting bed method of cutting out of fabric thickness and system
CN108716100B (en) * 2018-07-20 2021-07-27 圣凯诺服饰有限公司 Automatic cutting bed cutting method and system for different fabric thicknesses
CN109359313A (en) * 2018-08-07 2019-02-19 浙江工业大学 It is a kind of the tailoring of Particle Swarm Mixed Algorithm is gathered based on examination to divide bed process
CN109359313B (en) * 2018-08-07 2023-04-18 浙江工业大学 Garment cutting bed dividing method based on trial and error particle swarm hybrid algorithm
CN109118002A (en) * 2018-08-09 2019-01-01 广东工业大学 A kind of board-like product cutting stock and branch mailbox divide frame integrated optimization method
CN109118002B (en) * 2018-08-09 2019-05-28 广东工业大学 A kind of board-like product cutting stock and branch mailbox divide frame integrated optimization method
CN109214657A (en) * 2018-08-13 2019-01-15 浙江工业大学 It is a kind of to combine the polychrome tailoring of least square hybrid algorithm to divide bed process based on heredity
CN109214657B (en) * 2018-08-13 2021-10-15 浙江工业大学 Multicolor garment cutting and bed dividing method based on genetic combination least square hybrid algorithm
CN109685247A (en) * 2018-11-14 2019-04-26 浙江工业大学 Divide bed process based on the tailoring for improving Real Coding Genetic Algorithm

Similar Documents

Publication Publication Date Title
CN106447089A (en) Cutting bed-based cutting sorting method
CN103326353B (en) Environmental economic power generation dispatching calculation method based on improved multi-objective particle swarm optimization algorithm
Mahapatra et al. A novel ameliorated Harris hawk optimizer for solving complex engineering optimization problems
CN104820867A (en) Multi-specification plate-oriented rectangular part layout method
CN107506956A (en) Based on improvement particle cluster algorithm supply chain production and transport coordinated dispatching method and system
CN104376369B (en) A kind of tyre vulcanization workshop energy optimization dispatching method based on genetic algorithm
CN107194608A (en) A kind of mass-rent towards disabled person community marks Task Assigned Policy
CN103729694B (en) The method that improvement GA based on polychromatic sets hierarchical structure solves Flexible workshop scheduling
CN106707991B (en) Bottleneck device recognition methods in multiple target job scheduling based on Fuzzy Level Analytic Approach
CN108608639A (en) 3D printing system based on virtual instrument
CN103714384B (en) Layout method based on Move Mode sequence and the integrated circuit of heredity taboo
CN108053152A (en) The method that improved adaptive GA-IAGA based on polychromatic sets solves dynamic job shop scheduling
CN106295803A (en) The construction method of deep neural network
CN106611219A (en) Genetic algorithm by employing guided local search for multi-objective optimization problem
CN103632196B (en) Negative feedback self-adaptive mechanism kinematic chain isomorphism identification method for ant colony algorithm
CN106293547A (en) A kind of support automatic generation method printed for 3D
CN103678817B (en) Layered design method based on the three-dimensional three-dimensional field programmable gate array met again
Hochbaum An optimal test compression procedure for combinational circuits
CN105447571B (en) A kind of architecture automatic optimization method based on genetic algorithm
CN105808840B (en) A kind of integrated optimization method for taking into account original sheet glass blanking rate and annealing furnace charging ratio
CN106094751A (en) The dispatching method of a kind of raw material and device
WO2020213339A1 (en) Composite material design device, composite material design method, and composite material design program using genetic algorithm
CN116933932A (en) Two-dimensional rectangular plate layout optimization method
CN110119317A (en) A kind of cloud computing method for scheduling task and system based on genetic algorithm
CN106155978A (en) The construction method of reconfigurable system and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170222