Adaptive Operator Selection for Meta-Heuristics: A Survey

Jiyuan Pei;Yi Mei;Jialin Liu;Mengjie Zhang;Xin Yao
{"title":"Adaptive Operator Selection for Meta-Heuristics: A Survey","authors":"Jiyuan Pei;Yi Mei;Jialin Liu;Mengjie Zhang;Xin Yao","doi":"10.1109/TAI.2025.3545792","DOIUrl":null,"url":null,"abstract":"Appropriate selection of search operators plays a critical role in meta-heuristic algorithm design. Adaptive selection of suitable operators to the characteristics of different optimization stages is an important task that owns promising potential to improve the performance of a meta-heuristic algorithm. A variety of adaptive operator selection methods have been proposed in last decades, from the machine learning and optimization communities. However, the existing studies have not been systematically reviewed so far. To fill the gap, this article provides a comprehensive survey of adaptive operator selection for meta-heuristics. According to the information required for selection, adaptive operator selection methods are classified into two categories: 1) stateless methods; and 2) state-based methods. Each category is further summarized into several key components. The strategies of each component belonging to the two categories are reviewed respectively. The motivation, strengths and weaknesses of the proposed strategies are also discussed. Furthermore, studied meta-heuristics and optimization problems in the literature are summarized. The effects from the difference of meta-heuristics and problems to the specific design of methods are discussed, together with the guidance of selecting the suitable method in different application scenarios. At the end, emerging challenges that could guide further research are discussed.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"6 8","pages":"1991-2012"},"PeriodicalIF":0.0000,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10904096","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10904096/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Appropriate selection of search operators plays a critical role in meta-heuristic algorithm design. Adaptive selection of suitable operators to the characteristics of different optimization stages is an important task that owns promising potential to improve the performance of a meta-heuristic algorithm. A variety of adaptive operator selection methods have been proposed in last decades, from the machine learning and optimization communities. However, the existing studies have not been systematically reviewed so far. To fill the gap, this article provides a comprehensive survey of adaptive operator selection for meta-heuristics. According to the information required for selection, adaptive operator selection methods are classified into two categories: 1) stateless methods; and 2) state-based methods. Each category is further summarized into several key components. The strategies of each component belonging to the two categories are reviewed respectively. The motivation, strengths and weaknesses of the proposed strategies are also discussed. Furthermore, studied meta-heuristics and optimization problems in the literature are summarized. The effects from the difference of meta-heuristics and problems to the specific design of methods are discussed, together with the guidance of selecting the suitable method in different application scenarios. At the end, emerging challenges that could guide further research are discussed.
元启发式自适应算子选择研究综述
搜索算子的合理选择在元启发式算法设计中起着至关重要的作用。根据不同优化阶段的特点自适应选择合适的算子是提高元启发式算法性能的重要任务,具有很大的潜力。在过去的几十年里,从机器学习和优化社区提出了各种自适应算子选择方法。然而,现有的研究迄今尚未得到系统的审查。为了填补这一空白,本文对元启发式的自适应算子选择进行了全面的综述。根据选择所需的信息,将自适应算子选择方法分为两类:1)无状态方法;2)基于状态的方法。每个类别进一步总结为几个关键组成部分。本文分别对两类中各成分的策略进行了综述。本文还讨论了这些策略的动机、优缺点。此外,对文献中研究的元启发式和优化问题进行了总结。讨论了元启发式和问题的差异对方法具体设计的影响,并指导在不同应用场景下选择合适的方法。最后,讨论了可能指导进一步研究的新挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
×
引用
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学术官方微信