基于螺旋传感搜索机制的增强型黏菌算法及其在光伏电池参数识别问题中的工程应用

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qian Qian, Hongyu Li, Anbo Wang, Jiawen Pan, Miao Song, Yong Feng, Yingna Li
{"title":"基于螺旋传感搜索机制的增强型黏菌算法及其在光伏电池参数识别问题中的工程应用","authors":"Qian Qian,&nbsp;Hongyu Li,&nbsp;Anbo Wang,&nbsp;Jiawen Pan,&nbsp;Miao Song,&nbsp;Yong Feng,&nbsp;Yingna Li","doi":"10.1155/int/9642959","DOIUrl":null,"url":null,"abstract":"<p>The slime mold algorithm (SMA) is a metaheuristic optimization algorithm that simulates the foraging behavior of slime molds. Compared to other optimization algorithms, SMA has fewer parameters, faster convergence speed, and stronger optimization capabilities. However, the standard SMA uses two randomly selected individuals to guide the search direction of the population, which results in excessive randomness during the search process. This can lead to the loss of valuable information and waste computational resources. To overcome these limitations, this study proposes an enhanced slime mold algorithm (S2SMA) based on a spiral sensing search mechanism. The main contributions of this study are as follows: Firstly, a fitness–distance balanced oscillation search mechanism is introduced to solve the issue of lack of guidance in the individual oscillatory search phase in the original SMA, thus enhancing the global exploration ability of the algorithm. Secondly, the spiral sensing search mechanism is introduced, reshaping the random redistribution behavior in SMA. This aims to fully utilize the effective information in the existing population, improve search efficiency, and enhance population diversity. Finally, the computational logic of SMA is restructured based on the existing parameters, improving the algorithm’s performance while avoiding additional computational overhead. To validate the effectiveness of the proposed S2SMA, experiments were conducted on 71 test instances from the IEEE CEC2017 and IEEE CEC2021 benchmark sets, as well as three engineering problems. The algorithm was compared with classical algorithms, high-performance algorithms, and advanced SMA variants. Experimental results show that S2SMA outperforms the classical algorithms, high-performance algorithms, and other SMA variants in terms of both performance and robustness, demonstrating its potential application in engineering optimization.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7000,"publicationDate":"2025-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/9642959","citationCount":"0","resultStr":"{\"title\":\"An Augmented Slime Mold Algorithm Based on Spiral Sensing Search Mechanism and Its Engineering Application for Photovoltaic Cell Parameter Identification Problem\",\"authors\":\"Qian Qian,&nbsp;Hongyu Li,&nbsp;Anbo Wang,&nbsp;Jiawen Pan,&nbsp;Miao Song,&nbsp;Yong Feng,&nbsp;Yingna Li\",\"doi\":\"10.1155/int/9642959\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The slime mold algorithm (SMA) is a metaheuristic optimization algorithm that simulates the foraging behavior of slime molds. Compared to other optimization algorithms, SMA has fewer parameters, faster convergence speed, and stronger optimization capabilities. However, the standard SMA uses two randomly selected individuals to guide the search direction of the population, which results in excessive randomness during the search process. This can lead to the loss of valuable information and waste computational resources. To overcome these limitations, this study proposes an enhanced slime mold algorithm (S2SMA) based on a spiral sensing search mechanism. The main contributions of this study are as follows: Firstly, a fitness–distance balanced oscillation search mechanism is introduced to solve the issue of lack of guidance in the individual oscillatory search phase in the original SMA, thus enhancing the global exploration ability of the algorithm. Secondly, the spiral sensing search mechanism is introduced, reshaping the random redistribution behavior in SMA. This aims to fully utilize the effective information in the existing population, improve search efficiency, and enhance population diversity. Finally, the computational logic of SMA is restructured based on the existing parameters, improving the algorithm’s performance while avoiding additional computational overhead. To validate the effectiveness of the proposed S2SMA, experiments were conducted on 71 test instances from the IEEE CEC2017 and IEEE CEC2021 benchmark sets, as well as three engineering problems. The algorithm was compared with classical algorithms, high-performance algorithms, and advanced SMA variants. Experimental results show that S2SMA outperforms the classical algorithms, high-performance algorithms, and other SMA variants in terms of both performance and robustness, demonstrating its potential application in engineering optimization.</p>\",\"PeriodicalId\":14089,\"journal\":{\"name\":\"International Journal of Intelligent Systems\",\"volume\":\"2025 1\",\"pages\":\"\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/9642959\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/int/9642959\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/int/9642959","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

黏菌算法是一种模拟黏菌觅食行为的元启发式优化算法。与其他优化算法相比,SMA具有参数少、收敛速度快、优化能力强等优点。然而,标准SMA使用随机选择的两个个体来指导总体的搜索方向,导致搜索过程中的随机性过大。这可能导致宝贵信息的丢失和计算资源的浪费。为了克服这些局限性,本研究提出了一种基于螺旋传感搜索机制的增强型黏菌算法(S2SMA)。本研究的主要贡献如下:首先,引入了适应度-距离平衡振荡搜索机制,解决了原始SMA在单个振荡搜索阶段缺乏引导的问题,增强了算法的全局搜索能力;其次,引入螺旋传感搜索机制,重塑SMA中的随机再分配行为;这样做的目的是充分利用现有种群中的有效信息,提高搜索效率,增强种群多样性。最后,基于现有参数重构SMA的计算逻辑,在避免额外计算开销的同时提高了算法的性能。为了验证所提出的S2SMA的有效性,在IEEE CEC2017和IEEE CEC2021基准集的71个测试实例以及3个工程问题上进行了实验。将该算法与经典算法、高性能算法和先进SMA变体进行了比较。实验结果表明,S2SMA在性能和鲁棒性方面均优于经典算法、高性能算法和其他SMA变体,显示了其在工程优化中的潜在应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An Augmented Slime Mold Algorithm Based on Spiral Sensing Search Mechanism and Its Engineering Application for Photovoltaic Cell Parameter Identification Problem

An Augmented Slime Mold Algorithm Based on Spiral Sensing Search Mechanism and Its Engineering Application for Photovoltaic Cell Parameter Identification Problem

The slime mold algorithm (SMA) is a metaheuristic optimization algorithm that simulates the foraging behavior of slime molds. Compared to other optimization algorithms, SMA has fewer parameters, faster convergence speed, and stronger optimization capabilities. However, the standard SMA uses two randomly selected individuals to guide the search direction of the population, which results in excessive randomness during the search process. This can lead to the loss of valuable information and waste computational resources. To overcome these limitations, this study proposes an enhanced slime mold algorithm (S2SMA) based on a spiral sensing search mechanism. The main contributions of this study are as follows: Firstly, a fitness–distance balanced oscillation search mechanism is introduced to solve the issue of lack of guidance in the individual oscillatory search phase in the original SMA, thus enhancing the global exploration ability of the algorithm. Secondly, the spiral sensing search mechanism is introduced, reshaping the random redistribution behavior in SMA. This aims to fully utilize the effective information in the existing population, improve search efficiency, and enhance population diversity. Finally, the computational logic of SMA is restructured based on the existing parameters, improving the algorithm’s performance while avoiding additional computational overhead. To validate the effectiveness of the proposed S2SMA, experiments were conducted on 71 test instances from the IEEE CEC2017 and IEEE CEC2021 benchmark sets, as well as three engineering problems. The algorithm was compared with classical algorithms, high-performance algorithms, and advanced SMA variants. Experimental results show that S2SMA outperforms the classical algorithms, high-performance algorithms, and other SMA variants in terms of both performance and robustness, demonstrating its potential application in engineering optimization.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
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学术官方微信