Multi-modal multi-objective wolf pack algorithm with circumferential scouting and intra-niche interactions

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jia Zhao , Fujun Chen , Renbin Xiao , Runxiu Wu , Jeng-Shyang Pan , Hui Wang , Ivan Lee
{"title":"Multi-modal multi-objective wolf pack algorithm with circumferential scouting and intra-niche interactions","authors":"Jia Zhao ,&nbsp;Fujun Chen ,&nbsp;Renbin Xiao ,&nbsp;Runxiu Wu ,&nbsp;Jeng-Shyang Pan ,&nbsp;Hui Wang ,&nbsp;Ivan Lee","doi":"10.1016/j.swevo.2024.101842","DOIUrl":null,"url":null,"abstract":"<div><div>The multi-objective wolf pack algorithm faces issues in solving multi-modal multi-objective optimization problems, such as the dominance of high-performing individuals, excessive reliance on the lead wolf, and ineffective learning among certain individuals, which result in poor diversity and convergence. Therefore, this paper presents a multi-modal multi-objective wolf pack algorithm with circumferential scouting and intra-niche interactions (MMOWPA-CN). To enhance algorithm's local search capability, a circumferential scouting technique is proposed. It divides the subpopulation using two different non-dominated levels of individuals, allowing individuals within the subpopulation to search in all directions, thereby improving the exploration capability. To prevent population from generating aggregation phenomenon, the neighbourhood elite bootstrapping strategy is introduced. It utilizes the neighbourhood lead wolf and the historical optimal solutions stored in archive to constrain individual movements, guiding them toward sparser areas and ensuring decision space's diversity. Additionally, in the decision space, a mechanism of intra-niche interactions is designed to avoid ineffective learning among individuals on different fronts. It allows individuals to interact with each other with information in a restricted area, ensuring the convergence of the algorithm. Comparative experiments on 17 test functions and one practical application have shown that MMOWPA-CN outperforms seven state-of-the-art algorithms, demonstrating its stronger optimization capabilities.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"93 ","pages":"Article 101842"},"PeriodicalIF":8.2000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003808","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The multi-objective wolf pack algorithm faces issues in solving multi-modal multi-objective optimization problems, such as the dominance of high-performing individuals, excessive reliance on the lead wolf, and ineffective learning among certain individuals, which result in poor diversity and convergence. Therefore, this paper presents a multi-modal multi-objective wolf pack algorithm with circumferential scouting and intra-niche interactions (MMOWPA-CN). To enhance algorithm's local search capability, a circumferential scouting technique is proposed. It divides the subpopulation using two different non-dominated levels of individuals, allowing individuals within the subpopulation to search in all directions, thereby improving the exploration capability. To prevent population from generating aggregation phenomenon, the neighbourhood elite bootstrapping strategy is introduced. It utilizes the neighbourhood lead wolf and the historical optimal solutions stored in archive to constrain individual movements, guiding them toward sparser areas and ensuring decision space's diversity. Additionally, in the decision space, a mechanism of intra-niche interactions is designed to avoid ineffective learning among individuals on different fronts. It allows individuals to interact with each other with information in a restricted area, ensuring the convergence of the algorithm. Comparative experiments on 17 test functions and one practical application have shown that MMOWPA-CN outperforms seven state-of-the-art algorithms, demonstrating its stronger optimization capabilities.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信