DXMODE: A dynamic explorative multi-operator differential evolution algorithm for engineering optimization problems

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Mohamed Reda , Ahmed Onsy , Amira Y. Haikal , Ali Ghanbari
{"title":"DXMODE: A dynamic explorative multi-operator differential evolution algorithm for engineering optimization problems","authors":"Mohamed Reda ,&nbsp;Ahmed Onsy ,&nbsp;Amira Y. Haikal ,&nbsp;Ali Ghanbari","doi":"10.1016/j.ins.2025.122271","DOIUrl":null,"url":null,"abstract":"<div><div>Traditional methods often struggle with complex, real-world problems, while Differential Evolution (DE) offers more robust and adaptable solutions. However, many DE variants intertwine exploration and exploitation within mutation operators and rely on static or blind population reduction, leading to premature diversity loss. This paper proposes Dynamic Explorative Multi-Operator Differential Evolution (DXMODE), a novel DE variant featuring Error-based Linear Population Decay (ELPD) for adaptive sizing, considering both the error improvement and the iteration count. A decoupled exploration phase is also introduced with two new operators, Aggressive Gaussian Exploration (AGE) and Multiple Nested Chaotic Exploration (MNCE), enhancing diversity and search efficiency. DXMODE is validated on CEC2020/2021 and CEC2022 benchmarks against 30 state-of-the-art algorithms, including advanced DE variants and CEC winners. Statistical analyses indicate that DXMODE consistently outperforms competing methods, securing first place across all tests with statistically significant p-values; it surpasses IMODE with a confidence of 99.29%. DXMODE is also validated on 13 Engineering optimization problems, outperforming all algorithms with significant p-values, proving its superiority across real-world problems. The source code of DXMODE is publicly available on GitHub and MATLAB File Exchange: <span><span>https://github.com/MohamedRedaMu/DXMODE-Algorithm</span><svg><path></path></svg></span>, <span><span>https://uk.mathworks.com/matlabcentral/fileexchange/181143-dxmode-algorithm</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"717 ","pages":"Article 122271"},"PeriodicalIF":8.1000,"publicationDate":"2025-05-09","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/S0020025525004037","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

Traditional methods often struggle with complex, real-world problems, while Differential Evolution (DE) offers more robust and adaptable solutions. However, many DE variants intertwine exploration and exploitation within mutation operators and rely on static or blind population reduction, leading to premature diversity loss. This paper proposes Dynamic Explorative Multi-Operator Differential Evolution (DXMODE), a novel DE variant featuring Error-based Linear Population Decay (ELPD) for adaptive sizing, considering both the error improvement and the iteration count. A decoupled exploration phase is also introduced with two new operators, Aggressive Gaussian Exploration (AGE) and Multiple Nested Chaotic Exploration (MNCE), enhancing diversity and search efficiency. DXMODE is validated on CEC2020/2021 and CEC2022 benchmarks against 30 state-of-the-art algorithms, including advanced DE variants and CEC winners. Statistical analyses indicate that DXMODE consistently outperforms competing methods, securing first place across all tests with statistically significant p-values; it surpasses IMODE with a confidence of 99.29%. DXMODE is also validated on 13 Engineering optimization problems, outperforming all algorithms with significant p-values, proving its superiority across real-world problems. The source code of DXMODE is publicly available on GitHub and MATLAB File Exchange: https://github.com/MohamedRedaMu/DXMODE-Algorithm, https://uk.mathworks.com/matlabcentral/fileexchange/181143-dxmode-algorithm.
DXMODE:一种用于工程优化问题的动态探索性多算子差分进化算法
传统方法经常与复杂的现实问题作斗争,而差分进化(DE)提供了更健壮和适应性更强的解决方案。然而,许多DE变体在突变算子中交织着探索和开发,并依赖于静态或盲目的种群减少,导致多样性过早丧失。本文提出了一种基于误差的线性种群衰减(ELPD)的动态探索性多算子微分进化(DXMODE)算法,该算法同时考虑了误差改进和迭代次数,具有自适应大小。同时引入了主动高斯搜索(Aggressive Gaussian exploration, AGE)和多重嵌套混沌搜索(Multiple Nested chaos exploration, MNCE)这两个新的算子来解耦搜索阶段,提高了算法的多样性和搜索效率。DXMODE在CEC2020/2021和CEC2022基准测试中,针对30种最先进的算法进行了验证,包括先进的DE变体和CEC赢家。统计分析表明,DXMODE始终优于竞争方法,在所有具有统计显著p值的测试中获得第一名;以99.29%的置信度优于IMODE。DXMODE还在13个工程优化问题上进行了验证,优于所有具有显著p值的算法,证明了其在现实问题中的优越性。DXMODE的源代码在GitHub和MATLAB File Exchange上公开提供:https://github.com/MohamedRedaMu/DXMODE-Algorithm, https://uk.mathworks.com/matlabcentral/fileexchange/181143-dxmode-algorithm。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
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学术官方微信