A Fast Two-objective Differential Evolutionary Algorithm based on Pareto-optimal Set

IF 2.4 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xu Yulong, Zhao Ling-dong
{"title":"A Fast Two-objective Differential Evolutionary Algorithm based on Pareto-optimal Set","authors":"Xu Yulong, Zhao Ling-dong","doi":"10.4018/IJSSCI.2016010104","DOIUrl":null,"url":null,"abstract":"The two-objective differential evolution with Pareto-optimal set, which is researched in this paper. Firstly, it is found that there are some redundant computations in the classic multi-objective evolutionary algorithm, such as the NSGA-II. Then, based on the concept of Pareto-optimal set, the non-dominated solution sorted and its potential features, the authors propose a ranking method for solution that only handles the highest rank individuals in current population. The highlight of the proposed method is that during the ranking process, the individuals can be chosen into the next generation meanwhile. When the individuals of next generation population are obtained the algorithm is broken out. Both the number of individuals for sorting process and the time complexity are reduced. Furthermore, a method of uniform crowding distance calculation is provided in this work. Finally, the authors incorporate the introduced ranking method and uniform crowding distance method into differential evolution, a fast two-objective differential evolution algorithm is obtained. For verifying the proposed method, they use the classical optimal problems ZDTl~ZDT4 and ZDT6 for tesing. Simulation results show that the authors' method has greatly improved in terms of time complexity and performance than other algorithms.","PeriodicalId":29913,"journal":{"name":"International Journal of Software Science and Computational Intelligence-IJSSCI","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Software Science and Computational Intelligence-IJSSCI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJSSCI.2016010104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The two-objective differential evolution with Pareto-optimal set, which is researched in this paper. Firstly, it is found that there are some redundant computations in the classic multi-objective evolutionary algorithm, such as the NSGA-II. Then, based on the concept of Pareto-optimal set, the non-dominated solution sorted and its potential features, the authors propose a ranking method for solution that only handles the highest rank individuals in current population. The highlight of the proposed method is that during the ranking process, the individuals can be chosen into the next generation meanwhile. When the individuals of next generation population are obtained the algorithm is broken out. Both the number of individuals for sorting process and the time complexity are reduced. Furthermore, a method of uniform crowding distance calculation is provided in this work. Finally, the authors incorporate the introduced ranking method and uniform crowding distance method into differential evolution, a fast two-objective differential evolution algorithm is obtained. For verifying the proposed method, they use the classical optimal problems ZDTl~ZDT4 and ZDT6 for tesing. Simulation results show that the authors' method has greatly improved in terms of time complexity and performance than other algorithms.
基于pareto最优集的快速双目标差分进化算法
本文研究了具有pareto最优集的双目标微分演化问题。首先,发现NSGA-II等经典多目标进化算法存在冗余计算;然后,基于pareto最优集的概念、非支配解排序及其潜在特征,提出了一种只处理当前种群中排名最高的个体的解排序方法。该方法的亮点在于,在排序过程中,个体可以同时被选入下一代。当获得下一代种群的个体时,将算法分解。排序过程的个体数量和时间复杂度都降低了。此外,本文还提出了一种均匀拥挤距离的计算方法。最后,将引入的排序法和均匀拥挤距离法引入到差分进化中,得到了一种快速的双目标差分进化算法。为了验证所提出的方法,他们使用经典的最优问题ZDTl~ZDT4和ZDT6进行测试。仿真结果表明,该方法在时间复杂度和性能上都比其他算法有了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
27.60%
发文量
34
×
引用
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学术官方微信