Enhanced mutation strategy based differential evolution for global optimization problems.

IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
PeerJ Computer Science Pub Date : 2025-03-06 eCollection Date: 2025-01-01 DOI:10.7717/peerj-cs.2696
Pawan Mishra, Musrrat Ali, Pooja, Safiqul Islam
{"title":"Enhanced mutation strategy based differential evolution for global optimization problems.","authors":"Pawan Mishra, Musrrat Ali, Pooja, Safiqul Islam","doi":"10.7717/peerj-cs.2696","DOIUrl":null,"url":null,"abstract":"<p><p>Differential evolution (DE) stands out as a prominent algorithm for addressing global optimization challenges. The efficacy of DE hinges crucially upon its mutation operation, which serves as a pivotal mechanism in generating diverse and high-quality solutions. This article explores various mutation operations aimed at augmenting the performance of DE in global optimization tasks. A distinct mutation strategy is introduced, with the primary objective of achieving a harmonious equilibrium between exploration and exploitation to enhance both convergence speed and solution quality. The proposed DE centres on a novel mutation-based strategy, introducing a new coefficient factor (\"σ\") in conjunction with the base vector of the basic mutation strategy (\"DE/rand/1\"). This innovation aims to fortify the convergence of local variables during exploitation, thereby improving both the convergence rate and quality. The effectiveness of the proposed mutation operations is evaluated across a set of 27 benchmark functions commonly employed in global optimization. Experimental results conclusively demonstrate that these enhanced mutation strategies significantly outperform state-of-the-art algorithms in terms of solution accuracy and convergence speed. This study underscores the critical role of mutation operations in DE and provides valuable insights for designing more potent mutation strategies to tackle complex global optimization problems.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e2696"},"PeriodicalIF":3.5000,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11935757/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.2696","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Differential evolution (DE) stands out as a prominent algorithm for addressing global optimization challenges. The efficacy of DE hinges crucially upon its mutation operation, which serves as a pivotal mechanism in generating diverse and high-quality solutions. This article explores various mutation operations aimed at augmenting the performance of DE in global optimization tasks. A distinct mutation strategy is introduced, with the primary objective of achieving a harmonious equilibrium between exploration and exploitation to enhance both convergence speed and solution quality. The proposed DE centres on a novel mutation-based strategy, introducing a new coefficient factor ("σ") in conjunction with the base vector of the basic mutation strategy ("DE/rand/1"). This innovation aims to fortify the convergence of local variables during exploitation, thereby improving both the convergence rate and quality. The effectiveness of the proposed mutation operations is evaluated across a set of 27 benchmark functions commonly employed in global optimization. Experimental results conclusively demonstrate that these enhanced mutation strategies significantly outperform state-of-the-art algorithms in terms of solution accuracy and convergence speed. This study underscores the critical role of mutation operations in DE and provides valuable insights for designing more potent mutation strategies to tackle complex global optimization problems.

基于增强突变策略的差分进化全局优化问题。
差分进化(DE)作为解决全局优化挑战的突出算法而脱颖而出。DE的有效性关键取决于其突变操作,这是产生多样化和高质量解决方案的关键机制。本文探讨了各种旨在增强DE在全局优化任务中的性能的突变操作。引入了一种独特的突变策略,其主要目标是实现探索和开发之间的和谐平衡,以提高收敛速度和解的质量。提出的DE以一种新的基于突变的策略为中心,引入一个新的系数因子(“σ”)与基本突变策略的基向量(“DE/rand/1”)结合。这一创新旨在加强局部变量在开发过程中的收敛性,从而提高收敛速度和质量。所提出的突变操作的有效性通过一组27个通常用于全局优化的基准函数来评估。实验结果表明,这些增强的突变策略在求解精度和收敛速度方面明显优于最先进的算法。这项研究强调了突变操作在DE中的关键作用,并为设计更有效的突变策略来解决复杂的全局优化问题提供了有价值的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
PeerJ Computer Science
PeerJ Computer Science Computer Science-General Computer Science
CiteScore
6.10
自引率
5.30%
发文量
332
审稿时长
10 weeks
期刊介绍: PeerJ Computer Science is the new open access journal covering all subject areas in computer science, with the backing of a prestigious advisory board and more than 300 academic editors.
×
引用
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学术官方微信