Particle Swarm Optimization with Directed Mutation
In the standard particle swarm optimization（SPSO）,the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate premature convergence problem,this paper presents a new algorithm,which is called pa...
Saved in:
| Published in | 东华大学学报（英文版） Vol. 33; no. 5; pp. 774 - 780 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
School of Electrical Engineering, Zhengzhou University, Zhengzhou 450001, China%College of Electrical Engineering, Zhengzhou University, Zhengzhou 450001, China
31.10.2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1672-5220 |
Cover
| Summary: | In the standard particle swarm optimization（SPSO）,the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate premature convergence problem,this paper presents a new algorithm,which is called particle swarm optimization（PSO） with directed mutation,or DMPSO.The main idea of this algorithm is to ＂let the best particle（the smallest fitness of the particle swarm） become more excellent and the worst particle（the largest fitness of the particle swarm） try to be excellent＂.The new algorithm is tested on a set of eight benchmark functions,and compared with those of other four PSO variants.The experimental results illustrate the effectiveness and efficiency of the DMPSO.The comparisons show that DMPSO significantly improves the performance of PSO and searching accuracy. |
|---|---|
| Bibliography: | In the standard particle swarm optimization（SPSO）,the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate premature convergence problem,this paper presents a new algorithm,which is called particle swarm optimization（PSO） with directed mutation,or DMPSO.The main idea of this algorithm is to ＂let the best particle（the smallest fitness of the particle swarm） become more excellent and the worst particle（the largest fitness of the particle swarm） try to be excellent＂.The new algorithm is tested on a set of eight benchmark functions,and compared with those of other four PSO variants.The experimental results illustrate the effectiveness and efficiency of the DMPSO.The comparisons show that DMPSO significantly improves the performance of PSO and searching accuracy. 31-1920/N WANG Jie 1, LI Hong-wen 2.（ 1 School of Electrical Engineering, Zhengzhou University, Zhengzhou 450001, China; 2 College of Electrical Engineering, Zhengzhou University, Zhengzhou 450001, China） swarm fitness benchmark illustrate premature mutation searching Mutation iteration trapped |
| ISSN: | 1672-5220 |