DocumentCode
3344594
Title
Particle Swarm Optimization with Dynamic Inertia Weight and Mutation
Author
Liu, Xuedan ; Wang, Qiang ; Liu, Haiyan ; Li, Lili
Author_Institution
Coll. of Comput. Sci. & Inf. Eng., Guangxi Normal Univ., Guilin, China
fYear
2009
fDate
14-17 Oct. 2009
Firstpage
620
Lastpage
623
Abstract
The Particle Swarm Optimization (PSO) plunges into the local minimum easily. In order to overcome this shortcoming, we propose an improved PSO algorithm with the features of linearly decreasing of inertia weight and the re-initialization of the particle when it gets stagnated. The improved PSO is a local PSO and its topology is wheels. From the experimental results of three non-linear testing functions and a problem with non-convex solution space, it is obvious that the improved PSO algorithm greatly enhances the rate of global convergence.
Keywords
convergence; nonlinear functions; particle swarm optimisation; dynamic inertia weight; global convergence; local minimum; nonconvex solution space; nonlinear testing functions; particle swarm optimization; Computer science; Educational institutions; Equations; Genetic engineering; Genetic mutations; Particle swarm optimization; Physics computing; Testing; Topology; Wheels; constrained layout optimization; convergence rate; inertia weight; particle swarm optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on
Conference_Location
Guilin
Print_ISBN
978-0-7695-3899-0
Type
conf
DOI
10.1109/WGEC.2009.99
Filename
5402758
Link To Document