An improved termite life cycle optimizer algorithm for global function optimization.

IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
PeerJ Computer Science Pub Date : 2025-02-17 eCollection Date: 2025-01-01 DOI:10.7717/peerj-cs.2671
Yanjiao Wang, Mengjiao Wei
{"title":"An improved termite life cycle optimizer algorithm for global function optimization.","authors":"Yanjiao Wang, Mengjiao Wei","doi":"10.7717/peerj-cs.2671","DOIUrl":null,"url":null,"abstract":"<p><p>The termite life cycle optimizer algorithm (TLCO) is a new bionic meta-heuristic algorithm that emulates the natural behavior of termites in their natural habitat. This work presents an improved TLCO (ITLCO) to increase the speed and accuracy of convergence. A novel strategy for worker generation is established to enhance communication between individuals in the worker population and termite population. This strategy would prevent the original worker generation strategy from effectively balancing algorithm convergence and population diversity to reduce the risk of the algorithm in reaching a local optimum. A novel soldier generation strategy is proposed, which incorporates a step factor that adheres to the principles of evolution to further enhance the algorithm's convergence speed. Furthermore, a novel replacement update mechanism is executed when the new individual is of lower quality than the original individual. This mechanism ensures a balance between the convergence of the algorithm and the diversity of the population. The findings from CEC2013, CEC2019, and CEC2020 test sets indicate that ITLCO exhibits notable benefits regarding convergence speed, accuracy, and stability in comparison with the basic TLCO algorithm and the four most exceptional meta-heuristic algorithms thus far.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e2671"},"PeriodicalIF":3.5000,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11888856/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.2671","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The termite life cycle optimizer algorithm (TLCO) is a new bionic meta-heuristic algorithm that emulates the natural behavior of termites in their natural habitat. This work presents an improved TLCO (ITLCO) to increase the speed and accuracy of convergence. A novel strategy for worker generation is established to enhance communication between individuals in the worker population and termite population. This strategy would prevent the original worker generation strategy from effectively balancing algorithm convergence and population diversity to reduce the risk of the algorithm in reaching a local optimum. A novel soldier generation strategy is proposed, which incorporates a step factor that adheres to the principles of evolution to further enhance the algorithm's convergence speed. Furthermore, a novel replacement update mechanism is executed when the new individual is of lower quality than the original individual. This mechanism ensures a balance between the convergence of the algorithm and the diversity of the population. The findings from CEC2013, CEC2019, and CEC2020 test sets indicate that ITLCO exhibits notable benefits regarding convergence speed, accuracy, and stability in comparison with the basic TLCO algorithm and the four most exceptional meta-heuristic algorithms thus far.

一种用于全局函数优化的改进白蚁生命周期优化算法。
白蚁生命周期优化算法(TLCO)是一种模拟白蚁在其自然栖息地的自然行为的仿生元启发式算法。本文提出了一种改进的TLCO (ITLCO),以提高收敛的速度和精度。建立了一种新的工蚁生成策略,以增强工蚁种群与白蚁种群之间的沟通。该策略将阻止原工人生成策略有效地平衡算法收敛性和种群多样性,以降低算法达到局部最优的风险。为了进一步提高算法的收敛速度,提出了一种新的士兵生成策略,该策略引入了符合进化原理的阶跃因子。此外,当新个体的质量低于原个体时,执行一种新的替换更新机制。这种机制保证了算法的收敛性和种群的多样性之间的平衡。CEC2013、CEC2019和CEC2020测试集的结果表明,与基本TLCO算法和迄今为止四种最出色的元启发式算法相比,ITLCO在收敛速度、准确性和稳定性方面具有显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
PeerJ Computer Science
PeerJ Computer Science Computer Science-General Computer Science
CiteScore
6.10
自引率
5.30%
发文量
332
审稿时长
10 weeks
期刊介绍: PeerJ Computer Science is the new open access journal covering all subject areas in computer science, with the backing of a prestigious advisory board and more than 300 academic editors.
×
引用
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学术官方微信