Three stage based reinforcement learning for combining multiple metaheuristic algorithms

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xiaotong Liu , Tianlei Wang , Zhiqiang Zeng , Ye Tian , Jun Tong
{"title":"Three stage based reinforcement learning for combining multiple metaheuristic algorithms","authors":"Xiaotong Liu ,&nbsp;Tianlei Wang ,&nbsp;Zhiqiang Zeng ,&nbsp;Ye Tian ,&nbsp;Jun Tong","doi":"10.1016/j.swevo.2025.101935","DOIUrl":null,"url":null,"abstract":"<div><div>Combined of metaheuristic algorithms can effectively improve the performance of algorithms by utilizing the characteristics of different metaheuristic algorithms, and the key is how to combine multiple metaheuristic algorithms. Reinforcement learning is one of the effective methods for combining multiple metaheuristic algorithms. However, designing a competitive reinforcement learning approach to achieve efficient collaboration among metaheuristic algorithms is a highly challenging task. Therefore, this study proposes a three-stage reinforcement learning for combining multiple metaheuristic algorithms (TSRL-CMM). TSRL-CMM is divided into three stages: the exploration stage, the stage with both exploration and exploitation, and the exploitation stage. On this basis, an adaptive action selection strategy and a reward function are designed. The proposed action selection strategy can adaptively select appropriate metaheuristic algorithms based on the state of the population, achieving a balance between exploration and exploitation. The proposed reward function can effectively guide the population to transition to the expected state based on the iteration stage and state transitions. To verify the effectiveness of TSRL-CMM, we evaluated it using the CEC2017 test suite, nine real-world engineering design problems and six power system optimization problems. TSRL-CMM was compared with 10 state-of-the-art metaheuristic algorithms, and experimental results showed that TSRL-CMM performed better than the compared algorithms in both artificial and real-world problems. Furthermore, TSRL-CMM was specifically compared with three CEC winner algorithms on the CEC 2017 benchmark test suite. The experimental results show that the proposed algorithm is highly competitive. The source code can be obtained from <span><span>https://github.com/xtongliu/TSRL-CMM-code</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101935"},"PeriodicalIF":8.2000,"publicationDate":"2025-04-14","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/S2210650225000938","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

Combined of metaheuristic algorithms can effectively improve the performance of algorithms by utilizing the characteristics of different metaheuristic algorithms, and the key is how to combine multiple metaheuristic algorithms. Reinforcement learning is one of the effective methods for combining multiple metaheuristic algorithms. However, designing a competitive reinforcement learning approach to achieve efficient collaboration among metaheuristic algorithms is a highly challenging task. Therefore, this study proposes a three-stage reinforcement learning for combining multiple metaheuristic algorithms (TSRL-CMM). TSRL-CMM is divided into three stages: the exploration stage, the stage with both exploration and exploitation, and the exploitation stage. On this basis, an adaptive action selection strategy and a reward function are designed. The proposed action selection strategy can adaptively select appropriate metaheuristic algorithms based on the state of the population, achieving a balance between exploration and exploitation. The proposed reward function can effectively guide the population to transition to the expected state based on the iteration stage and state transitions. To verify the effectiveness of TSRL-CMM, we evaluated it using the CEC2017 test suite, nine real-world engineering design problems and six power system optimization problems. TSRL-CMM was compared with 10 state-of-the-art metaheuristic algorithms, and experimental results showed that TSRL-CMM performed better than the compared algorithms in both artificial and real-world problems. Furthermore, TSRL-CMM was specifically compared with three CEC winner algorithms on the CEC 2017 benchmark test suite. The experimental results show that the proposed algorithm is highly competitive. The source code can be obtained from https://github.com/xtongliu/TSRL-CMM-code.
结合多元启发式算法的三阶段强化学习
组合元启发式算法可以利用不同元启发式算法的特点,有效地提高算法的性能,而如何组合多个元启发式算法是关键。强化学习是多种元启发式算法相结合的有效方法之一。然而,设计一种竞争性的强化学习方法来实现元启发式算法之间的有效协作是一项极具挑战性的任务。因此,本研究提出了一种结合多元启发式算法(TSRL-CMM)的三阶段强化学习方法。TSRL-CMM分为三个阶段:勘探阶段、勘探开发阶段和开发阶段。在此基础上,设计了自适应行为选择策略和奖励函数。所提出的行动选择策略可以根据种群的状态自适应地选择合适的元启发式算法,实现探索与利用的平衡。所提出的奖励函数可以根据迭代阶段和状态转移有效地引导种群过渡到预期状态。为了验证TSRL-CMM的有效性,我们使用CEC2017测试套件、9个实际工程设计问题和6个电力系统优化问题对其进行了评估。将TSRL-CMM与10种最先进的元启发式算法进行了比较,实验结果表明,TSRL-CMM在人工问题和现实问题上的表现都优于比较算法。此外,TSRL-CMM在CEC 2017基准测试套件上与三种CEC赢家算法进行了具体比较。实验结果表明,该算法具有较强的竞争力。源代码可以从https://github.com/xtongliu/TSRL-CMM-code获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信