資源描述:
《約束優(yōu)化進(jìn)化算法》由會(huì)員上傳分享,免費(fèi)在線(xiàn)閱讀,更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)。
1、ISSN1000-9825,CODENRUXUEWE-mail:jos@iscas.ac.cnJournalofSoftware,Vol.20,No.1,January2009,pp.11?29http://www.jos.org.cndoi:10.3724/SP.J.1001.2009.03363Tel/Fax:+86-10-62562563?byInstituteofSoftware,theChineseAcademyofSciences.Allrightsreserved.?約束優(yōu)化進(jìn)化算法1+121,3王勇,蔡自興,周育人,肖赤心1(中
2、南大學(xué)信息科學(xué)與工程學(xué)院,湖南長(zhǎng)沙410083)2(華南理工大學(xué)計(jì)算機(jī)科學(xué)與工程學(xué)院,廣東廣州516040)3(湘潭大學(xué)信息工程學(xué)院,湖南湘潭411105)ConstrainedOptimizationEvolutionaryAlgorithms1+121,3WANGYong,CAIZi-Xing,ZHOUYu-Ren,XIAOChi-Xin1(SchoolofInformationScienceandEngineering,CentralSouthUniversity,Changsha410083,China)2(SchoolofComput
3、erScienceandEngineering,SouthChinaUniversityofTechnology,Guangzhou516040,China)3(SchoolofInformationEngineering,XiangtanUniversity,Xiangtan411105,China)+Correspondingauthor:E-mail:ywang@csu.edu.cnWangY,CaiZX,ZhouYR,XiaoCX.Constrainedoptimizationevolutionaryalgorithms.Journal
4、ofSoftware,2009,20(1):11?29.http://www.jos.org.cn/1000-9825/3363.htmAbstract:Constrainedoptimizationproblems(COPs)aremathematicalprogrammingproblemsfrequentlyencounteredinthedisciplinesofscienceandengineeringapplication.SolvingCOPshasbecomeanimportantresearchareaofevolutiona
5、rycomputationinrecentyears.Inthispaper,thestate-of-the-artofconstrainedoptimizationevolutionaryalgorithms(COEAs)issurveyedfromtwobasicaspectsofCOEAs(i.e.,constraint-handlingtechniquesandevolutionaryalgorithms).Inaddition,thispaperdiscussessomeimportantissuesofCOEAs.Morespeci
6、fically,severaltypicalalgorithmsareanalyzedindetail.Basedontheanalyses,itconcludedthattoobtaincompetitiveresults,aproperconstraint-handlingtechniqueneedstobeconsideredinconjunctionwithanappropriatesearchalgorithm.Finally,theopenresearchissuesinthisfieldarealsopointedout.Keyw
7、ords:evolutionaryalgorithm;constraint-handlingtechnique;constrainedoptimization;multi-objectiveoptimization;constrainedoptimizationevolutionaryalgorithms摘要:約束優(yōu)化問(wèn)題是科學(xué)和工程應(yīng)用領(lǐng)域經(jīng)常會(huì)遇到的一類(lèi)數(shù)學(xué)規(guī)劃問(wèn)題.近年來(lái),約束優(yōu)化問(wèn)題求解已成為進(jìn)化計(jì)算研究的一個(gè)重要方向.從約束優(yōu)化進(jìn)化算法=約束處理技術(shù)+進(jìn)化算法的研究框架出發(fā),從約束處理技術(shù)和進(jìn)化算法兩個(gè)基本方面對(duì)約束優(yōu)化進(jìn)化算法的研究
8、及進(jìn)展進(jìn)行了綜述.此外,對(duì)約束優(yōu)化進(jìn)化算法中的一些重要問(wèn)題進(jìn)行了探討.最后進(jìn)行了各種算法的比較性總結(jié),深入分析了目前約束優(yōu)化進(jìn)化算法中亟待解決的問(wèn)題,