求解众目标优化问题的演化算法研究

求解众目标优化问题的演化算法研究

ID:32137559

大小:2.50 MB

页数:68页

时间:2019-01-31

求解众目标优化问题的演化算法研究_第1页
求解众目标优化问题的演化算法研究_第2页
求解众目标优化问题的演化算法研究_第3页
求解众目标优化问题的演化算法研究_第4页
求解众目标优化问题的演化算法研究_第5页
资源描述:

《求解众目标优化问题的演化算法研究》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、万方数据ABSTRACTEvolutionaryalgorithmisaheuristicmethodwithgroupsearchstrategy,andisap—pliedinscienceandindustrysuccessfully.Inrecentyears,moreandmoreresearchersfocusedtheirattentiononmany-objectiveoptimizationproblems,andmoreandmorealgorithmsbasedonevolutionaryalgorithmshavebeenproposedtOsolveth

2、oseprob-lems.Wehaveproposedtwoalgorithmstodealwithmanyobjectiveproblemswithnoconstraintsandwithconstraintsrespectivelyinthispaper.1.Many—objectiveoptimizationproblemshavemanyobjectiveswhomaybecon·flictwitheachother,SOoptimizingallobjectivessimultaneouslyfacesmanydif-ficulties,forexample,wecan

3、’tcomparesolutions.Weproposedanewmany—objectiveevolutionaryalgorithm(MOEA)whosenameisParetopartialdomi-nanceontwoselectedobjectiVesmany—objectiveevolutionaryalgorithm(PPDSO-MOEA).InPPDSO-MOEA,weproposeamethodofchoosingobjectives,andonlycalculatethedominancerelationshipbetweensolutionsonthetwo

4、selectedobjectivesandthenreflectthisworkonthechoosingofparentpopulation.Thetwoobjectivesusedincalculatingdominancerelationshipbetweensolutionsarechosenthroughcalculatingtheaverageobjectivedistancetothebestpoint局历优andweselectthetwoobjectiveswiththebiggestaveragedistances.Rp。in£storesthebestval

5、ueandisupdatedwhennewsolutionscome.Weswitchthetwoob—jectivesineverysomeevaluationstooptimizeallobjectivesandkeepanarchivepopulationtostoretheParetooptimalsolutions.WeverifieditsperformanceonDTLZ2andDTLZ4.MOEA/D,SPEA2+SDE,MyODEMR,PPD—MOEA,andanalgorithmselectingobjectiveswithrandommethodaresel

6、ectedasrivalalgo—rithms.Theexperimentresultsshowthatouralgorithm,PPDSO—MOEA,outper-formsotheralgorithmsonmanycases.2.ManyproblemsintherealworldhaveconstraintsbutPPDSO-MOEAisdevel。opedtosolvethemany—objectiveproblemswithnoconstraints.So,weimprovetheabovealgorithmtogetanewalgorithm,namedPPDS02一

7、MOEA,whoisusedtoproblemswithconstraints.Therearemanydifferencesbetweenthosetwoalgo—rithms.Here,welistthedifferencesinPPDS02一MOEA.PPDS02-MOEAusesthegreedyrepairmethodtorepairinfeasiblesolutions.Solutionsinthearchivepopulationarefeasiblesolutio

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。