DocumentCode
3391490
Title
Elite Particle Swarm Optimization with mutation
Author
Jiao Wei ; Liu Guangbin ; Liu Dong
Author_Institution
Xian Res. Inst. of Hi-Tech, Xi´an
fYear
2008
fDate
10-12 Oct. 2008
Firstpage
800
Lastpage
803
Abstract
An improved algorithm for Particle Swarm Optimization (PSO) named Elite Particle Swarm Optimization with Mutation (EPSOM) is proposed in this paper. Elite particles and bad particles are distinguished from the swarm after some initial iteration steps. Bad particles are replaced with the same number of elite particles, and a new swarm is generated. To avoid losing diversity of the swarm and to decrease the risk of trapping in local optimum, mutation operation is introduced in evolution process. The results of several simulations for different benchmark functions illustrate that EPSOM algorithm has the ability of local exploitation and global exploration. EPSOM algorithm outperforms the Linearly Decreasing Weight Particle Swarm Optimization (LDW-PSO) and Random Mutation Particle Swarm Optimization (RM-PSO) in respects of calculation accuracy and convergence.
Keywords
particle swarm optimisation; elite particle swarm optimization; evolution process; linearly decreasing weight particle swarm optimization; mutation; random mutation particle swarm optimization; trapping; Accuracy; Algorithm design and analysis; Benchmark testing; Birds; Computational modeling; Convergence; Evolutionary computation; Genetic mutations; Particle swarm optimization; Performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
System Simulation and Scientific Computing, 2008. ICSC 2008. Asia Simulation Conference - 7th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-1786-5
Electronic_ISBN
978-1-4244-1787-2
Type
conf
DOI
10.1109/ASC-ICSC.2008.4675471
Filename
4675471
Link To Document