{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
