Impacts of Coefficients on Movement Patterns in the Particle Swarm Optimization Algorithm

被引:57
作者
Bonyadi, Mohammad Reza [1 ,2 ]
Michalewicz, Zbigniew [2 ,3 ,4 ,5 ]
机构
[1] Univ Queensland, Ctr Adv Imaging, St Lucia, Qld 4067, Australia
[2] Univ Adelaide, Optimisat & Logist Grp, Adelaide, SA 5005, Australia
[3] Complexica Pty Ltd, West Lakes, SA 5021, Australia
[4] Polish Japanese Acad Informat Technol, PL-02008 Warsaw, Poland
[5] Polish Acad Sci, Inst Comp Sci, PL-01237 Warsaw, Poland
基金
澳大利亚研究理事会;
关键词
Base frequency; correlation; particle swarm optimization (PSO); CONVERGENCE ANALYSIS; STABILITY;
D O I
10.1109/TEVC.2016.2605668
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
In this paper, we investigate movement patterns of a particle in the particle swarm optimization (PSO) algorithm. We characterize movement patterns of the particle by two factors: 1) the correlation between its consecutive positions and 2) its range of movement. We introduce the base frequency of movement as a measure for the correlation between positions and the variance of movement as a measure for the range of movement. We determine the base frequency and the variance of movement theoretically and we show how they change with the values of coefficients. We extract a system of equations that enables practitioners to find coefficients' values to guarantee achieving a given base frequency and variance of movement, i.e., control the movement pattern of particles. We also show that if the base frequency of movement for a particle is small, mid range, or large then the particle's position at each iteration is positively correlated (smooth movement), uncorrelated (chaotic movement), or negatively correlated (jumping at each iteration) with its previous positions, respectively. We test the effects of the base frequency and variance of movement on the search ability of particles and we show that small base frequencies (i.e., smooth movement) are more effective when the maximum number of function evaluations is large. We found that the most frequently-used coefficient values in PSO literature impose mid-range base frequencies that correspond with a chaotic movement. We also provide new sets of coefficients that outperform existing ones on a set of benchmark functions.
引用
收藏
页码:378 / 390
页数:13
相关论文
共 25 条
[1]
[Anonymous], 2014, Characterising continuous optimisation problems for particle swarm optimisation performance prediction
[2]
[Anonymous], IEEE T EVOL IN PRESS
[3]
Bolzano B., 1817, EWALD, V1, P225
[4]
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review [J].
Bonyadi, Mohammad Reza ;
Michalewicz, Zbigniew .
EVOLUTIONARY COMPUTATION, 2017, 25 (01) :1-54
[5]
Analysis of Stability, Local Convergence, and Transformation Sensitivity of a Variant of the Particle Swarm Optimization Algorithm [J].
Bonyadi, Mohammad Reza ;
Michalewicz, Zbigniew .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (03) :370-385
[6]
A locally convergent rotationally invariant particle swarm optimization algorithm [J].
Bonyadi, Mohammad Reza ;
Michalewicz, Zbigniew .
SWARM INTELLIGENCE, 2014, 8 (03) :159-198
[7]
Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[8]
The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[9]
Clerc M., 2006, Particle Swarm Optimization
[10]
Eberhart R., 2002, MHS95 P 6 INT S MICR, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]