基于分解的多目标进化算法分析-analysis of multi-objective evolutionary algorithm based on decomposition.docxVIP

  • 28
  • 0
  • 约4.7万字
  • 约 48页
  • 2018-05-18 发布于上海
  • 举报

基于分解的多目标进化算法分析-analysis of multi-objective evolutionary algorithm based on decomposition.docx

基于分解的多目标进化算法分析-analysis of multi-objective evolutionary algorithm based on decomposition

AbstractTheoptimizationproblemsinreallifetendtocopewithmultipletargets,forexample,time,cost,quality,quantity,etc.Evolutionaryalgorithmsareaclassofstochasticsearchalgorithm,bysimulatingthenaturalbiologicalevolutionandnaturalselectiontoguideanevolutionaryprocessofindividualsandtoaccumulatethedominantgenes.Evolutionaryalgorithmsareveryrobustandstrongadaptive,whichcanhelpustoavoidmuchlimitationswhensolvingproblemsdirectlyonlywithsomeclassicmathematicapproaches,thusevolutionaryalgorithmscandealwiththecomplexproblemsmoreeffectivelythantraditionaloptimizationmethodsfeeldifficulttosolve.What’smore,bigsuccessesofNSGA-II[1],anexcellentevolutionaryalgorithmbasedontheParetodominancemethod,giveresearchersafalseimpressionthattraditionalmathematicmethodsinoptimizationdomainseemoutofdate.Fortunately,inrecentyears,methodsbasedonscalarfunctionsanddecompositionapproachesbegintochangethissituationandbecomeoneofmostnovelaswellasattractivetrendsoriginatingfromtraditionalmathematictheory,thenaffectsfurthertotheentiremulti-objectiveoptimizationdomain.Asresult,tofindinspirationsamongtraditionalprinciplesandapproacheshasbecomeanewpath.Usually,thesub-objectivesamongonemulti-objectiveoptimizationproblemareconflictivebetweeneachother.Inthemeanwhile,optimizationalgorithmisaimingtofindasetofcompromisedsolutionstotheeachsub-problem,i.e.,thesolutionsnamedParetooptima.Supposedtobegivenanaggregativefunctionandsomeorderswithseveralpreferences,amulti-objectiveproblemcanbeconvertedtoasingle-objectiveoptimizationproblemthatmeansmanysuccessfulsingle-objectiveoptimizationalgorithmscanbeeasilyadoptedtoexploreoptimalsolutions.However,anidealtrade-offrelationforeachsub-objectivecannotbepredetermined,thereforeanapproachcanprovidethebestcandidatesolutionsandchoosepreferencesamongthemisnecessary.Decomposition-basedmulti-objectiveevolutionaryalgorithm(MOEA/D[2])transformsamulti-objectiveoptimizationproblemintoasetofsingle-objectiveandassignssuitableindividualstotheeachsub-problemproblemsviaasetofpre-generatedunif

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档