Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yaning Xiao, Hao Cui, Ruba Abu Khurma, Pedro A. Castillo
{"title":"Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems","authors":"Yaning Xiao,&nbsp;Hao Cui,&nbsp;Ruba Abu Khurma,&nbsp;Pedro A. Castillo","doi":"10.1007/s10462-024-11023-7","DOIUrl":null,"url":null,"abstract":"<div><p>The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 3","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11023-7.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11023-7","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm.

人工漫游算法:一种解决现实世界工程优化问题的新型仿生元启发式技术
随着智能信息时代的到来,各种学科的复杂优化问题层出不穷。尽管现有的元启发式算法已经在许多场景中证明了有效性,但它们仍然面临着某些挑战,例如在高维非凸搜索空间中过早收敛、探索不足以及缺乏鲁棒性。这些限制强调了对新的优化技术的需求,这些技术可以在保持计算效率的同时更好地平衡勘探和开采。针对这一需求,我们提出了人工旅鼠算法(Artificial Lemming Algorithm, ALA),这是一种受生物启发的元启发式算法,它对旅鼠在自然界中的四种不同行为进行数学建模:长途迁徙、挖洞、觅食和躲避捕食者。其中,长距离迁移和挖洞行为致力于对搜索域的高度探索,而觅食和躲避捕食者行为在优化过程中提供了开发。此外,ALA还包含一个能量递减机制,可以动态调整勘探和开采之间的平衡,从而增强其逃避局部最优解和更稳健地收敛到全局解的能力。为了彻底验证所提出方法的有效性,在IEEE CEC2017基准测试套件和IEEE CEC2022基准测试套件上,将ALA与其他17种最先进的元启发式算法进行了比较。实验结果表明,该算法具有可靠的综合优化性能,在大多数测试用例中都能取得优异的解精度、收敛速度和稳定性。对于29个10维、30维、50维和100维CEC2017函数,ALA在所有竞争方法中获得的Friedman平均排名值最低,分别为1.7241、2.1034、2.7241和2.9310;对于12个CEC2022函数,ALA再次获得最优Friedman平均排名,为2.1667。最后,为了进一步评估其适用性,将ALA应用于一系列优化案例,包括约束工程设计、光伏(PV)模型参数辨识和分数阶比例微分积分(FOPID)控制器增益整定。我们的研究结果突出了ALA在实际工程应用中的竞争优势和潜力。ALA的源代码可以在https://github.com/StevenShaw98/Artificial-Lemming-Algorithm上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
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学术官方微信