QSHO: Quantum spotted hyena optimizer for global optimization

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Tapas Si, Péricles B. C. Miranda, Utpal Nandi, Nanda Dulal Jana, Ujjwal Maulik, Saurav Mallik, Mohd Asif Shah
{"title":"QSHO: Quantum spotted hyena optimizer for global optimization","authors":"Tapas Si,&nbsp;Péricles B. C. Miranda,&nbsp;Utpal Nandi,&nbsp;Nanda Dulal Jana,&nbsp;Ujjwal Maulik,&nbsp;Saurav Mallik,&nbsp;Mohd Asif Shah","doi":"10.1007/s10462-024-11072-y","DOIUrl":null,"url":null,"abstract":"<div><p>Spotted Hyena Optimizer (SHO) is a population-based metaheuristic algorithm inspired by the spotted hyenas’ social behavior, and it has been developed to solve global optimization problems. SHO has shown superior performance over its competitive metaheuristic algorithms in solving benchmark function optimization and engineering design problems. However, it suffers from getting stuck in local optima due to its lack of exploration while solving multi-modal optimization problems. This article proposes an improved SHO, quantum SHO (QSHO), inspired by quantum computing. The QSHO implements a quantum computing mechanism to promote its exploration ability. The novel method is tested on well-known IEEE CEC2013 and IEEE CEC2017 benchmark suits with 30 and 50 dimensions and four real-world engineering optimization problems. The results of QSHO are compared with that of Classical SHO, improved SHO (ISHO), Modified SHO (MSHO), Oppositional SHO with mutation operator (OBL-MO-SHO), SHO with space transformation search (STS-SHO), Quantum Salp Swarm Algorithm (QSSA), and Chimp Optimization Algorithm (ChOA). The results are analyzed using the Wilcoxon Signed Rank Test (WSRT) and Friedman Test. The empirical results show that QSHO statistically outperforms other compared algorithms for benchmark problem suits with 30 and 50 dimensions. According to Friedman Test statistics, the QSHO algorithm ranked first and second in solving CEC2013 30D and 50D, respectively, whereas it ranked first in both solving CEC2017 30D and 50D. In addition, we have assessed the QSHO in four real-world engineering optimization problems, and the QSHO statistically outperforms the competitive algorithms.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 3","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11072-y.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11072-y","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

Spotted Hyena Optimizer (SHO) is a population-based metaheuristic algorithm inspired by the spotted hyenas’ social behavior, and it has been developed to solve global optimization problems. SHO has shown superior performance over its competitive metaheuristic algorithms in solving benchmark function optimization and engineering design problems. However, it suffers from getting stuck in local optima due to its lack of exploration while solving multi-modal optimization problems. This article proposes an improved SHO, quantum SHO (QSHO), inspired by quantum computing. The QSHO implements a quantum computing mechanism to promote its exploration ability. The novel method is tested on well-known IEEE CEC2013 and IEEE CEC2017 benchmark suits with 30 and 50 dimensions and four real-world engineering optimization problems. The results of QSHO are compared with that of Classical SHO, improved SHO (ISHO), Modified SHO (MSHO), Oppositional SHO with mutation operator (OBL-MO-SHO), SHO with space transformation search (STS-SHO), Quantum Salp Swarm Algorithm (QSSA), and Chimp Optimization Algorithm (ChOA). The results are analyzed using the Wilcoxon Signed Rank Test (WSRT) and Friedman Test. The empirical results show that QSHO statistically outperforms other compared algorithms for benchmark problem suits with 30 and 50 dimensions. According to Friedman Test statistics, the QSHO algorithm ranked first and second in solving CEC2013 30D and 50D, respectively, whereas it ranked first in both solving CEC2017 30D and 50D. In addition, we have assessed the QSHO in four real-world engineering optimization problems, and the QSHO statistically outperforms the competitive algorithms.

QSHO:用于全局优化的量子斑点鬣狗优化器
斑点鬣狗优化器(spot Hyena Optimizer, SHO)是一种基于种群的元启发式算法,它是受斑点鬣狗社会行为的启发而发展起来的,用于解决全局优化问题。在解决基准函数优化和工程设计问题方面,SHO算法表现出优于同类竞争算法的性能。但在求解多模态优化问题时,由于缺乏探索性,易陷入局部最优。受量子计算的启发,本文提出了一种改进的SHO——量子SHO (QSHO)。QSHO实现了量子计算机制,以提高其探索能力。该方法在知名的IEEE CEC2013和IEEE CEC2017基准套件上分别进行了30维和50维的测试,并对四个实际工程优化问题进行了测试。将QSHO算法与经典SHO算法、改进SHO算法(ISHO)、改进SHO算法(MSHO)、带突变算子的对位SHO算法(OBL-MO-SHO)、带空间变换搜索的SHO算法(STS-SHO)、量子Salp群算法(QSSA)和黑猩猩优化算法(ChOA)的结果进行了比较。使用Wilcoxon sign Rank检验(WSRT)和Friedman检验对结果进行分析。实证结果表明,对于30维和50维的基准问题集,QSHO在统计上优于其他比较算法。根据Friedman Test统计,QSHO算法在求解CEC2013 30D和50D方面分别排名第一和第二,而在求解CEC2017 30D和50D方面均排名第一。此外,我们在四个实际工程优化问题中对QSHO进行了评估,QSHO在统计上优于竞争算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信