Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
The DOI matches its Crossref record; 226 of the 226 references it cites were found in a registry or an index.
Abstract
Over the ages, nature has constantly been a rich source of inspiration for science, with much still to discover about and learn from. Swarm Intelligence (SI), a major branch of artificial intelligence, was rendered to model the collective behavior of social swarms in nature. Ultimately, Particle Swarm Optimization algorithm (PSO) is arguably one of the most popular SI paradigms. Over the past two decades, PSO has been applied successfully, with good return as well, in a wide variety of fields of science and technology with a wider range of complex optimization problems, thereby occupying a prominent position in the optimization field. However, through in-depth studies, a number of problems with the algorithm have been detected and identified; e.g., issues regarding convergence, diversity, and stability. Consequently, since its birth in the mid-1990s, PSO has witnessed a myriad of enhancements, extensions, and variants in various aspects of the algorithm, specifically after the twentieth century, and the related research has therefore now reached an impressive state. In this paper, a rigorous yet systematic review is presented to organize and summarize the information on the PSO algorithm and the developments and trends of its most basic as well as of some of the very notable implementations that have been introduced recently, bearing in mind the coverage of paradigm, theory, hybridization, parallelization, complex optimization, and the diverse applications of the algorithm, making it more accessible. Ease for researchers to determine which PSO variant is currently best suited or to be invented for a given optimization problem or application. This up-to-date review also highlights the current pressing issues and intriguing open challenges haunting PSO, prompting scholars and researchers to conduct further research both on the theory and application of the algorithm in the forthcoming years.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Items 201–226 of 226
Ye, H., Luo, W., & Li, Z. (2013) · Computational Intelligence and Neuroscience · doi:10.1155/2013/384125 · Cited by 34
DENPSO: A Distance Evolution Nonlinear PSO Algorithm for Energy-Efficient Path Planning in 3D UASNs
Wu, J., Song, C., Fan, C., Hawbani, A., Zhao, L., & Sun, X. (2019) · IEEE Access · doi:10.1109/access.2019.2932148 · Cited by 33
Epitropakis, M. G., Plagianakos, V. P., & Vrahatis, M. N. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5585967 · Cited by 31
Movement patterns of a particle swarm in high dimensional spaces
Oldewage, E. T., Engelbrecht, A. P., & Cleghorn, C. W. (2019) · Information Sciences · doi:10.1016/j.ins.2019.09.057 · Cited by 28
The influence of fitness landscape characteristics on particle swarm optimisers
Engelbrecht, A. P., Bosman, P. R., & Malan, K. M. (2021) · Natural Computing · doi:10.1007/s11047-020-09835-x · Cited by 24
Opposition-based initialization and a modified pattern for Inertia Weight (IW) in PSO
Farooq, M. U., Ahmad, A., & Hameed, A. (2017) · International Conference on Innovations in Intelligent Systems and Applications (INISTA) · doi:10.1109/inista.2017.8001139 · Cited by 22
Liao, C.-L., Lee, S.-J., Chiou, Y.-S., Lee, C.-R., & Lee, C.-H. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.11.002 · Cited by 22
Durán-Rosal, A. M., Gutiérrez, P. A., Carmona-Poyato, Á., & Hervás-Martínez, C. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.05.129 · Cited by 22
2019 International Conference on Applied Machine Learning (ICAML)
(2019) · doi:10.1109/icaml48257.2019 · Cited by 22
Self balanced particle swarm optimization
Bhambu, P., Kumar, S., & Sharma, K. (2017) · International Journal of Systems Assurance Engineering and Management · doi:10.1007/s13198-017-0642-4 · Cited by 21
A New Hybrid Algorithm of Particle Swarm Optimization
Yang, G., Chen, D., & Zhou, G. (2006) · Lecture notes in computer science · doi:10.1007/11816102_6 · Cited by 19
Liang, X., Li, W., Zhang, Y., Zhong, Y., & Zhou, M. (2013) · IEEE International Conference on Networking, Sensing and Control (ICNSC) · doi:10.1109/icnsc.2013.6548790 · Cited by 18
Improved cuckoo search with particle swarm optimization for classification of compressed images
Enireddy, V., & Kumar, R. K. (2015) · Sadhana · doi:10.1007/s12046-015-0440-0 · Cited by 18
Cellular learning automata based bare bones PSO with maximum likelihood rotated mutations
Vafashoar, R., & Meybodi, M. R. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.016 · Cited by 18
Balancing Exploration and Exploitation in Particle Swarm Optimization on Search Tasking
Nakisa, B., Rastgoo, M. N., & Norodin, J. (2014) · Research Journal of Applied Sciences Engineering and Technology · doi:10.19026/rjaset.8.1117 · Cited by 17
Managing Energy in Smart Homes Using Binary Particle Swarm Optimization
Abid, S., Zafar, A., Khalid, R., Javaid, S., Qasim, U., Khan, Z. A., & Javaid, N. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-61566-0_18 · Cited by 16
Particle Swarm Optimization with Ensemble of Inertia Weight Strategies
Shirazi, M. Z., Pamulapati, T., Mallipeddi, R., & Veluvolu, K. C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61824-1_15 · Cited by 15
Particle swarm optimization with selective multiple inertia weights
Gupta, I. K., Choubey, A., & Choubey, S. (2017) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt.2017.8204132 · Cited by 14
Algorithm based on particle swarm applied to electrical load scheduling in an industrial setting
Lopes, R. F., Costa, F. F., Oliveira, A. M., & Lima, A. C. D. C. (2018) · Energy · doi:10.1016/j.energy.2018.01.090 · Cited by 14
Hybrid BAT-PSO optimization techniques for image registration
Manoj, S., Ranjitha, S., & Suresh, H. N. (2016) · International Conference on Electrical, Electronics, and Optimization Techniques · doi:10.1109/iceeot.2016.7755375 · Cited by 11
Liu, F., Huang, H. P., Li, X., & Hao, Z. (2017) · CAAI Transactions on Intelligence Technology · doi:10.1049/trit.2017.0004 · Cited by 9
Cited by
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
Self-citationBeluga whale optimization: A novel nature-inspired metaheuristic algorithm
Zhong, C., Li, G., & Meng, Z. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.109215 · Cited by 903
An Overview of Variants and Advancements of PSO Algorithm
Jain, M., Saihjpal, V., Singh, N., & Singh, S. B. (2022) · Applied Sciences · doi:10.3390/app12178392 · Cited by 717
Emerging Trends in Blockchain Technology and Applications: A Review and Outlook
Gad, A. G., Mosa, D. T., Abualigah, L., & Abohany, A. A. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.03.007 · Cited by 283
Self-citationMa, G., Wang, Z., Liu, W., Fang, J., Zhang, Y., Ding, H., & Yuan, Y. (2023) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2023.123531 · Cited by 70
“Among the EC algorithms, the PSO algorithm has been widely applied to a variety of real-world optimization problems owing to its simplicity of implementation and powerful ability in achieving a satisfactory solution with a reasonable rate of convergence [28], [29].”
Method
Metadata
- Authors
- Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2021-06
- Volume
- 63
- Pages
- 100868
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W3135423326
- Cited by
- 466
- References
- 226
- FWCI
- 27.52
- Type
- journal article
- Language
- en
- Status
- Retracted
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.