求解多目标优化问题的一种新的进化算法

Yang Song, Junzhong Ji, Yamin Wang, Chunnian Liu
{"title":"求解多目标优化问题的一种新的进化算法","authors":"Yang Song, Junzhong Ji, Yamin Wang, Chunnian Liu","doi":"10.1109/ICNC.2009.199","DOIUrl":null,"url":null,"abstract":"Evolutionary Algorithm (EA) is a population-based metaheuristic technique to effectively solve Multiobjective Optimization Problem (MOP). However, it is still an active research topic how to improve the performance of MOEA algorithms. In this paper, we present a new FOPF algorithm,which can alleviate MOEA’s disadvantage on time performance. First, a fast obtaining Pareto front approach with less computation cost is proposed, then an expand approach and a limited crossover procedure are employed to keep the diversity of solutions. Experimental results on four test problems show that the FOPF algorithm is able to find solutions with good diversity, which are near the true Parato-optimal front, and improves significantly time performance compared to the known NSGA2.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Evolutionary Algorithm for Solving Multiobjective Optimization\",\"authors\":\"Yang Song, Junzhong Ji, Yamin Wang, Chunnian Liu\",\"doi\":\"10.1109/ICNC.2009.199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolutionary Algorithm (EA) is a population-based metaheuristic technique to effectively solve Multiobjective Optimization Problem (MOP). However, it is still an active research topic how to improve the performance of MOEA algorithms. In this paper, we present a new FOPF algorithm,which can alleviate MOEA’s disadvantage on time performance. First, a fast obtaining Pareto front approach with less computation cost is proposed, then an expand approach and a limited crossover procedure are employed to keep the diversity of solutions. Experimental results on four test problems show that the FOPF algorithm is able to find solutions with good diversity, which are near the true Parato-optimal front, and improves significantly time performance compared to the known NSGA2.\",\"PeriodicalId\":235382,\"journal\":{\"name\":\"2009 Fifth International Conference on Natural Computation\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2009.199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2009.199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

进化算法是一种基于种群的元启发式算法,用于有效解决多目标优化问题。然而,如何提高MOEA算法的性能仍然是一个活跃的研究课题。在本文中,我们提出了一种新的FOPF算法,可以改善MOEA在时间性能上的缺点。首先,提出了一种计算量较小的快速获取Pareto前沿方法,然后采用扩展方法和有限交叉方法来保持解的多样性。在4个测试问题上的实验结果表明,FOPF算法能够找到具有较好分集的解,且解接近真拟合最优前沿,与已知的NSGA2算法相比,时间性能有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Evolutionary Algorithm for Solving Multiobjective Optimization
Evolutionary Algorithm (EA) is a population-based metaheuristic technique to effectively solve Multiobjective Optimization Problem (MOP). However, it is still an active research topic how to improve the performance of MOEA algorithms. In this paper, we present a new FOPF algorithm,which can alleviate MOEA’s disadvantage on time performance. First, a fast obtaining Pareto front approach with less computation cost is proposed, then an expand approach and a limited crossover procedure are employed to keep the diversity of solutions. Experimental results on four test problems show that the FOPF algorithm is able to find solutions with good diversity, which are near the true Parato-optimal front, and improves significantly time performance compared to the known NSGA2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信