梳理2019-2024年150+新元启发算法，助你快速选对优化工具
A survey on pioneering metaheuristic algorithms between 2019 and 2024
- 系统评估150余种近年元启发算法的创新机制与参数友好性
- 筛选出23个高影响力算法，覆盖多种优化问题类型并具可复现代码
- 揭示算法在避免早熟收敛等传统问题上的改进策略，适合研究者参考
本文综述了2019至2024年间超过150种新提出的元启发式算法，强调其在复杂优化问题中的深远影响与性能表现。过去三十年中已有超过500种新元启发算法被提出，且趋势未减。数量激增使算法选择与评估变得困难。本研究基于年度引用量、问题类型覆盖面、源码可得性、参数配置友好度、创新机制与算子设计，以及缓解传统问题（如停滞、早熟收敛）的有效性等关键标准进行评估。进一步分析了过去六年中最具影响力的23种算法在实际应用中的表现，揭示其优势与局限，并指出未来研究挑战与方向。
原文摘要 · Abstract (English)
This review examines over 150 new metaheuristics of the last six years (between 2019 and 2024), underscoring their profound influence and performance. Over the past three decades, more than 500 new metaheuristic algorithms have been proposed, with no slowdown in sight. An overwhelming abundance that complicates the process of selecting and assessing the most effective solutions for complex optimization challenges. Our evaluation centers on pivotal criteria, including annual citation metrics, the breadth of the addressed problem types, source code availability, user friendly parameter configurations, innovative mechanisms and operators, and approaches designed to mitigate traditional metaheuristic issues such as stagnation and premature convergence. We further explore recent high impact applications of the past six years' most influential 23 metahueristic algorithms, shedding light on their advantages and limitations, while identifying challenges and potential avenues for future research.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。