An adaptive parameter tuning of particle swarm optimization algorithm

被引:173
作者
Xu, Gang [1 ]
机构
[1] Nan Chang Univ, Dept Math, Nanchang 330031, Peoples R China
关键词
Particle swarm optimization; Average absolute value of velocity; Nonlinear ideal velocity; Inertia weight; INERTIA; CONVERGENCE;
D O I
10.1016/j.amc.2012.10.067
中图分类号
O29 [应用数学];
学科分类号
070104 [应用数学];
摘要
An adaptive parameter tuning of particle swarm optimization based on velocity information (APSO-VI) algorithm is proposed. In this paper the velocity convergence of particles is first analyzed and the relationship between the velocity of particle and the search failures is pointed out, which reveals the reasons why PSO has relative poor global searching ability. Then this algorithm introduces the velocity information which is defined as the average absolute value of velocity of all the particles. A new strategy is presented that the inertia weight is dynamically adjusted according to average absolute value of velocity which follows a given nonlinear ideal velocity by feedback control, which can avoid the velocity closed to zero at the early stage. Under the guide of the nonlinear ideal velocity, APSO-VI can maintain appropriate swarm diversity and alleviate the premature convergence validly. Numerical experiments are conducted to compare the proposed algorithm with different variants of PSO on some benchmark functions. Experimental results show that the proposed algorithm remarkably improves the ability of PSO to jump out of the local optima and significantly enhance the convergence speed and precision. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:4560 / 4569
页数:10
相关论文
共 35 条
[1]
Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems [J].
Abd-El-Wahed, W. F. ;
Mousa, A. A. ;
El-Shorbagy, M. A. .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (05) :1446-1453
[2]
A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems [J].
Ali, MM ;
Khompatraporn, C ;
Zabinsky, ZB .
JOURNAL OF GLOBAL OPTIMIZATION, 2005, 31 (04) :635-672
[3]
Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[4]
On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems [J].
Arumugam, M. Senthil ;
Rao, M. V. C. .
APPLIED SOFT COMPUTING, 2008, 8 (01) :324-336
[5]
Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization [J].
Chatterjee, A ;
Siarry, P .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (03) :859-871
[6]
A novel particle swarm optimizer hybridized with extremal optimization [J].
Chen, Min-Rong ;
Li, Xia ;
Zhang, Xi ;
Lu, Yong-Zai .
APPLIED SOFT COMPUTING, 2010, 10 (02) :367-373
[7]
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
[8]
Eberhart R., 1995, MHS 95, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[9]
Particle swarm inspired optimization algorithm without velocity equation [J].
El-Sherbiny, Mahmoud Mostafa .
EGYPTIAN INFORMATICS JOURNAL, 2011, 12 (01) :1-8
[10]
A decreasing inertia weight particle swarm optimizer [J].
Fan, Shu-Kai S. ;
Chiu, Yi-Yin .
ENGINEERING OPTIMIZATION, 2007, 39 (02) :203-228