Tianji’s horse racing optimization (THRO): a new metaheuristic inspired by ancient wisdom and its engineering optimization applications

IF 13.9 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Liying Wang, Haiping Du, Zhenxing Zhang, Gang Hu, Seyedali Mirjalili, Nima Khodadadi, Abdelazim G. Hussien, Yingying Liao, Weiguo Zhao
{"title":"Tianji’s horse racing optimization (THRO): a new metaheuristic inspired by ancient wisdom and its engineering optimization applications","authors":"Liying Wang,&nbsp;Haiping Du,&nbsp;Zhenxing Zhang,&nbsp;Gang Hu,&nbsp;Seyedali Mirjalili,&nbsp;Nima Khodadadi,&nbsp;Abdelazim G. Hussien,&nbsp;Yingying Liao,&nbsp;Weiguo Zhao","doi":"10.1007/s10462-025-11269-9","DOIUrl":null,"url":null,"abstract":"<div><p>In this study, we introduce a novel metaheuristic algorithm named Tianji’s horse racing optimization (THRO), inspired by the Chinese historical story of Tianji’s horse racing. The story illustrates how Tianji leveraged his strengths to counteract his opponent’s weaknesses, ultimately leading to his victory in the competition. This strategic principle, which led to Tianji’s victory, forms the foundation of THRO’s design. The need for such a proposal arises from the limitations of existing optimization algorithms, which often struggle with convergence speed and solution accuracy when solving complex problems. THRO addresses these challenges by employing a unique dynamic individual matching strategy that enhances the algorithm’s convergence rate and solution precision. In this algorithm, an effective greedy strategy is employed to maximize benefits by selecting individuals from its population and matching them with individuals from the opponent’s population, thereby facilitating individual updates. This paper provides mathematically grounded explanations and analysis of how the algorithm converges to the global optimum with probability 1. To validate the efficacy of THRO, comparative experiments with 12 popular algorithms are conducted on 23 classical benchmark functions and the CEC2017 test suite. For the 29 CEC2017 functions across 10, 30, 50, and 100 dimensions, THRO achieves the slowest Friedman average ranking values among all competing methods, which are 2.052, 2.500, 2.293, and 2.259, respectively. Additionally, we conduct a comprehensive comparison with several advanced algorithms, including high-performance hybrid optimizers and the CEC winners, across the CEC2014, CEC2017, CEC2020, and CEC2022 suites, where THRO again achieves the slowest Friedman average ranking value of 1.729. Furthermore, six engineering design problems are employed to comprehensively check the applicability of THRO. Eventually, THRO’s proficiency extends to the application of identifying damping parameters of magnetorheological damper (MRD) models in mechanical systems. The results confirm that THRO exhibits remarkable competitiveness in solving various complex problems.The source code of THRO is publicly available at https://github.com/zwg770123/THRO.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 9","pages":""},"PeriodicalIF":13.9000,"publicationDate":"2025-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-025-11269-9.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-025-11269-9","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

In this study, we introduce a novel metaheuristic algorithm named Tianji’s horse racing optimization (THRO), inspired by the Chinese historical story of Tianji’s horse racing. The story illustrates how Tianji leveraged his strengths to counteract his opponent’s weaknesses, ultimately leading to his victory in the competition. This strategic principle, which led to Tianji’s victory, forms the foundation of THRO’s design. The need for such a proposal arises from the limitations of existing optimization algorithms, which often struggle with convergence speed and solution accuracy when solving complex problems. THRO addresses these challenges by employing a unique dynamic individual matching strategy that enhances the algorithm’s convergence rate and solution precision. In this algorithm, an effective greedy strategy is employed to maximize benefits by selecting individuals from its population and matching them with individuals from the opponent’s population, thereby facilitating individual updates. This paper provides mathematically grounded explanations and analysis of how the algorithm converges to the global optimum with probability 1. To validate the efficacy of THRO, comparative experiments with 12 popular algorithms are conducted on 23 classical benchmark functions and the CEC2017 test suite. For the 29 CEC2017 functions across 10, 30, 50, and 100 dimensions, THRO achieves the slowest Friedman average ranking values among all competing methods, which are 2.052, 2.500, 2.293, and 2.259, respectively. Additionally, we conduct a comprehensive comparison with several advanced algorithms, including high-performance hybrid optimizers and the CEC winners, across the CEC2014, CEC2017, CEC2020, and CEC2022 suites, where THRO again achieves the slowest Friedman average ranking value of 1.729. Furthermore, six engineering design problems are employed to comprehensively check the applicability of THRO. Eventually, THRO’s proficiency extends to the application of identifying damping parameters of magnetorheological damper (MRD) models in mechanical systems. The results confirm that THRO exhibits remarkable competitiveness in solving various complex problems.The source code of THRO is publicly available at https://github.com/zwg770123/THRO.

天津赛马优化:一种受古代智慧启发的元启发式算法及其工程优化应用
在本研究中,我们引入了一种新的元启发式算法,名为“天际赛马优化”(THRO),该算法的灵感来自于中国历史上的天际赛马故事。这个故事讲述了Tianji如何利用自己的优势来抵消对手的弱点,最终在比赛中获胜。这一战略原则为天津的胜利奠定了基础,也是THRO设计的基础。由于现有的优化算法在解决复杂问题时往往在收敛速度和求解精度方面存在局限性,因此需要提出这样的建议。THRO通过采用独特的动态个体匹配策略来解决这些挑战,从而提高了算法的收敛速度和求解精度。该算法采用了一种有效的贪婪策略,通过从自身种群中选择个体,并与对手种群中的个体进行匹配,实现利益最大化,从而促进个体更新。本文提供了基于数学的解释和分析算法如何以概率1收敛到全局最优。为了验证THRO的有效性,在23个经典基准函数和CEC2017测试套件上与12种流行算法进行了对比实验。对于10、30、50和100个维度的29个CEC2017函数,THRO在所有竞争方法中获得的弗里德曼平均排名值最慢,分别为2.052、2.500、2.293和2.259。此外,我们在CEC2014、CEC2017、CEC2020和CEC2022套件中,对几种高级算法(包括高性能混合优化器和CEC优胜者)进行了全面比较,其中THRO再次达到了最慢的弗里德曼平均排名值1.729。并通过6个工程设计问题对THRO的适用性进行了综合检验。最终,THRO的熟练程度扩展到在机械系统中识别磁流变阻尼器(MRD)模型的阻尼参数的应用。结果表明,THRO在解决各种复杂问题方面具有显著的竞争力。THRO的源代码可在https://github.com/zwg770123/THRO上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信