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 , Yingjie Song , Hongjiang Ma , Xiangbing Zhou , 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":8.1000,"publicationDate":"2025-03-05","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":"","PubModel":"","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.
期刊介绍:
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.