A multiple level competitive swarm optimizer based on dual evaluation criteria and global optimization for large-scale optimization problem

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-08-01 Epub Date: 2025-03-05 DOI:10.1016/j.ins.2025.122068
Chen Huang , Yingjie Song , Hongjiang Ma , Xiangbing Zhou , Wu Deng
{"title":"A multiple level competitive swarm optimizer based on dual evaluation criteria and global optimization for large-scale optimization problem","authors":"Chen Huang ,&nbsp;Yingjie Song ,&nbsp;Hongjiang Ma ,&nbsp;Xiangbing Zhou ,&nbsp;Wu Deng","doi":"10.1016/j.ins.2025.122068","DOIUrl":null,"url":null,"abstract":"<div><div>Large-scale optimization problems (LSOPs) in science and technology bring great challenges to the performance of algorithms. Although Competitive swarm optimizer (CSO) is an effective method, some shortcomings still exist when handling LSOPs, such as premature convergence. Therefore, a novel multiple level CSO with dual evaluation criteria and global optimization (DEGMCSO) is proposed to seek optimal solutions of LSOPs. In this paper, dual evaluation criteria are inserted into the multiple comparison process of the losers and winners to assist the algorithm retain more high quality particles with the potential. In addition to fitness values, adaptive selection weight fitness-distance is designed as the other criterion for selecting winners and losers according to different optimization problems. Meanwhile, a simple global optimal modification strategy is employed to get high quality global best solution. By CEC2010 and CEC2013 function suits, the results indicate DEGMCSO outperforms some popular algorithms. Finally, DEGMCSO is applied to feather selection problems of high dimension classification in the real world. The simulation results show that compared with the original CSO algorithm, DEGMCSO can find the solution of 16 functions on CEC2010 test function set which is obviously better than the CSO algorithm.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"708 ","pages":"Article 122068"},"PeriodicalIF":6.8000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525002002","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/5 0:00:00","PubModel":"Epub","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Large-scale optimization problems (LSOPs) in science and technology bring great challenges to the performance of algorithms. Although Competitive swarm optimizer (CSO) is an effective method, some shortcomings still exist when handling LSOPs, such as premature convergence. Therefore, a novel multiple level CSO with dual evaluation criteria and global optimization (DEGMCSO) is proposed to seek optimal solutions of LSOPs. In this paper, dual evaluation criteria are inserted into the multiple comparison process of the losers and winners to assist the algorithm retain more high quality particles with the potential. In addition to fitness values, adaptive selection weight fitness-distance is designed as the other criterion for selecting winners and losers according to different optimization problems. Meanwhile, a simple global optimal modification strategy is employed to get high quality global best solution. By CEC2010 and CEC2013 function suits, the results indicate DEGMCSO outperforms some popular algorithms. Finally, DEGMCSO is applied to feather selection problems of high dimension classification in the real world. The simulation results show that compared with the original CSO algorithm, DEGMCSO can find the solution of 16 functions on CEC2010 test function set which is obviously better than the CSO algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于双评价准则和全局优化的大规模优化问题多级竞争群优化器
科学技术中的大规模优化问题(lsop)对算法的性能提出了很大的挑战。竞争群优化算法(CSO)是一种有效的算法,但在处理lsop时仍存在一些不足,如早熟收敛。为此,提出了一种新的具有双评价准则和全局优化的多级CSO (DEGMCSO)来寻求lsop的最优解。本文在输家和赢家的多重比较过程中引入了双重评价准则,以帮助算法保留更多有潜力的优质粒子。除了适应度值外,还根据不同的优化问题设计了自适应选择权值适应度距离作为选择优胜者和失败者的另一个准则。同时,采用简单的全局最优修正策略,得到高质量的全局最优解。通过对CEC2010和CEC2013的函数匹配,结果表明DEGMCSO优于一些流行的算法。最后,将DEGMCSO应用于现实世界中的高维分类羽毛选择问题。仿真结果表明,与原有的CSO算法相比,DEGMCSO算法可以在CEC2010测试函数集上找到16个函数的解,明显优于CSO算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Matrix-based incremental reduction in neighborhood covering decision information systems Cross-chain identity privacy protection scheme based on oblivious transfer protocol and key agreement The subgraph eigenvector centrality of graphs Collaborative neurodynamic approach on multi-objective optimization of wind power systems Research on pricing Asian carbon options for an uncertain exponential Ornstein-Uhlenbeck model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1