基于ISDE +和区域分解的多目标进化优化算法

Zixian Lin, Hai-Lin Liu, Fangqing Gu
{"title":"基于ISDE +和区域分解的多目标进化优化算法","authors":"Zixian Lin, Hai-Lin Liu, Fangqing Gu","doi":"10.1109/CIS2018.2018.00015","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an evolutionary multi-and many-objective optimization algorithm combining I_SDE + and region decomposition. It decomposes the objective space into a number of sub-regions by a set of direction vectors and independently calculates the indicator I_SDE + by using the corresponding direction vector in each subregion. Thus, the convergence direction of each sub-region is relatively adjusted. In this way, the proposed algorithm can adapt to various of Pareto Front shapes. The inferior individuals are eliminated according to the value of I_SDE + of each individual one by one. In the experiments, we compare the proposed algorithm with four evolutionary multi-and many-objective optimization algorithms on WFG series with different number of objectives. The result shows that the proposed algorithm promotes diversity and convergence.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Evolutionary Multi- and Many-Objective Optimization Algorithm Based on ISDE + and Region Decomposition\",\"authors\":\"Zixian Lin, Hai-Lin Liu, Fangqing Gu\",\"doi\":\"10.1109/CIS2018.2018.00015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an evolutionary multi-and many-objective optimization algorithm combining I_SDE + and region decomposition. It decomposes the objective space into a number of sub-regions by a set of direction vectors and independently calculates the indicator I_SDE + by using the corresponding direction vector in each subregion. Thus, the convergence direction of each sub-region is relatively adjusted. In this way, the proposed algorithm can adapt to various of Pareto Front shapes. The inferior individuals are eliminated according to the value of I_SDE + of each individual one by one. In the experiments, we compare the proposed algorithm with four evolutionary multi-and many-objective optimization algorithms on WFG series with different number of objectives. The result shows that the proposed algorithm promotes diversity and convergence.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种结合I_SDE +和区域分解的进化多目标优化算法。它通过一组方向向量将目标空间分解为多个子区域,并在每个子区域中使用相应的方向向量独立计算指标I_SDE +。因此,各子区域的收敛方向相对调整。这样,该算法可以适应多种Pareto Front形状。根据每个个体的I_SDE +值逐个淘汰劣势个体。在实验中,我们将该算法与四种不同目标数的WFG序列多目标和多目标进化优化算法进行了比较。结果表明,该算法具有较好的多样性和收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Evolutionary Multi- and Many-Objective Optimization Algorithm Based on ISDE + and Region Decomposition
In this paper, we propose an evolutionary multi-and many-objective optimization algorithm combining I_SDE + and region decomposition. It decomposes the objective space into a number of sub-regions by a set of direction vectors and independently calculates the indicator I_SDE + by using the corresponding direction vector in each subregion. Thus, the convergence direction of each sub-region is relatively adjusted. In this way, the proposed algorithm can adapt to various of Pareto Front shapes. The inferior individuals are eliminated according to the value of I_SDE + of each individual one by one. In the experiments, we compare the proposed algorithm with four evolutionary multi-and many-objective optimization algorithms on WFG series with different number of objectives. The result shows that the proposed algorithm promotes diversity and convergence.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Real-Time Location Privacy Protection Method Based on Space Transformation Cryptanalysis of Kumar's Remote User Authentication Scheme with Smart Card Off-Topic Text Detection Based on Neural Networks Combined with Text Features Research of X Ray Image Recognition Based on Neural Network CFO Algorithm Using Niche and Opposition-Based Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1