A SURVEY: PARTICLE SWARM OPTIMIZATION BASED ALGORITHMS TO SOLVE PREMATURE CONVERGENCE PROBLEM
Bahareh Nakisa1, Mohd Zakree Ahmad Nazri1, Mohammad Naim Rastgoo1 & Salwani Abdullah1 Show affiliations
- Universiti Kebangsaan Malaysia 43600 Bangi, Malaysia
Journal of Computer Science, Volume 10, Issue 9, pp. 1758–1765 · doi.org/10.3844/jcssp.2014.1758.1765
Abstract
Particle Swarm Optimization (PSO) is a biologically inspired computational search and optimization method based on the social behaviors of birds flocking or fish schooling. Although PSO is represented in solving many well-known numerical test problems, but it suffers from the premature convergence. A number of basic variations have been developed due to solve the premature convergence problem and improve quality of solution founded by the PSO. This study presents a comprehensive survey of the various PSO-based algorithms. As part of this survey, we include a classification of the approaches and we identify the main features of each proposal. In the last part of the study, some of the topics within this field that are considered as promising areas of future research are listed.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Nakisa, B., Nazri, M. Z. A., Rastgoo, M. N. & Abdullah, S. (2014). A SURVEY: PARTICLE SWARM OPTIMIZATION BASED ALGORITHMS TO SOLVE PREMATURE CONVERGENCE PROBLEM. Journal of Computer Science, 10(9), 1758–1765. https://doi.org/10.3844/jcssp.2014.1758.1765
- Licence
- © Science Publications
- Issue
- Volume 10, Issue 9
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
