An Enhanced Multi-Phase Stochastic Differential Evolution Framework for Numerical Optimization

Heba Abdelnabi, Mostafa Z. Ali, M. Daoud, R. Alazrai, A. Awajan, Robert Reynolds, P. N. Suganthan
{"title":"An Enhanced Multi-Phase Stochastic Differential Evolution Framework for Numerical Optimization","authors":"Heba Abdelnabi, Mostafa Z. Ali, M. Daoud, R. Alazrai, A. Awajan, Robert Reynolds, P. N. Suganthan","doi":"10.1109/CEC55065.2022.9870438","DOIUrl":null,"url":null,"abstract":"Real-life problems can be expressed as optimization problems. These problems pose a challenge for researchers to design efficient algorithms that are capable of finding optimal solutions with the least budget. Stochastic Fractal Search (SFS) proved its powerfulness as a metaheuristic algorithm through the large research body that used it to optimize different industrial and engineering tasks. Nevertheless, as with any meta-heuristic algorithm and according to the “No Free Lunch” theorem, SFS may suffer from immature convergence and local minima trap. Thus, to address these issues, a popular Differential Evolution variant called Success-History based Adaptive Differential Evolution (SHADE) is used to enhance SFS performance in a unique three-phase hybrid framework. Moreover, a local search is also incorporated into the proposed framework to refine the quality of the generated solution and accelerate the hybrid algorithm convergence speed. The proposed hybrid algorithm, namely eMpSDE, is tested against a diverse set of varying complexity optimization problems, consisting of well-known standard unconstrained unimodal and multimodal test functions and some constrained engineering design problems. Then, a comparative analysis of the performance of the proposed hybrid algorithm is carried out with the recent state of art algorithms to validate its competitivity.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Real-life problems can be expressed as optimization problems. These problems pose a challenge for researchers to design efficient algorithms that are capable of finding optimal solutions with the least budget. Stochastic Fractal Search (SFS) proved its powerfulness as a metaheuristic algorithm through the large research body that used it to optimize different industrial and engineering tasks. Nevertheless, as with any meta-heuristic algorithm and according to the “No Free Lunch” theorem, SFS may suffer from immature convergence and local minima trap. Thus, to address these issues, a popular Differential Evolution variant called Success-History based Adaptive Differential Evolution (SHADE) is used to enhance SFS performance in a unique three-phase hybrid framework. Moreover, a local search is also incorporated into the proposed framework to refine the quality of the generated solution and accelerate the hybrid algorithm convergence speed. The proposed hybrid algorithm, namely eMpSDE, is tested against a diverse set of varying complexity optimization problems, consisting of well-known standard unconstrained unimodal and multimodal test functions and some constrained engineering design problems. Then, a comparative analysis of the performance of the proposed hybrid algorithm is carried out with the recent state of art algorithms to validate its competitivity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种改进的多阶段随机微分演化框架用于数值优化
现实生活中的问题可以表示为优化问题。这些问题对研究人员提出了一个挑战,即设计出能够以最小的预算找到最优解的高效算法。随机分形搜索(SFS)作为一种元启发式算法,通过大型研究机构使用它来优化不同的工业和工程任务,证明了它的强大功能。然而,与任何元启发式算法一样,根据“天下没有免费的午餐”定理,SFS可能存在不成熟收敛和局部最小陷阱。因此,为了解决这些问题,一种流行的差分进化变体称为基于成功历史的自适应差分进化(SHADE),用于在独特的三相混合框架中增强SFS性能。此外,该框架还引入了局部搜索,以提高生成解的质量,加快混合算法的收敛速度。提出的混合算法,即eMpSDE,针对多种不同复杂性的优化问题进行了测试,包括众所周知的标准无约束单峰和多峰测试函数以及一些有约束的工程设计问题。然后,将所提出的混合算法的性能与当前最先进的算法进行了比较分析,以验证其竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impacts of Single-objective Landscapes on Multi-objective Optimization Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling Global and Local Area Coverage Path Planner for a Reconfigurable Robot A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem Test Case Prioritization and Reduction Using Hybrid Quantum-behaved Particle Swarm Optimization
×
引用
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