An adaptive helper and equivalent objective evolution strategy for constrained optimization

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2024-10-10 DOI:10.1016/j.ins.2024.121536
Tao Xu , Hongyang Chen , Jun He
{"title":"An adaptive helper and equivalent objective evolution strategy for constrained optimization","authors":"Tao Xu ,&nbsp;Hongyang Chen ,&nbsp;Jun He","doi":"10.1016/j.ins.2024.121536","DOIUrl":null,"url":null,"abstract":"<div><div>The matrix adaptation evolution strategy is a simplified covariance matrix adaptation evolution strategy with reduced computational cost. Using it as a search engine, several algorithms have been recently proposed for constrained optimization and have shown excellent performance. However, these algorithms require the simultaneous application of multiple techniques to handle constraints, and also require gradient information. This makes them inappropriate for handling non-differentiable functions. This paper proposes a new matrix adaption evolutionary strategy for constrained optimization using helper and equivalent objectives. The method optimizes two objectives but with no need for special handling of infeasible solutions and without gradient information. A new mechanism is designed to adaptively adjust the weights of the two objectives according to the convergence rate. The efficacy of the proposed algorithm is evaluated using computational experiments on the IEEE CEC 2017 Constrained Optimization Competition benchmarks. Experimental results demonstrate that it outperforms current state-of-the-art evolutionary algorithms. Furthermore, this paper provides sufficient conditions for the convergence of helper and equivalent objective evolutionary algorithms and proves that using helper objectives can reduce the likelihood of premature convergence.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121536"},"PeriodicalIF":8.1000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524014506","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The matrix adaptation evolution strategy is a simplified covariance matrix adaptation evolution strategy with reduced computational cost. Using it as a search engine, several algorithms have been recently proposed for constrained optimization and have shown excellent performance. However, these algorithms require the simultaneous application of multiple techniques to handle constraints, and also require gradient information. This makes them inappropriate for handling non-differentiable functions. This paper proposes a new matrix adaption evolutionary strategy for constrained optimization using helper and equivalent objectives. The method optimizes two objectives but with no need for special handling of infeasible solutions and without gradient information. A new mechanism is designed to adaptively adjust the weights of the two objectives according to the convergence rate. The efficacy of the proposed algorithm is evaluated using computational experiments on the IEEE CEC 2017 Constrained Optimization Competition benchmarks. Experimental results demonstrate that it outperforms current state-of-the-art evolutionary algorithms. Furthermore, this paper provides sufficient conditions for the convergence of helper and equivalent objective evolutionary algorithms and proves that using helper objectives can reduce the likelihood of premature convergence.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
约束优化的自适应辅助和等效目标演化策略
矩阵适应演化策略是一种简化的协方差矩阵适应演化策略,计算成本较低。利用它作为搜索引擎,最近提出了几种用于约束优化的算法,并显示出卓越的性能。然而,这些算法需要同时应用多种技术来处理约束条件,还需要梯度信息。这使得它们不适合处理无差异函数。本文提出了一种新的矩阵自适应进化策略,用于使用辅助目标和等效目标的约束优化。该方法可优化两个目标,但无需特殊处理不可行解,也不需要梯度信息。该方法设计了一种新机制,可根据收敛速度自适应地调整两个目标的权重。通过在 IEEE CEC 2017 受限优化竞赛基准上进行计算实验,评估了所提算法的功效。实验结果表明,该算法优于目前最先进的进化算法。此外,本文还提供了辅助目标和等效目标进化算法收敛的充分条件,并证明使用辅助目标可以降低过早收敛的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board Community structure testing by counting frequent common neighbor sets Finite-time secure synchronization for stochastic complex networks with delayed coupling under deception attacks: A two-step switching control scheme Adaptive granular data compression and interval granulation for efficient classification Introducing fairness in network visualization
×
引用
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