An improved PSO for multimodal complex problem

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

Abstract

As the multimodal complex problem has many local optima, basic PSO is difficult to effectively solve this kind of problem. To conquer this defect, firstly, we adopt Monte Carlo method to simulate the fly trajectory of particle, and conclude the reason for falling into local optima. Then, by defining distance, average distance and maximal distance between particles, an adaptive control factor (Adaptive rejection factor, ARF) for pp and pg was proposed to increase the ability for escaping from local optima. In order to test the proposed strategy, three test benchmarks were selected to conduct the analysis of convergence property and statistical property. The simulation results show that particle swarm optimizer based on adaptive rejection factor (ARFPSO) can effectively avoid premature phenomenon. Therefore, ARFPSO is available for complex multimodal problems. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Liu, Y., Zhang, Z., Luo, Y., & Wu, X. (2014). An improved PSO for multimodal complex problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8590 LNBI, pp. 371–378). Springer Verlag. https://doi.org/10.1007/978-3-319-09330-7_44

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