An improved particle swarm optimization with an adaptive updating mechanism

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Premature convergence when solving multimodal problems is still the main limitation which affects the performance of the PSO. To avoid of premature, an improved PSO algorithm with an adaptive updating mechanism (IPSO) is proposed in this paper. When the algorithm converges to a local optimum, the updating mechanism begins to work so that the stagnated algorithm obtains energy for optimization. That is, the updating mechanism refreshes the swarm and expands the range for exploration. In this way, the algorithm can achieve a good balance between global exploration and local exploitation by the combination of the basic PSO evolution and updating mechanism. The proposed method is tested with a set of 10 standard optimization benchmark problems and the results are compared with those obtained through other 4 existing PSO algorithms. The simulation results elucidate that the proposed method produces the near global optimal solution, especially for those complex multimodal functions whose solution is difficult to be found by the other 4 algorithms. It is also observed from the comparison the IPSO is capable of producing a quality of optimal solution with faster rate. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Qi, J., & Ding, Y. (2011). An improved particle swarm optimization with an adaptive updating mechanism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6728 LNCS, pp. 130–137). https://doi.org/10.1007/978-3-642-21515-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free