DocumentCode
1731664
Title
The study on dynamic population size improvements for classical particle swarm optimization
Author
Lei, Chen
Author_Institution
Basic Courses Teaching Dept., Chinese People´´s Armed Police Force Acad., Langfang, China
Volume
1
fYear
2011
Firstpage
430
Lastpage
433
Abstract
In this work we presented two dynamic population size improvements for the classical PSO. EP-PSO started with a small number of particles and increased the number of particles dynamically by iteratively duplicating the updated particles. DP-PSO started with a large number of particles then reduced the number by dropping the worst performing half iteratively. Both EP-PSO and DP-PSO reduced the execution time by 60% on average compared to the classical PSO. EP-PSO fared quite badly when convergence rate and convergence ability to the global optimum was considered. On the other hand, DP-PSO performed reasonably well compared to the classical PSO but at a much faster convergence and execution speed.
Keywords
demography; iterative methods; particle swarm optimisation; DP-PSO; EP-PSO; classical particle swarm optimization; convergence rate; dynamic population size improvements; iterative duplication; Convergence; Heuristic algorithms; History; Optimization; Particle swarm optimization; Space exploration; dynamic population size; optimization; particle swarm optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4577-1586-0
Type
conf
DOI
10.1109/ICCSNT.2011.6181991
Filename
6181991
Link To Document