The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Genetic Learning Particle Swarm Optimization
Open accessAbstract
Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for "learning." This leads to a generalized "learning PSO" paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Self-citationThe particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.927706 · Cited by 3,614
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
Cited by
Population size in Particle Swarm Optimization
Piotrowski, A. P., Napiorkowski, J. J., & Piotrowska, A. E. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100718 · Cited by 357
Improving Metaheuristic Algorithms With Information Feedback Models
Wang, G.-G., & Tan, Y. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2780274 · Cited by 285
Phasor particle swarm optimization: a simple and efficient variant of PSO
Ghasemi, M., Akbari, E., Rahimnejad, A., Razavi, S. E., Ghavidel, S., & Li, L. (2019) · Soft Computing · doi:10.1007/s00500-018-3536-8 · Cited by 278
Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis
Luo, X., Yuan, Y., Chen, S., Zeng, N., & Wang, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3033324 · Cited by 264
Metadata
- Authors
- Gong, Y.-J., Li, J.-J., Zhou, Y., Li, Y., Chung, H. S.-H., Shi, Y.-H., & Zhang, J.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-10
- Volume
- 46
- Issue
- 10
- Pages
- 2277-2290
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2187537484
- Cited by
- 563
- References
- 50
- FWCI
- 26.90
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Genetic Learning Particle Swarm Optimization. https://app.cochat.ai/papers/10.1109/tcyb.2015.2475174
- The paper
- Gong, Y.-J., Li, J.-J., Zhou, Y., Li, Y., Chung, H. S.-H., Shi, Y.-H., & Zhang, J. (2016). Genetic Learning Particle Swarm Optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2475174
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.