Please wait a minute...
Frontiers of Electrical and Electronic Engineering

ISSN 2095-2732

ISSN 2095-2740(Online)

CN 10-1028/TM

Front. Electr. Electron. Eng.    2006, Vol. 1 Issue (1) : 99-104    https://doi.org/10.1007/s11460-005-0021-9
Particle Swarm Optimization with Adaptive Mutation
LU Zhen-su, HOU Zhi-rong, DU Juan
School of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China;
 Download: PDF(171 KB)  
 Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks
Abstract A new adaptive mutation particle swarm optimizer, which is based on the variance of the population's fitness, is presented in this paper. During the running time, the mutation probability for the current best particle is determined by two factors: the variance of the population's fitness and the current optimal solution. The ability of particle swarm optimization (PSO) algorithm to break away from the local optimum is greatly improved by the mutation. The experimental results show that the new algorithm not only has great advantage of convergence property over genetic algorithm and PSO, but can also avoid the premature convergence problem effectively.
Issue Date: 05 March 2006
 Cite this article:   
LU Zhen-su,HOU Zhi-rong,DU Juan. Particle Swarm Optimization with Adaptive Mutation[J]. Front. Electr. Electron. Eng., 2006, 1(1): 99-104.
 URL:  
https://academic.hep.com.cn/fee/EN/10.1007/s11460-005-0021-9
https://academic.hep.com.cn/fee/EN/Y2006/V1/I1/99
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed