Particle Swarm Optimization Algorithm Based on Velocity DifferentialMutation
To deal with the problem of premature local convergence, slow search speed and low convergence accuracy in the late evolutionary, this paper proposes a particle swarm optimization algorithm based on velocity differential mutation (VDMPSO).Firstly, The cause of local convergence in the basic PSO algorithm is elaborated. Secondly, strategies of direct mutation for the particle velocity rather than the traditional particle position with differential evolution algorithm based on analying the relations of the particle velocity and the population diversity is introduced to improve the ability of effectively breaking away from the local optimum. By adding the mutation operation to the basic PSO algorithm, the proposed algorithm can maintain the characteristic of fast speed. Finally, the signficant performances in quality of the optimal solutions, the global search ability and convergence speed of algorithm proposed in this paper are validated by optimizing four benchmark functions.
Particle Swarm Optimization Differential Evolution Velocity Mutation Global Optimization
Shanhe Jiang Qishen Wang Julang Jiang
Department of Physics and Power Engineering, Anqing Normal College, Anqing 246011,China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
1860-1865
2009-06-17(万方平台首次上网日期,不代表论文的发表时间)