IF 3.4 3区 医学 Q1 ENGINEERING, MULTIDISCIPLINARY
Wenkai Tang, Shangqing Shi, Zengtong Lu, Mengying Lin, Hao Cheng
{"title":"EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems.","authors":"Wenkai Tang, Shangqing Shi, Zengtong Lu, Mengying Lin, Hao Cheng","doi":"10.3390/biomimetics10030176","DOIUrl":null,"url":null,"abstract":"<p><p>The Educational Competition Optimizer (ECO) is a newly proposed human-based metaheuristic algorithm. It derives from the phenomenon of educational competition in society with good performance. However, the basic ECO is constrained by its limited exploitation and exploration abilities when tackling complex optimization problems and exhibits the drawbacks of premature convergence and diminished population diversity. To this end, this paper proposes an enhanced educational competition optimizer, named EDECO, by incorporating estimation of distribution algorithm and replacing some of the best individual(s) using a dynamic fitness distance balancing strategy. On the one hand, the estimation of distribution algorithm enhances the global exploration ability and improves the population quality by establishing a probabilistic model based on the dominant individuals provided by EDECO, which solves the problem that the algorithm is unable to search the neighborhood of the optimal solution. On the other hand, the dynamic fitness distance balancing strategy increases the convergence speed of the algorithm and balances the exploitation and exploration through an adaptive mechanism. Finally, this paper conducts experiments on the proposed EDECO algorithm with 29 CEC 2017 benchmark functions and compares EDECO with four basic algorithms as well as four advanced improved algorithms. The results show that EDECO indeed achieves significant improvements compared to the basic ECO and other compared algorithms, and performs noticeably better than its competitors. Next, this study applies EDECO to 10 engineering constrained optimization problems, and the experimental results show the significant superiority of EDECO in solving real engineering optimization problems. These findings further support the effectiveness and usefulness of our proposed algorithm in solving complex engineering optimization challenges.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 3","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11939898/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/biomimetics10030176","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

教育竞争优化算法(Educational Competition Optimizer,ECO)是一种新提出的以人为基础的元启发式算法。它源于社会中的教育竞争现象,具有良好的性能。然而,在处理复杂的优化问题时,基本 ECO 受限于其有限的开发和探索能力,表现出过早收敛和种群多样性减少的缺点。为此,本文提出了一种增强型教育竞争优化器,命名为 EDECO,它结合了分布估计算法,并采用动态适应度距离平衡策略替换部分最佳个体。一方面,分布估计算法根据 EDECO 提供的优势个体建立概率模型,增强了全局探索能力,提高了种群质量,解决了算法无法搜索最优解邻域的问题。另一方面,动态适合度距离平衡策略提高了算法的收敛速度,并通过自适应机制平衡了开发和探索。最后,本文用 29 个 CEC 2017 基准函数对提出的 EDECO 算法进行了实验,并将 EDECO 与四种基本算法以及四种高级改进算法进行了比较。结果表明,与基本 ECO 算法和其他比较算法相比,EDECO 确实实现了显著的改进,其性能明显优于竞争对手。接下来,本研究将 EDECO 应用于 10 个工程约束优化问题,实验结果表明 EDECO 在解决实际工程优化问题方面具有明显的优势。这些发现进一步证明了我们提出的算法在解决复杂工程优化挑战方面的有效性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems.

The Educational Competition Optimizer (ECO) is a newly proposed human-based metaheuristic algorithm. It derives from the phenomenon of educational competition in society with good performance. However, the basic ECO is constrained by its limited exploitation and exploration abilities when tackling complex optimization problems and exhibits the drawbacks of premature convergence and diminished population diversity. To this end, this paper proposes an enhanced educational competition optimizer, named EDECO, by incorporating estimation of distribution algorithm and replacing some of the best individual(s) using a dynamic fitness distance balancing strategy. On the one hand, the estimation of distribution algorithm enhances the global exploration ability and improves the population quality by establishing a probabilistic model based on the dominant individuals provided by EDECO, which solves the problem that the algorithm is unable to search the neighborhood of the optimal solution. On the other hand, the dynamic fitness distance balancing strategy increases the convergence speed of the algorithm and balances the exploitation and exploration through an adaptive mechanism. Finally, this paper conducts experiments on the proposed EDECO algorithm with 29 CEC 2017 benchmark functions and compares EDECO with four basic algorithms as well as four advanced improved algorithms. The results show that EDECO indeed achieves significant improvements compared to the basic ECO and other compared algorithms, and performs noticeably better than its competitors. Next, this study applies EDECO to 10 engineering constrained optimization problems, and the experimental results show the significant superiority of EDECO in solving real engineering optimization problems. These findings further support the effectiveness and usefulness of our proposed algorithm in solving complex engineering optimization challenges.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Biomimetics
Biomimetics Biochemistry, Genetics and Molecular Biology-Biotechnology
CiteScore
3.50
自引率
11.10%
发文量
189
审稿时长
11 weeks
×
引用
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学术官方微信