针对大规模优化问题的具有动态多重竞争和收敛加速器的竞争群优化器

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
{"title":"针对大规模优化问题的具有动态多重竞争和收敛加速器的竞争群优化器","authors":"","doi":"10.1016/j.asoc.2024.112252","DOIUrl":null,"url":null,"abstract":"<div><div>Large-scale optimizations (LSOPs) with high dimensional decision variables have become one of the most challenging problems in engineering optimization. High dimensional information causes serious interference to the algorithm optimization performance. The optimization performance of the algorithms will be seriously degraded. Competitive swarm optimizer (CSO) is a robust algorithm to tackle LSOPs. However, CSO randomly selects two particles to compare, then generates the winner and the loser. Although this search mechanism can enhance the diversity of the swarm, a single comparison is difficult to guarantee the quality of winners and losers. Therefore, there exists a risk of producing unqualified solutions. In order to enhance the quality of solution, a novel CSO with dynamic multi-competitions and convergence accelerator, namely DMCACSO, is designed in this paper. In the DMCACSO, a dynamic multi-competitions based evolutionary information is designed to pick out the losers more efficiently and improve the quality of winners. In addition, a convergence accelerator with hybrid evolutionary strategy is developed to speed up the particle search when the algorithm is a state of stagnation. The experiment results in solving large-scale benchmark functions from CEC2010 and CEC2013 indicate that the DMCACSO has competitive optimization performance by comparing with some state-of-the-art algorithms. Finally, the DMCACSO is effective in terms of quality in solving an actual feature selection problem.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Competitive swarm optimizer with dynamic multi-competitions and convergence accelerator for large-scale optimization problems\",\"authors\":\"\",\"doi\":\"10.1016/j.asoc.2024.112252\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Large-scale optimizations (LSOPs) with high dimensional decision variables have become one of the most challenging problems in engineering optimization. High dimensional information causes serious interference to the algorithm optimization performance. The optimization performance of the algorithms will be seriously degraded. Competitive swarm optimizer (CSO) is a robust algorithm to tackle LSOPs. However, CSO randomly selects two particles to compare, then generates the winner and the loser. Although this search mechanism can enhance the diversity of the swarm, a single comparison is difficult to guarantee the quality of winners and losers. Therefore, there exists a risk of producing unqualified solutions. In order to enhance the quality of solution, a novel CSO with dynamic multi-competitions and convergence accelerator, namely DMCACSO, is designed in this paper. In the DMCACSO, a dynamic multi-competitions based evolutionary information is designed to pick out the losers more efficiently and improve the quality of winners. In addition, a convergence accelerator with hybrid evolutionary strategy is developed to speed up the particle search when the algorithm is a state of stagnation. The experiment results in solving large-scale benchmark functions from CEC2010 and CEC2013 indicate that the DMCACSO has competitive optimization performance by comparing with some state-of-the-art algorithms. Finally, the DMCACSO is effective in terms of quality in solving an actual feature selection problem.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-09-19\",\"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/S1568494624010263\",\"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/S1568494624010263","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

具有高维决策变量的大规模优化(LSOP)已成为工程优化领域最具挑战性的问题之一。高维信息对算法优化性能造成严重干扰。算法的优化性能将严重下降。竞争群优化器(CSO)是解决 LSOPs 的一种稳健算法。不过,CSO 是随机选择两个粒子进行比较,然后产生胜者和败者。虽然这种搜索机制可以增强蜂群的多样性,但单次比较很难保证胜者和败者的质量。因此,存在产生不合格解决方案的风险。为了提高解的质量,本文设计了一种具有动态多重竞争和收敛加速器的新型 CSO,即 DMCACSO。在 DMCACSO 中,设计了一种基于动态多重竞争的进化信息,以更有效地挑选出失败者,并提高获胜者的质量。此外,还开发了混合进化策略的收敛加速器,以在算法处于停滞状态时加速粒子搜索。在求解 CEC2010 和 CEC2013 大型基准函数的实验结果表明,与一些最先进的算法相比,DMCACSO 具有极具竞争力的优化性能。最后,DMCACSO 在解决实际的特征选择问题时具有良好的质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Competitive swarm optimizer with dynamic multi-competitions and convergence accelerator for large-scale optimization problems
Large-scale optimizations (LSOPs) with high dimensional decision variables have become one of the most challenging problems in engineering optimization. High dimensional information causes serious interference to the algorithm optimization performance. The optimization performance of the algorithms will be seriously degraded. Competitive swarm optimizer (CSO) is a robust algorithm to tackle LSOPs. However, CSO randomly selects two particles to compare, then generates the winner and the loser. Although this search mechanism can enhance the diversity of the swarm, a single comparison is difficult to guarantee the quality of winners and losers. Therefore, there exists a risk of producing unqualified solutions. In order to enhance the quality of solution, a novel CSO with dynamic multi-competitions and convergence accelerator, namely DMCACSO, is designed in this paper. In the DMCACSO, a dynamic multi-competitions based evolutionary information is designed to pick out the losers more efficiently and improve the quality of winners. In addition, a convergence accelerator with hybrid evolutionary strategy is developed to speed up the particle search when the algorithm is a state of stagnation. The experiment results in solving large-scale benchmark functions from CEC2010 and CEC2013 indicate that the DMCACSO has competitive optimization performance by comparing with some state-of-the-art algorithms. Finally, the DMCACSO is effective in terms of quality in solving an actual feature selection problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:481959085
Book学术官方微信