.png){kind=icon}
返回
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2020.3029748.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, a dynamic-neighborhood-based switching PSO (DNSPSO) algorithm is proposed, where a new velocity updating mechanism is designed to adjust the personal best position and the global best position according to a distance-based dynamic neighborhood to make full use of the population evolution information among the entire swarm. In addition, a novel switching learning strategy is introduced to adaptively select the acceleration coefficients and update the velocity model according to the searching state at each iteration, thereby contributing to a thorough search of the problem space. Furthermore, the differential evolution algorithm is successfully hybridized with the particle swarm optimization (PSO) algorithm to alleviate premature convergence. A series of commonly used benchmark functions (including unimodal, multimodal, and rotated multimodal cases) is utilized to comprehensively evaluate the performance of the DNSPSO algorithm. The experimental results demonstrate that the developed DNSPSO algorithm outperforms a number of existing PSO algorithms in terms of the solution accuracy and convergence performance, especially for complicated multimodal optimization problems.
Keyword:
Heuristic algorithms
Acceleration
Optimization
Convergence
Switches
Search problems
Topology
Differential evolution (DE)
dynamic neighborhood
particle swarm optimization (PSO)
switching strategy
topology
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏A Scalable Algorithm for Event-Triggered State Estimation With Unknown Parameters and Switching Topologies Over Sensor Networks传感器网络中具有未知参数和切换拓扑的事件触发状态估计的可扩展算法
PREAI
分享收藏Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
分享收藏
查看更多内容