IEEE Trans Cybern. 2021 Feb;51(2):1085-1093. doi: 10.1109/TCYB.2019.2925015. Epub 2021 Jan 15.
In this paper, a novel particle swarm optimization (PSO) algorithm is put forward where a sigmoid-function-based weighting strategy is developed to adaptively adjust the acceleration coefficients. The newly proposed adaptive weighting strategy takes into account both the distances from the particle to the global best position and from the particle to its personal best position, thereby having the distinguishing feature of enhancing the convergence rate. Inspired by the activation function of neural networks, the new strategy is employed to update the acceleration coefficients by using the sigmoid function. The search capability of the developed adaptive weighting PSO (AWPSO) algorithm is comprehensively evaluated via eight well-known benchmark functions including both the unimodal and multimodal cases. The experimental results demonstrate that the designed AWPSO algorithm substantially improves the convergence rate of the particle swarm optimizer and also outperforms some currently popular PSO algorithms.
本文提出了一种新的粒子群优化(PSO)算法,其中开发了一种基于 sigmoid 函数的加权策略来自适应调整加速度系数。新提出的自适应加权策略考虑了粒子到全局最优位置的距离和粒子到其个人最优位置的距离,因此具有提高收敛速度的特点。受神经网络激活函数的启发,新策略使用 sigmoid 函数来更新加速度系数。通过八个著名的基准函数(包括单峰和多峰情况)对所开发的自适应加权粒子群优化(AWPSO)算法的搜索能力进行了全面评估。实验结果表明,所设计的 AWPSO 算法大大提高了粒子群优化算法的收敛速度,并且优于一些当前流行的 PSO 算法。