基于直觉模糊熵和进化博弈论的自适应策略量子粒子群优化方法

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Guan Zhou, Zihao Fang, Yingxin Hu, Jintao Chen, Jinyu Ren
{"title":"基于直觉模糊熵和进化博弈论的自适应策略量子粒子群优化方法","authors":"Guan Zhou,&nbsp;Zihao Fang,&nbsp;Yingxin Hu,&nbsp;Jintao Chen,&nbsp;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,&nbsp;Zihao Fang,&nbsp;Yingxin Hu,&nbsp;Jintao Chen,&nbsp;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}
引用次数: 0

摘要

由于种群多样性过早下降是启发式算法优化中的重要问题,人们开发了许多增强全局搜索能力的方法来避免局部最优。然而,全局勘探策略分散了资源,降低了优化精度。为了在保证精度的同时保持探测能力,提出了一种基于直觉模糊熵(IFE)和进化博弈论(EGT)的自适应策略量子粒子群优化方法(ASQPSO)。首先,引入IFE对算法种群多样性进行量化。其次,本文提出了几种策略,并开发了一种基于EGT的算法结构,以提高勘探开发性能。最后,通过对比实验验证了ASQPSO的性能。在23个基准函数上的测试结果表明,该方法的综合性能优于比较算法。本文研究了定量调整QPSO方法多样性的可行方法,为其在启发式算法中的应用提供了参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: 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.
×
引用
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学术官方微信