進(jìn)化算法在排樣問題上的應(yīng)用.pdf

1、華中科技大學(xué)碩士學(xué)位論文進(jìn)化算法在排樣問題上的應(yīng)用姓名：凌少東申請學(xué)位級別：碩士專業(yè)：應(yīng)用數(shù)學(xué)指導(dǎo)教師：曹炬20061027華中科技大學(xué)碩士學(xué)位論文IIAbstractLayoutproblemisakindofclassicalcombinatialoptimizationproblem.Ithasawiderangeofapplicationinawidefield.Layoutproblemmeansputtingsomeobje

2、ctsonaspecifiedspace(plane)withinreasonsatisfyingsomenecessaryrestrictionsreachingsomeoptimalaim.Theresultoflayouthasanimptantimpactonrationalityeconomizationsecurityofproduction.FcirclepackingonaRollofMaterialthispaperp

3、utsfwardanewmethod:obliquearrangementbasedoninterlacedarrangementwhichimprovesutilizationpercentofmaterial.Becauserecentlyevolutionaryalgithmhasgotamarkedachievementonengineeringmanufacturingautomationbusinessfinancethis

4、paperadoptsevolutionarystrategyonekindofevolutionarytotrytosettletwokindofonedimensionallayoutproblem.Theyaresinglestocklengthcuttingstockproblem(CSP)CSPthatitemscanbewelded.FsinglestocklengthCSPweproposeacompoundESwhich

5、takesitemlistaschromosomejustreliesonindividualmutationelitistelectiontorealizecolonyevolution.InadditionafteraprocessofevolutionweaddasearchoperattoenhancelocalsearchcapabilityofES.InthesecondproblemESiscombinedwithalin

6、earaggregationmethod.Itsfitnessfunctionsyntheticallyconsidersmaximizingtheusagerateofmaterialminimizingthetimeofsolderingtheitemssatisfyingpractice.Ourwkcanbeusedfreferencefotherlayoutproblems.Keywds:CuttingstockproblemC