The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Supervised Learning and Control Method to Improve Particle Swarm Optimization Algorithms
Abstract
This paper presents an adaptive particle swarm optimization with supervised learning and control (APSO-SLC) for the parameter settings and diversity maintenance of particle swarm optimization (PSO) to adaptively choose parameters, while improving its exploration competence. Although PSO is a powerful optimization method, it faces such issues as difficult parameter setting and premature convergence. Inspired by supervised learning and predictive control strategies from machine learning and control fields, we propose APSO-SLC that employs several strategies to address these issues. First, we treat PSO with its optimization problem as a system to be controlled and model it as a dynamic quadratic programming model with box constraints. Its parameters are estimated by the recursive least squares with a dynamic forgetting factor to enhance better parameter setting and weaken worse ones. Its optimal parameters are calculated by this model to feed back to PSO. Second, a progress vector is proposed to monitor the progress rate for judging whether premature convergence happens. By studying the reason of premature convergence, this work proposes the strategies of back diffusion and new attractor learning to extend swam diversity, and speed up the convergence. Experiments are performed on many benchmark functions to compare APSO-SLC with the state-of-the-art PSOs. The results show that it is simple to program and understand, and can provide excellent and consistent performance.
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
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Cited by
Review of Deep Learning Algorithms and Architectures
Shrestha, A., & Mahmood, A. (2019) · IEEE Access · doi:10.1109/access.2019.2912200 · Cited by 1,883
“The supervised learning module provided real-time feedback with back diffusion (BD) to retain diversity and social attractor renewal to overcome stagnation [76].”
BackgroundInfluentialHenry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
Red deer algorithm (RDA): a new nature-inspired meta-heuristic
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2020) · Soft Computing · doi:10.1007/s00500-020-04812-z · Cited by 443
Cao, Y., Zhang, H., Li, W., Zhou, M., Zhang, Y., & Chaovalitwongse, W. A. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2885075 · Cited by 405
Self-citationChaotic Local Search-Based Differential Evolution Algorithms for Optimization
Gao, S., Yu, Y., Wang, Y., Wang, J., Cheng, J., & Zhou, M. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2019.2956121 · Cited by 368
Self-citation
Metadata
- Authors
- Dong, W., & Zhou, M.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2017-07
- Volume
- 47
- Issue
- 7
- Pages
- 1135-1148
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W2507510427
- Cited by
- 179
- References
- 2
- FWCI
- 17.98
- Type
- journal article
- Language
- en
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Supervised Learning and Control Method to Improve Particle Swarm Optimization Algorithms. https://app.cochat.ai/papers/10.1109/tsmc.2016.2560128
- The paper
- Dong, W., & Zhou, M. (2017). A Supervised Learning and Control Method to Improve Particle Swarm Optimization Algorithms. IEEE Transactions on Systems, Man, and Cybernetics: Systems. https://doi.org/10.1109/tsmc.2016.2560128
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.