基于距离优势关系的多目标进化算法

Qinghua Gu, Qingsong Xu
{"title":"基于距离优势关系的多目标进化算法","authors":"Qinghua Gu, Qingsong Xu","doi":"10.1109/CCDC52312.2021.9602407","DOIUrl":null,"url":null,"abstract":"There are two main aspects of research in multi-objective optimization algorithm, namely, convergence and diversity. While, it is difficult for original algorithms to maintain the diversity of solutions in the high-dimensional objective space. In order to enhance the diversity of algorithms in many-objective optimization problems, a new distance dominance relation is proposed in this paper. First, in order to ensure the convergence of the algorithm, the distance dominance relation calculates the distance from the candidate solution to the ideal point as the fitness value, and selects the candidate solution with good fitness value as the non-dominant solution. Then, in order to enhance the diversity of the algorithm, the distance dominance relation sets each candidate solution to have the same niche and ensures that only one optimal solution is retained in the same territory. Finally, the VaEA algorithm is improved based on the proposed distance dominance relation. On the DTLZ and IDTLZ test of 5–15 dimensional targets, the improved algorithm is compared with six commonly used algorithms. The experimental results show that the improved algorithm is highly competitive and can significantly enhance the diversity of the algorithm.","PeriodicalId":143976,"journal":{"name":"2021 33rd Chinese Control and Decision Conference (CCDC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Many-objective Evolutionary Algorithm Based on Distance Dominance Relation\",\"authors\":\"Qinghua Gu, Qingsong Xu\",\"doi\":\"10.1109/CCDC52312.2021.9602407\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are two main aspects of research in multi-objective optimization algorithm, namely, convergence and diversity. While, it is difficult for original algorithms to maintain the diversity of solutions in the high-dimensional objective space. In order to enhance the diversity of algorithms in many-objective optimization problems, a new distance dominance relation is proposed in this paper. First, in order to ensure the convergence of the algorithm, the distance dominance relation calculates the distance from the candidate solution to the ideal point as the fitness value, and selects the candidate solution with good fitness value as the non-dominant solution. Then, in order to enhance the diversity of the algorithm, the distance dominance relation sets each candidate solution to have the same niche and ensures that only one optimal solution is retained in the same territory. Finally, the VaEA algorithm is improved based on the proposed distance dominance relation. On the DTLZ and IDTLZ test of 5–15 dimensional targets, the improved algorithm is compared with six commonly used algorithms. The experimental results show that the improved algorithm is highly competitive and can significantly enhance the diversity of the algorithm.\",\"PeriodicalId\":143976,\"journal\":{\"name\":\"2021 33rd Chinese Control and Decision Conference (CCDC)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 33rd Chinese Control and Decision Conference (CCDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC52312.2021.9602407\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 33rd Chinese Control and Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC52312.2021.9602407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多目标优化算法的研究主要有两个方面,即收敛性和多样性。而在高维目标空间中,原有算法难以保持解的多样性。为了提高多目标优化问题中算法的多样性,本文提出了一种新的距离优势关系。首先,为了保证算法的收敛性,距离优势关系计算候选解到理想点的距离作为适应度值,并选择适应度值较好的候选解作为非优势解。然后,为了增强算法的多样性,距离优势关系使每个候选解具有相同的生态位,并确保在同一区域内只保留一个最优解。最后,基于提出的距离优势关系对VaEA算法进行了改进。在5-15维目标的DTLZ和IDTLZ测试中,将改进算法与6种常用算法进行了比较。实验结果表明,改进后的算法具有很强的竞争力,可以显著提高算法的多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Many-objective Evolutionary Algorithm Based on Distance Dominance Relation
There are two main aspects of research in multi-objective optimization algorithm, namely, convergence and diversity. While, it is difficult for original algorithms to maintain the diversity of solutions in the high-dimensional objective space. In order to enhance the diversity of algorithms in many-objective optimization problems, a new distance dominance relation is proposed in this paper. First, in order to ensure the convergence of the algorithm, the distance dominance relation calculates the distance from the candidate solution to the ideal point as the fitness value, and selects the candidate solution with good fitness value as the non-dominant solution. Then, in order to enhance the diversity of the algorithm, the distance dominance relation sets each candidate solution to have the same niche and ensures that only one optimal solution is retained in the same territory. Finally, the VaEA algorithm is improved based on the proposed distance dominance relation. On the DTLZ and IDTLZ test of 5–15 dimensional targets, the improved algorithm is compared with six commonly used algorithms. The experimental results show that the improved algorithm is highly competitive and can significantly enhance the diversity of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信