约束优化问题的自适应差分进化算法

Cuo Wanma, Hecheng Li, Erping Song
{"title":"约束优化问题的自适应差分进化算法","authors":"Cuo Wanma, Hecheng Li, Erping Song","doi":"10.1109/CIS52066.2020.00063","DOIUrl":null,"url":null,"abstract":"Constndned optimization problems are widely used in real-world applications as optimization models. Due to the complexity of the objective itself as well as too tight constraints, it is difficult to obtain the global optimal solution to these problems. In this manuscript, an improved differential evolutionary algorithm is proposed from the perspective of operator design and constraint handling. Firstly, in order to enhance the exploration ability of the algorithm, a heuristic mutation operator with better point information is constructed. Secondly, an improved dynamic epsilon constraint handling method is developed, in which the value of the epsilon decreases as the iteration number increases. The method can increase effectively the feasible individual in populations. Finally, the simulation results on 10 benchmark functions show that the proposed algorithm is effective and robust when compared with similar algorithms.","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\":\"A Differential Evolution Algorithm with Adaptive Strategies for Constrained Optimization Problem\",\"authors\":\"Cuo Wanma, Hecheng Li, Erping Song\",\"doi\":\"10.1109/CIS52066.2020.00063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constndned optimization problems are widely used in real-world applications as optimization models. Due to the complexity of the objective itself as well as too tight constraints, it is difficult to obtain the global optimal solution to these problems. In this manuscript, an improved differential evolutionary algorithm is proposed from the perspective of operator design and constraint handling. Firstly, in order to enhance the exploration ability of the algorithm, a heuristic mutation operator with better point information is constructed. Secondly, an improved dynamic epsilon constraint handling method is developed, in which the value of the epsilon decreases as the iteration number increases. The method can increase effectively the feasible individual in populations. Finally, the simulation results on 10 benchmark functions show that the proposed algorithm is effective and robust when compared with similar algorithms.\",\"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.00063\",\"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.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

约束优化问题作为优化模型广泛应用于实际应用中。由于目标本身的复杂性和过于严格的约束条件,这些问题很难得到全局最优解。本文从算子设计和约束处理的角度提出了一种改进的差分进化算法。首先,为了增强算法的搜索能力,构造了具有更好点信息的启发式变异算子;其次,提出了一种改进的动态epsilon约束处理方法,该方法使epsilon的值随着迭代次数的增加而减小;该方法可以有效地增加种群中的可行个体。最后,对10个基准函数的仿真结果表明,与同类算法相比,该算法具有较好的鲁棒性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Differential Evolution Algorithm with Adaptive Strategies for Constrained Optimization Problem
Constndned optimization problems are widely used in real-world applications as optimization models. Due to the complexity of the objective itself as well as too tight constraints, it is difficult to obtain the global optimal solution to these problems. In this manuscript, an improved differential evolutionary algorithm is proposed from the perspective of operator design and constraint handling. Firstly, in order to enhance the exploration ability of the algorithm, a heuristic mutation operator with better point information is constructed. Secondly, an improved dynamic epsilon constraint handling method is developed, in which the value of the epsilon decreases as the iteration number increases. The method can increase effectively the feasible individual in populations. Finally, the simulation results on 10 benchmark functions show that the proposed algorithm is effective and robust when compared with similar algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Predicting Algorithms and Complexity in RNA Structure Based on BHG Efficient attribute reduction based on rough sets and differential evolution algorithm Numerical Analysis of Influence of Medicine Cover Structure on Cutting Depth [Copyright notice] Linear Elements Separation via Vision System Feature and Seed Spreading from Topographic Maps
×
引用
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