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, Péricles B. C. Miranda, Utpal Nandi, Nanda Dulal Jana, Ujjwal Maulik, Saurav Mallik, 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.
期刊介绍:
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.