An Adaptive Particle Swarm Optimization Algorithm Based on Cloud Model

2010 ◽  
Vol 129-131 ◽  
pp. 612-616
Author(s):  
Jin Rong Zhu

In this paper, an adaptive particle swarm optimization algorithm based on cloud model (C-APSO) is proposed. In the suggested method, the velocities of the all particles are adjusted based on the strategy that a particle whose fitness value is nearer to the optimal particle will fly with smaller velocity. Considering the properties of randomness and stable tendency of a normal cloud model, a Y-conditional normal cloud generator is used to gain the inertial factors of the particles. The simulations of function optimization show that the proposed method has advantage of global convergence property and can effectively alleviate the problem of premature convergence.

2013 ◽  
Vol 760-762 ◽  
pp. 2194-2198 ◽  
Author(s):  
Xue Mei Wang ◽  
Yi Zhuo Guo ◽  
Gui Jun Liu

Adaptive Particle Swarm Optimization algorithm with mutation operation based on K-means is proposed in this paper, this algorithm Combined the local searching optimization ability of K-means with the gobal searching optimization ability of Particle Swarm Optimization, the algorithm self-adaptively adjusted inertia weight according to fitness variance of population. Mutation operation was peocessed for the poor performative particle in population. The results showed that the algorithm had solved the poblems of slow convergence speed of traditional Particle Swarm Optimization algorithm and easy falling into the local optimum of K-Means, and more effectively improved clustering quality.


2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.


Sign in / Sign up

Export Citation Format

Share Document