{"title":"基于直觉模糊熵和进化博弈论的自适应策略量子粒子群优化方法","authors":"Guan Zhou, Zihao Fang, Yingxin Hu, Jintao Chen, Jinyu Ren","doi":"10.1016/j.asoc.2025.113654","DOIUrl":null,"url":null,"abstract":"<div><div>Since premature decline in population diversity is a vital problem in heuristic algorithm optimization, numerous methods enhancing global search ability have been developed to avoid local optimum. However, global exploration strategy diverts resources from exploitation, reducing optimization accuracy. To maintain exploration ability while ensuring accuracy, an adaptive strategy quantum particle swarm optimization method (ASQPSO) based on intuitionistic fuzzy entropy (IFE) and evolutionary game theory (EGT) is proposed in this paper. Firstly, IFE is introduced to quantify algorithm population diversity. Next, this paper proposes several strategies and develops an algorithm structure based on EGT to improve exploration and exploitation performance. Finally, comparison experiments are conducted to verify the performance of ASQPSO. Test results on 23 benchmark functions indicate that the proposed method has better comprehensive performance than the comparison algorithms. This paper researches a feasible way to adjust the diversity of the QPSO method quantitatively and provides a reference for its application in the heuristic algorithms.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"183 ","pages":"Article 113654"},"PeriodicalIF":7.2000,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An adaptive strategy quantum particle swarm optimization method based on intuitionistic fuzzy entropy and evolutionary game theory\",\"authors\":\"Guan Zhou, Zihao Fang, Yingxin Hu, Jintao Chen, Jinyu Ren\",\"doi\":\"10.1016/j.asoc.2025.113654\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Since premature decline in population diversity is a vital problem in heuristic algorithm optimization, numerous methods enhancing global search ability have been developed to avoid local optimum. However, global exploration strategy diverts resources from exploitation, reducing optimization accuracy. To maintain exploration ability while ensuring accuracy, an adaptive strategy quantum particle swarm optimization method (ASQPSO) based on intuitionistic fuzzy entropy (IFE) and evolutionary game theory (EGT) is proposed in this paper. Firstly, IFE is introduced to quantify algorithm population diversity. Next, this paper proposes several strategies and develops an algorithm structure based on EGT to improve exploration and exploitation performance. Finally, comparison experiments are conducted to verify the performance of ASQPSO. Test results on 23 benchmark functions indicate that the proposed method has better comprehensive performance than the comparison algorithms. This paper researches a feasible way to adjust the diversity of the QPSO method quantitatively and provides a reference for its application in the heuristic algorithms.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"183 \",\"pages\":\"Article 113654\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625009652\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625009652","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
An adaptive strategy quantum particle swarm optimization method based on intuitionistic fuzzy entropy and evolutionary game theory
Since premature decline in population diversity is a vital problem in heuristic algorithm optimization, numerous methods enhancing global search ability have been developed to avoid local optimum. However, global exploration strategy diverts resources from exploitation, reducing optimization accuracy. To maintain exploration ability while ensuring accuracy, an adaptive strategy quantum particle swarm optimization method (ASQPSO) based on intuitionistic fuzzy entropy (IFE) and evolutionary game theory (EGT) is proposed in this paper. Firstly, IFE is introduced to quantify algorithm population diversity. Next, this paper proposes several strategies and develops an algorithm structure based on EGT to improve exploration and exploitation performance. Finally, comparison experiments are conducted to verify the performance of ASQPSO. Test results on 23 benchmark functions indicate that the proposed method has better comprehensive performance than the comparison algorithms. This paper researches a feasible way to adjust the diversity of the QPSO method quantitatively and provides a reference for its application in the heuristic algorithms.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.