返回
An improved particle swarm optimization with backtracking search optimization algorithm for solving continuous optimization problems
DOI:10.1007/s00366-021-01431-6.png)
摘要
En 中文
The particle swarm optimization (PSO) is a population-based stochastic optimization technique by the social behavior of bird flocking and fish schooling. The PSO has a high convergence rate. It is prone to losing diversity along the iterative optimization process and may get trapped into a poor local optimum. Overcoming these defects is still a significant problem in PSO applications. In contrast, the backtracking search optimization algorithm (BSA) has a robust global exploration ability, whereas, it has a low local exploitation ability and converges slowly. This paper proposed an improved PSO with BSA called PSOBSA to resolve the original PSO algorithm's problems that BSA's mutation and crossover operators were modified through the neighborhood to increase the convergence rate. In addition to that, a new mutation operator was introduced to improve the convergence accuracy and evade the local optimum. Several benchmark problems are used to test the performance and efficiency of the proposed PSOBSA. The experimental results show that PSOBSA outperforms other well-known metaheuristic algorithms and several state-of-the-art PSO variants in terms of global exploration ability and accuracy, and rate of convergence on almost all of the benchmark problems.
Keyword:
Particle swarm optimization
Backtracking search optimization algorithm
Solving continuous optimization problems
Hybridization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.7K
被引数:
1.0W
机构
引用论文
Intelligent identification and control using improved fuzzy particle swarm optimization基于改进模糊粒子群算法的智能辨识与控制
Design of backtracking search optimization paradigm for joint amplitude-angle measurement of sources lying in fraunhofer zone
MEASUREMENT
IF5.6

