约束多目标优化问题的改进差分进化

Erping Song, Hecheng Li, Cuo Wanma
{"title":"约束多目标优化问题的改进差分进化","authors":"Erping Song, Hecheng Li, Cuo Wanma","doi":"10.1109/CIS52066.2020.00064","DOIUrl":null,"url":null,"abstract":"The constrained multi-objective optimization problems (CMOPs) is widely used in real-world applications and always hard to handle especially when the objective number becomes more or the constraints are too stringent. In this manuscript, an improved differential evolution method (IDEM) is proposed based on CMOEA/D as well as newly designed mutation operators. Firstly, one mutation operator is presented to improve infeasible points, in which any infeasible point is taken to divide other points into three groups by using the constraint violation information, and based on the division, a potential better point can be found and utilized to improve other infeasible points by the mutation operation. Then the other mutation operator is provided by designing an objective sorting scheme as well as an individual selection method. These two mutation operators are alternately and self- adaptively adopted in evolution process. Finally, the proposed algorithm is executed on some recent benchmark functions and compared with four state-of-the-art EMO algorithms. The experimental results show that IDEM can efficiently solve the CMOPs.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Differential Evolution for Constrained Multi-Objective Optimization Problems\",\"authors\":\"Erping Song, Hecheng Li, Cuo Wanma\",\"doi\":\"10.1109/CIS52066.2020.00064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The constrained multi-objective optimization problems (CMOPs) is widely used in real-world applications and always hard to handle especially when the objective number becomes more or the constraints are too stringent. In this manuscript, an improved differential evolution method (IDEM) is proposed based on CMOEA/D as well as newly designed mutation operators. Firstly, one mutation operator is presented to improve infeasible points, in which any infeasible point is taken to divide other points into three groups by using the constraint violation information, and based on the division, a potential better point can be found and utilized to improve other infeasible points by the mutation operation. Then the other mutation operator is provided by designing an objective sorting scheme as well as an individual selection method. These two mutation operators are alternately and self- adaptively adopted in evolution process. Finally, the proposed algorithm is executed on some recent benchmark functions and compared with four state-of-the-art EMO algorithms. The experimental results show that IDEM can efficiently solve the CMOPs.\",\"PeriodicalId\":106959,\"journal\":{\"name\":\"2020 16th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 16th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS52066.2020.00064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS52066.2020.00064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

约束多目标优化问题在实际应用中有着广泛的应用,但在目标数量较多或约束条件过于严格的情况下往往难以处理。本文提出了一种基于CMOEA/D和新设计的突变算子的改进差分进化方法(IDEM)。首先,提出一种改进不可行点的变异算子,其中任意一个不可行点利用约束违反信息将其他不可行点分成三组,在此基础上找到一个可能更好的点,并通过变异操作对其他不可行点进行改进。然后通过设计一种客观排序方案和个体选择方法来提供另一个突变算子。这两种变异算子在进化过程中是交替自适应的。最后,在一些最新的基准函数上执行了该算法,并与四种最先进的EMO算法进行了比较。实验结果表明,IDEM可以有效地求解cmp问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Differential Evolution for Constrained Multi-Objective Optimization Problems
The constrained multi-objective optimization problems (CMOPs) is widely used in real-world applications and always hard to handle especially when the objective number becomes more or the constraints are too stringent. In this manuscript, an improved differential evolution method (IDEM) is proposed based on CMOEA/D as well as newly designed mutation operators. Firstly, one mutation operator is presented to improve infeasible points, in which any infeasible point is taken to divide other points into three groups by using the constraint violation information, and based on the division, a potential better point can be found and utilized to improve other infeasible points by the mutation operation. Then the other mutation operator is provided by designing an objective sorting scheme as well as an individual selection method. These two mutation operators are alternately and self- adaptively adopted in evolution process. Finally, the proposed algorithm is executed on some recent benchmark functions and compared with four state-of-the-art EMO algorithms. The experimental results show that IDEM can efficiently solve the CMOPs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信