An improved ?-PSO algorithm with mutation
- 10.2991/iske.2007.66How to use a DOI?
- particle swarm optimization (PSO), phase angle, benchmark function, mutation
In our previous work, a new PSO algorithm called ?-PSO based on phase angle was put forward, which has better optimization performance than standard PSO algorithm when dealing with some simple benchmark functions. But this algorithm may easily stick in the local minima when handling some complex or multi-mode functions. In this paper, an improved ?-PSO with mutation operator is studied. And this improved algorithm has better optimization performance when solving some complex benchmark functions. Benchmark testing shows that this improved ?-PSO algorithm can overcome the local minima and achieve the goal of global minimum in limited iterations
- © 2007, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Zhong Weimin PY - 2007/10 DA - 2007/10 TI - An improved ?-PSO algorithm with mutation BT - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007) PB - Atlantis Press SP - 392 EP - 397 SN - 1951-6851 UR - https://doi.org/10.2991/iske.2007.66 DO - 10.2991/iske.2007.66 ID - Weimin2007/10 ER -