Improved Reference Vector Guided Differential Evolution Algorithm for Many-Objective Optimization

Jie Lin, S. Zheng, Y. Long
{"title":"Improved Reference Vector Guided Differential Evolution Algorithm for Many-Objective Optimization","authors":"Jie Lin, S. Zheng, Y. Long","doi":"10.1145/3395260.3395268","DOIUrl":null,"url":null,"abstract":"Most of the existing evolutionary algorithms to deal with many-objective problems are based on the enhancing of selection strategy. Among them, the reference vector-guided evolutionary algorithm (RVEA) achieves excellent performance. In this paper, a new search engine is combined with RVEA to achieve further performance enhancement of the differential evolutionary (DE) algorithm. In the optimization process of differential evolution algorithm on many-objective problems, improving convergence and maintaining diversity are two different optimization directions, and it is usually difficult to maintain a balance between them. To solve this problem, a new search engine based on DE is proposed. The proposed search engine is implemented based on a cooperative scheme of local and global search strategies. In the local search, the population is divided into several sub-populations, each of which evolves independently using the proposed mutation strategy. The distance between the individuals in each sub-population is relatively close. Therefore, it has a strong exploitation capability, and will not make the population lose diversity. Meanwhile, the selection strategy of RVEA enables the population to maintain diversity, and the DE/rand/1 utilized in global search is sufficient to keep a strong exploration capability. Therefore, the proposed approach can achieve a good balance between exploration and exploitation. The experimental results show that the proposed algorithm performs well in many-objective optimizations up to more than 10 objectives.","PeriodicalId":103490,"journal":{"name":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3395260.3395268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Most of the existing evolutionary algorithms to deal with many-objective problems are based on the enhancing of selection strategy. Among them, the reference vector-guided evolutionary algorithm (RVEA) achieves excellent performance. In this paper, a new search engine is combined with RVEA to achieve further performance enhancement of the differential evolutionary (DE) algorithm. In the optimization process of differential evolution algorithm on many-objective problems, improving convergence and maintaining diversity are two different optimization directions, and it is usually difficult to maintain a balance between them. To solve this problem, a new search engine based on DE is proposed. The proposed search engine is implemented based on a cooperative scheme of local and global search strategies. In the local search, the population is divided into several sub-populations, each of which evolves independently using the proposed mutation strategy. The distance between the individuals in each sub-population is relatively close. Therefore, it has a strong exploitation capability, and will not make the population lose diversity. Meanwhile, the selection strategy of RVEA enables the population to maintain diversity, and the DE/rand/1 utilized in global search is sufficient to keep a strong exploration capability. Therefore, the proposed approach can achieve a good balance between exploration and exploitation. The experimental results show that the proposed algorithm performs well in many-objective optimizations up to more than 10 objectives.
多目标优化的改进参考向量引导差分进化算法
现有的处理多目标问题的进化算法大多是基于选择策略的增强。其中,参考向量引导进化算法(RVEA)取得了优异的性能。本文将一种新的搜索引擎与RVEA相结合,进一步提高了差分进化算法的性能。在多目标问题的差分进化算法优化过程中,提高收敛性和保持多样性是两个不同的优化方向,通常很难在两者之间保持平衡。为了解决这一问题,提出了一种新的基于DE的搜索引擎。所提出的搜索引擎是基于局部和全局搜索策略的协作方案实现的。在局部搜索中,将种群划分为几个亚种群,每个亚种群使用所提出的突变策略独立进化。各亚种群的个体间距离较近。因此,它具有很强的开发能力,不会使种群丧失多样性。同时,RVEA的选择策略使种群保持多样性,在全局搜索中使用的DE/rand/1足以保持较强的探索能力。因此,该方法可以很好地实现勘探与开发的平衡。实验结果表明,该算法在10个目标以上的多目标优化中表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信