Experience Exchange Strategy: An evolutionary strategy for meta-heuristic optimization algorithms

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Heming Jia , Honghua Rao
{"title":"Experience Exchange Strategy: An evolutionary strategy for meta-heuristic optimization algorithms","authors":"Heming Jia ,&nbsp;Honghua Rao","doi":"10.1016/j.swevo.2025.102082","DOIUrl":null,"url":null,"abstract":"<div><div>Meta-heuristic optimization algorithms typically change individual positions based on iterations, causing the population to switch search regions. This may result in the original search area not being explored in depth, thereby reducing the optimization performance of the algorithm. To deepen the connection between populations and individuals, this article proposes an evolutionary strategy called Experience Exchange Strategy (EES). EES considers the relationship between individuals and populations, deepening the connection between individuals and populations. EES has structured into three distinct stages: the experience scarcity stage (ESC), the experience crossover stage (ECR), the experience sharing stage (ESH). In the ESC, due to many areas not being searched, the population lacks search experience and mainly relies on primitive algorithms to find positions. This can preserve the optimization effect of the original algorithm and explore more positions. In the ECR, due to the accumulation of more experience in the population, individuals will update their positions based on more reference population experience. This can improve the accuracy of the search range and conduct more detailed searches. In the ESH, the population accumulates a large amount of experience, and individuals conduct more detailed searches based on the population’s experience. Through ESH, the population can search intensively to find a better position more finely. To verify the performance of EES, this article conducted optimization tests using IEEE CEC2014 and IEEE CEC2020 functions. And 15 algorithms were selected for improvement and compared with the original algorithm. Then, 57 single objective constrained engineering problems were used for testing experiments. The experimental results demonstrate that EES significantly improves the performance of meta-heuristic optimization algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102082"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002408","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Meta-heuristic optimization algorithms typically change individual positions based on iterations, causing the population to switch search regions. This may result in the original search area not being explored in depth, thereby reducing the optimization performance of the algorithm. To deepen the connection between populations and individuals, this article proposes an evolutionary strategy called Experience Exchange Strategy (EES). EES considers the relationship between individuals and populations, deepening the connection between individuals and populations. EES has structured into three distinct stages: the experience scarcity stage (ESC), the experience crossover stage (ECR), the experience sharing stage (ESH). In the ESC, due to many areas not being searched, the population lacks search experience and mainly relies on primitive algorithms to find positions. This can preserve the optimization effect of the original algorithm and explore more positions. In the ECR, due to the accumulation of more experience in the population, individuals will update their positions based on more reference population experience. This can improve the accuracy of the search range and conduct more detailed searches. In the ESH, the population accumulates a large amount of experience, and individuals conduct more detailed searches based on the population’s experience. Through ESH, the population can search intensively to find a better position more finely. To verify the performance of EES, this article conducted optimization tests using IEEE CEC2014 and IEEE CEC2020 functions. And 15 algorithms were selected for improvement and compared with the original algorithm. Then, 57 single objective constrained engineering problems were used for testing experiments. The experimental results demonstrate that EES significantly improves the performance of meta-heuristic optimization algorithms.
经验交换策略:元启发式优化算法的进化策略
元启发式优化算法通常会根据迭代改变单个位置,导致总体切换搜索区域。这可能导致原始搜索区域没有被深入探索,从而降低算法的优化性能。为了加深种群与个体之间的联系,本文提出了一种称为经验交换策略(EES)的进化策略。EES考虑了个体与群体之间的关系,加深了个体与群体之间的联系。EES分为三个不同的阶段:经验稀缺阶段(ESC)、经验交叉阶段(ECR)和经验共享阶段(ESH)。在ESC中,由于许多区域没有被搜索,种群缺乏搜索经验,主要依靠原始算法寻找位置。这样既可以保留原算法的优化效果,又可以探索更多的位置。在ECR中,由于在种群中积累了更多的经验,个体会根据更多的参考种群经验更新自己的立场。这可以提高搜索范围的准确性,并进行更详细的搜索。在ESH中,群体积累了大量的经验,个体根据群体的经验进行更详细的搜索。通过ESH,种群可以集中搜索,更精细地找到更好的位置。为了验证EES的性能,本文使用IEEE CEC2014和IEEE CEC2020函数进行了优化测试。选取15种算法进行改进,并与原算法进行比较。然后利用57个单目标约束工程问题进行测试实验。实验结果表明,EES显著提高了元启发式优化算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信