囊状动物群算法的综合综述:变化,应用和结果

IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Rong Zheng, Abdelazim G. Hussien, Anas Bouaouda, Rui Zhong, Gang Hu
{"title":"囊状动物群算法的综合综述:变化,应用和结果","authors":"Rong Zheng,&nbsp;Abdelazim G. Hussien,&nbsp;Anas Bouaouda,&nbsp;Rui Zhong,&nbsp;Gang Hu","doi":"10.1007/s11831-025-10228-5","DOIUrl":null,"url":null,"abstract":"<div><p>The development of new metaheuristic algorithms and their enhancements has seen significant growth, yet many of these algorithms share similar limitations. This is largely due to insufficient studies analyzing their structures and performance prior to proposing modifications. The Tunicate Swarm Algorithm (TSA), a recently developed nature-inspired algorithm, offers a simple structure, distinctive stabilizing features, and impressive efficiency. Inspired by the social behaviors of tunicates and their jet propulsion for movement and foraging, the TSA employs a dynamic weighting mechanism to simulate their influence during the search process. Its notable traits, including simplicity, adaptability, minimal parameters, and independence from derivatives, have contributed to its rapid adoption across various optimization problems. This review focuses on the foundational research underlying the TSA, exploring its development and effectiveness as highlighted in existing studies. It also examines enhancements to the algorithm’s behavior, particularly efforts to align search space geometry with practical optimization challenges. Finally, potential directions for future improvements and adaptations are proposed to further advance the TSA’s capabilities.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 5","pages":"2917 - 2986"},"PeriodicalIF":12.1000,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results\",\"authors\":\"Rong Zheng,&nbsp;Abdelazim G. Hussien,&nbsp;Anas Bouaouda,&nbsp;Rui Zhong,&nbsp;Gang Hu\",\"doi\":\"10.1007/s11831-025-10228-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The development of new metaheuristic algorithms and their enhancements has seen significant growth, yet many of these algorithms share similar limitations. This is largely due to insufficient studies analyzing their structures and performance prior to proposing modifications. The Tunicate Swarm Algorithm (TSA), a recently developed nature-inspired algorithm, offers a simple structure, distinctive stabilizing features, and impressive efficiency. Inspired by the social behaviors of tunicates and their jet propulsion for movement and foraging, the TSA employs a dynamic weighting mechanism to simulate their influence during the search process. Its notable traits, including simplicity, adaptability, minimal parameters, and independence from derivatives, have contributed to its rapid adoption across various optimization problems. This review focuses on the foundational research underlying the TSA, exploring its development and effectiveness as highlighted in existing studies. It also examines enhancements to the algorithm’s behavior, particularly efforts to align search space geometry with practical optimization challenges. Finally, potential directions for future improvements and adaptations are proposed to further advance the TSA’s capabilities.</p></div>\",\"PeriodicalId\":55473,\"journal\":{\"name\":\"Archives of Computational Methods in Engineering\",\"volume\":\"32 5\",\"pages\":\"2917 - 2986\"},\"PeriodicalIF\":12.1000,\"publicationDate\":\"2025-03-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archives of Computational Methods in Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11831-025-10228-5\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Computational Methods in Engineering","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s11831-025-10228-5","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

新的元启发式算法及其增强的发展已经取得了显着的增长,然而许多这些算法都有类似的局限性。这主要是由于在提出修改建议之前,对其结构和性能分析的研究不足。被囊虫群算法(TSA)是最近发展起来的一种受自然启发的算法,它具有简单的结构、独特的稳定特性和令人印象深刻的效率。受被囊动物的社会行为及其运动和觅食的喷气推进力的启发,TSA采用了动态加权机制来模拟它们在搜索过程中的影响。它的显著特点,包括简单性、适应性、最小参数和独立于导数,使其迅速应用于各种优化问题。本文综述了TSA的基础研究,探讨了现有研究中TSA的发展和有效性。它还研究了对算法行为的增强,特别是将搜索空间几何与实际优化挑战相结合的努力。最后,提出了未来改进和适应的潜在方向,以进一步提高TSA的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results

A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results

The development of new metaheuristic algorithms and their enhancements has seen significant growth, yet many of these algorithms share similar limitations. This is largely due to insufficient studies analyzing their structures and performance prior to proposing modifications. The Tunicate Swarm Algorithm (TSA), a recently developed nature-inspired algorithm, offers a simple structure, distinctive stabilizing features, and impressive efficiency. Inspired by the social behaviors of tunicates and their jet propulsion for movement and foraging, the TSA employs a dynamic weighting mechanism to simulate their influence during the search process. Its notable traits, including simplicity, adaptability, minimal parameters, and independence from derivatives, have contributed to its rapid adoption across various optimization problems. This review focuses on the foundational research underlying the TSA, exploring its development and effectiveness as highlighted in existing studies. It also examines enhancements to the algorithm’s behavior, particularly efforts to align search space geometry with practical optimization challenges. Finally, potential directions for future improvements and adaptations are proposed to further advance the TSA’s capabilities.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.80
自引率
4.10%
发文量
153
审稿时长
>12 weeks
期刊介绍: Archives of Computational Methods in Engineering Aim and Scope: Archives of Computational Methods in Engineering serves as an active forum for disseminating research and advanced practices in computational engineering, particularly focusing on mechanics and related fields. The journal emphasizes extended state-of-the-art reviews in selected areas, a unique feature of its publication. Review Format: Reviews published in the journal offer: A survey of current literature Critical exposition of topics in their full complexity By organizing the information in this manner, readers can quickly grasp the focus, coverage, and unique features of the Archives of Computational Methods in Engineering.
×
引用
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学术官方微信