MIFTTA:多策略改进足球队训练优化算法的工程应用

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Zhumei Sun, Jinhua Zhang, Qi Wang, Xinchun Jia, Aoqi Xiao, Zekai Chen
{"title":"MIFTTA:多策略改进足球队训练优化算法的工程应用","authors":"Zhumei Sun,&nbsp;Jinhua Zhang,&nbsp;Qi Wang,&nbsp;Xinchun Jia,&nbsp;Aoqi Xiao,&nbsp;Zekai Chen","doi":"10.1002/cpe.70282","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The football team training algorithm (FTTA) is a novel meta-heuristic optimization technique inspired by the three stages of a football team's training process: collective, group, and individual training. Although FTTA exhibits good competitiveness in comparison with other algorithms, it still has a number of drawbacks, including slow convergence speed, low convergence accuracy, insufficient perturbation, and a propensity to enter local optima when solving some complex problems with high dimensional and non-linear constraints. To address these drawbacks, this paper introduces an improved variant of FTTA, termed multi-strategy improved football team training algorithm (MIFTTA). First, an adaptive bilateral factor is introduced to effectively balance the global exploration and local exploitation capabilities of the algorithm. Second, an adaptive oscillating inertia weighting factor is implemented to accelerate the convergence process. Then, building on the adaptive cluster grouping mechanism of the original algorithm, an inter-group communication mechanism is integrated to enhance population diversity during the convergence process, thereby improving the convergence accuracy. Finally, a population bi-directional restart mechanism is devised to strengthen the algorithm's ability to escape from the local optima and explore the solution space more comprehensively. To validate the overall performance of MIFTTA, it is compared with various state-of-the-art algorithms in the CEC2017 and CEC2022 benchmark suites. The results show that MIFTTA achieves average rankings of 1.48 and 2.08 on the two test suites, respectively, with an overall final rank of 1. In the majority of test cases, MIFTTA provides more accurate and reliable solutions than other competitors. Furthermore, MIFTTA is applied to six real-world engineering optimization problems and two photovoltaic model parameter identification problems. The experimental results demonstrate that MIFTTA outperforms the competing algorithms in terms of solution quality and computational efficiency, showing its potential for solving complex optimization problems.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 23-24","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MIFTTA: Multi-Strategy Improved Football Team Training Optimization Algorithm for Engineering Applications\",\"authors\":\"Zhumei Sun,&nbsp;Jinhua Zhang,&nbsp;Qi Wang,&nbsp;Xinchun Jia,&nbsp;Aoqi Xiao,&nbsp;Zekai Chen\",\"doi\":\"10.1002/cpe.70282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>The football team training algorithm (FTTA) is a novel meta-heuristic optimization technique inspired by the three stages of a football team's training process: collective, group, and individual training. Although FTTA exhibits good competitiveness in comparison with other algorithms, it still has a number of drawbacks, including slow convergence speed, low convergence accuracy, insufficient perturbation, and a propensity to enter local optima when solving some complex problems with high dimensional and non-linear constraints. To address these drawbacks, this paper introduces an improved variant of FTTA, termed multi-strategy improved football team training algorithm (MIFTTA). First, an adaptive bilateral factor is introduced to effectively balance the global exploration and local exploitation capabilities of the algorithm. Second, an adaptive oscillating inertia weighting factor is implemented to accelerate the convergence process. Then, building on the adaptive cluster grouping mechanism of the original algorithm, an inter-group communication mechanism is integrated to enhance population diversity during the convergence process, thereby improving the convergence accuracy. Finally, a population bi-directional restart mechanism is devised to strengthen the algorithm's ability to escape from the local optima and explore the solution space more comprehensively. To validate the overall performance of MIFTTA, it is compared with various state-of-the-art algorithms in the CEC2017 and CEC2022 benchmark suites. The results show that MIFTTA achieves average rankings of 1.48 and 2.08 on the two test suites, respectively, with an overall final rank of 1. In the majority of test cases, MIFTTA provides more accurate and reliable solutions than other competitors. Furthermore, MIFTTA is applied to six real-world engineering optimization problems and two photovoltaic model parameter identification problems. The experimental results demonstrate that MIFTTA outperforms the competing algorithms in terms of solution quality and computational efficiency, showing its potential for solving complex optimization problems.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 23-24\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70282\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70282","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

足球队训练算法(FTTA)是一种新颖的元启发式优化技术,其灵感来自足球队训练过程的三个阶段:集体训练、团体训练和个人训练。尽管与其他算法相比,FTTA具有较好的竞争力,但仍存在收敛速度慢、收敛精度低、摄动不足、在求解一些高维非线性约束的复杂问题时容易进入局部最优等缺点。为了解决这些缺陷,本文引入了FTTA的改进变体,称为多策略改进足球队训练算法(MIFTTA)。首先,引入自适应双边因子,有效平衡算法的全局探索能力和局部开发能力;其次,引入自适应振荡惯性加权因子加速收敛过程;然后,在原有算法自适应聚类分组机制的基础上,引入群间通信机制,增强收敛过程中的种群多样性,从而提高收敛精度。最后,设计了种群双向重启机制,增强了算法摆脱局部最优的能力,更全面地探索解空间。为了验证MIFTTA的整体性能,将其与CEC2017和CEC2022基准套件中的各种最先进算法进行了比较。结果表明,MIFTTA在两个测试套件上的平均排名分别为1.48和2.08,总体最终排名为1。在大多数测试用例中,MIFTTA提供了比其他竞争对手更准确和可靠的解决方案。将MIFTTA应用于6个实际工程优化问题和2个光伏模型参数辨识问题。实验结果表明,MIFTTA算法在求解质量和计算效率方面优于同类算法,显示了其解决复杂优化问题的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MIFTTA: Multi-Strategy Improved Football Team Training Optimization Algorithm for Engineering Applications

The football team training algorithm (FTTA) is a novel meta-heuristic optimization technique inspired by the three stages of a football team's training process: collective, group, and individual training. Although FTTA exhibits good competitiveness in comparison with other algorithms, it still has a number of drawbacks, including slow convergence speed, low convergence accuracy, insufficient perturbation, and a propensity to enter local optima when solving some complex problems with high dimensional and non-linear constraints. To address these drawbacks, this paper introduces an improved variant of FTTA, termed multi-strategy improved football team training algorithm (MIFTTA). First, an adaptive bilateral factor is introduced to effectively balance the global exploration and local exploitation capabilities of the algorithm. Second, an adaptive oscillating inertia weighting factor is implemented to accelerate the convergence process. Then, building on the adaptive cluster grouping mechanism of the original algorithm, an inter-group communication mechanism is integrated to enhance population diversity during the convergence process, thereby improving the convergence accuracy. Finally, a population bi-directional restart mechanism is devised to strengthen the algorithm's ability to escape from the local optima and explore the solution space more comprehensively. To validate the overall performance of MIFTTA, it is compared with various state-of-the-art algorithms in the CEC2017 and CEC2022 benchmark suites. The results show that MIFTTA achieves average rankings of 1.48 and 2.08 on the two test suites, respectively, with an overall final rank of 1. In the majority of test cases, MIFTTA provides more accurate and reliable solutions than other competitors. Furthermore, MIFTTA is applied to six real-world engineering optimization problems and two photovoltaic model parameter identification problems. The experimental results demonstrate that MIFTTA outperforms the competing algorithms in terms of solution quality and computational efficiency, showing its potential for solving complex optimization problems.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信