基于区域多向搜索的大规模多目标竞争性蜂群优化算法

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xuenan Zhang, Debao Chen, Fangzhen Ge, Feng Zou, Lin Cui
{"title":"基于区域多向搜索的大规模多目标竞争性蜂群优化算法","authors":"Xuenan Zhang, Debao Chen, Fangzhen Ge, Feng Zou, Lin Cui","doi":"10.1007/s40747-024-01616-8","DOIUrl":null,"url":null,"abstract":"<p>Competitive swarm optimizer (CSO) based on multidirectional search plays a crucial role in addressing large-scale multiobjective optimization problems (LSMOPs). However, relying solely on uniform or cluster partitioning of the objective space for sampling, along with two search directions constructed with upper and lower boundaries of global variables, sometimes lacks consideration of regional information. This results in an inefficient search and hinders the global convergence of the algorithm. To solve these problems, this study proposes a large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search (AMSLMOEA). Firstly, an adaptive objective space partitioning method based on the evolutionary state of the population is designed to enhance the adaptability of partitioning. Secondly, an individual multidirectional search strategy is introduced. Considering the algorithm’s computational complexity, the strategy selects the optimal individual within each subregion and constructs four-directional search vectors based on the lower limit of the global decision variables and the upper limit of the individual decision variables within the subregion. To validate the effectiveness of AMSLMOEA, the performance is tested on four benchmark function sets. The results demonstrate that AMSLMOEA outperforms the vast majority of the compared algorithms in terms of the IGD and HV metrics.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"7 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search\",\"authors\":\"Xuenan Zhang, Debao Chen, Fangzhen Ge, Feng Zou, Lin Cui\",\"doi\":\"10.1007/s40747-024-01616-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Competitive swarm optimizer (CSO) based on multidirectional search plays a crucial role in addressing large-scale multiobjective optimization problems (LSMOPs). However, relying solely on uniform or cluster partitioning of the objective space for sampling, along with two search directions constructed with upper and lower boundaries of global variables, sometimes lacks consideration of regional information. This results in an inefficient search and hinders the global convergence of the algorithm. To solve these problems, this study proposes a large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search (AMSLMOEA). Firstly, an adaptive objective space partitioning method based on the evolutionary state of the population is designed to enhance the adaptability of partitioning. Secondly, an individual multidirectional search strategy is introduced. Considering the algorithm’s computational complexity, the strategy selects the optimal individual within each subregion and constructs four-directional search vectors based on the lower limit of the global decision variables and the upper limit of the individual decision variables within the subregion. To validate the effectiveness of AMSLMOEA, the performance is tested on four benchmark function sets. The results demonstrate that AMSLMOEA outperforms the vast majority of the compared algorithms in terms of the IGD and HV metrics.</p>\",\"PeriodicalId\":10524,\"journal\":{\"name\":\"Complex & Intelligent Systems\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex & Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s40747-024-01616-8\",\"RegionNum\":2,\"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":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01616-8","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

基于多向搜索的竞争群优化器(CSO)在解决大规模多目标优化问题(LSMOPs)中发挥着至关重要的作用。然而,仅仅依靠对目标空间进行均匀或聚类划分来进行采样,以及利用全局变量的上下限构建两个搜索方向,有时会缺乏对区域信息的考虑。这会导致搜索效率低下,并阻碍算法的全局收敛。为了解决这些问题,本研究提出了一种基于区域多向搜索的大规模多目标竞争性蜂群优化算法(AMSLMOEA)。首先,设计了一种基于种群进化状态的自适应目标空间划分方法,以增强划分的适应性。其次,引入了个体多向搜索策略。考虑到算法的计算复杂性,该策略在每个子区域内选择最优个体,并根据全局决策变量的下限和子区域内个体决策变量的上限构建四向搜索向量。为了验证 AMSLMOEA 的有效性,对四个基准函数集进行了性能测试。结果表明,就 IGD 和 HV 指标而言,AMSLMOEA 优于绝大多数比较过的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search

Competitive swarm optimizer (CSO) based on multidirectional search plays a crucial role in addressing large-scale multiobjective optimization problems (LSMOPs). However, relying solely on uniform or cluster partitioning of the objective space for sampling, along with two search directions constructed with upper and lower boundaries of global variables, sometimes lacks consideration of regional information. This results in an inefficient search and hinders the global convergence of the algorithm. To solve these problems, this study proposes a large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search (AMSLMOEA). Firstly, an adaptive objective space partitioning method based on the evolutionary state of the population is designed to enhance the adaptability of partitioning. Secondly, an individual multidirectional search strategy is introduced. Considering the algorithm’s computational complexity, the strategy selects the optimal individual within each subregion and constructs four-directional search vectors based on the lower limit of the global decision variables and the upper limit of the individual decision variables within the subregion. To validate the effectiveness of AMSLMOEA, the performance is tested on four benchmark function sets. The results demonstrate that AMSLMOEA outperforms the vast majority of the compared algorithms in terms of the IGD and HV metrics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
×
引用
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学术官方微信