DocumentCode
2815056
Title
A naive Particle Swarm Optimization
Author
Jin Qin ; Zhenjun Liang
Author_Institution
Coll. of Comput. Sci. & Inf., Guizhou Univ., Guiyang, China
fYear
2012
fDate
10-15 June 2012
Firstpage
1
Lastpage
8
Abstract
Since the proposal of Particle Swarm Optimization (PSO), there have been many improvements of PSO which have not change the basic paradigm of PSO involving pattern of movement of particles, update mode of particles and algorithm framework. Instead of another improvement of PSO, a novel paradigm of PSO with more natural and simpler forms, called naive PSO, is proposed, based on a slightly different social metaphor from that of the original PSO: each particle learns from better one in the swarm and takes warning from worse one in the swarm. In the naive PSO, pattern of movement and mode of update of particles differing from that in the original PSO is introduced. After an algorithm framework is presented, stochastic parameter analysis is also carried out. Preliminary computational experiences show that the naive PSO has a competitive performance over the standard PSO. And then two modifications of the naive PSO are devised. Combining the two modifications, the improved naive PSO shows significantly superior performance over the standard PSO and competitive performance over differential evolution.
Keywords
particle swarm optimisation; stochastic processes; competitive performance; naive PSO; naive particle swarm optimization; particle movement pattern; social metaphor; stochastic parameter analysis; Algorithm design and analysis; Benchmark testing; Birds; Equations; Mathematical model; Particle swarm optimization; Standards; benchmark; paradigm of optimization; particle swarm optimization; social metaphor;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location
Brisbane, QLD
Print_ISBN
978-1-4673-1510-4
Electronic_ISBN
978-1-4673-1508-1
Type
conf
DOI
10.1109/CEC.2012.6256124
Filename
6256124
Link To Document