ABSTRACT
Particle Swarm Optimization (J. Kennedy et al., 1995) was come up with Kennedy and Eberhartin 1995. The main method to resolve this problem is to gain the size of particle swarm, which there is some change in calculated performance, but there is also some lack: first, this method can not overcome the problem of premature convergence radically; second, this method will gain the calculated amount of algorithm. In case to this lack, many improved PSO algorithm is come out, for example Shi Yuhui and Eberhart (Shi Y et al., 2001) proposed a faintness PSO; according to the circumgyration stretch method combined with PSO algorithm change the form of the objective function, a global optimization algorithm was proposed by Konstantions Parsopolos, A et al.,); Ratnaweera (Ratnaweera, A et al.,) introduced time-varying acceleration constant and put forward variant time-varying particle swarm algorithm, self-organization hierarchical time-varying particle swarm algorithm and so on.
