The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Particle swarm optimization based on dimensional learning strategy
Open accessAbstract
In traditional particle swarm optimization (PSO) algorithm, each particle updates its velocity and position with a learning mechanism based on its personal best experience and the population best experience. The learning mechanism in traditional PSO is simple and easy to implement, but it suffers some potential problems, such as the phenomena of “oscillation” and “two steps forward, one step back”. Therefore, designing an effective learning strategy to avoid these two phenomena and to improve the search efficiency is an urgent issue for PSO research. This paper proposes a dimensional learning strategy (DLS) for discovering and integrating the promising information of the population best solution according to the personal best experience of each particle. Thereafter, a two-swarm learning PSO (TSLPSO) algorithm based on different learning strategies is proposed. One of the subpopulations constructs the learning exemplars by DLS to guide the local search of the particles, and the other subpopulation constructs the learning exemplars by the comprehensive learning strategy to guide the global search. 16 classic benchmark functions, 30 CEC2014 test functions, and 1 real-world optimization problem are used to test the proposed algorithm against with 5 typical PSO algorithms and 1 state-of-the-art differential evolution (DE) algorithm. The experimental results show that TSLPSO is statistically and significantly better than the compared algorithms for most of the test problems. Moreover, the convergence speed and convergence accuracy of TSLPSO are also significantly improved.
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
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
Hybrid Artificial Bee Colony Algorithm and Particle Swarm Search for Global Optimization
Chun-Feng, W., Kui, L., & Pei-Ping, S. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/832949 · Cited by 38
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
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
A Novel Hybrid Particle Swarm Optimization Algorithm for Path Planning of UAVs
Yu, Z., Si, Z., Li, X., Wang, D., & Song, H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3182798 · Cited by 352
Metadata
- Authors
- Xu, G., Cui, Q., Shi, X., Ge, H., Zhan, Z.-H., Lee, H. P., Liang, Y., Tai, R., & Wu, C.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2019-03
- Volume
- 45
- Pages
- 33-51
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W2908286818
- Cited by
- 236
- References
- 2
- FWCI
- 14.50
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Particle swarm optimization based on dimensional learning strategy. https://app.cochat.ai/papers/10.1016/j.swevo.2018.12.009
- The paper
- Xu, G., Cui, Q., Shi, X., Ge, H., Zhan, Z.-H., Lee, H. P., Liang, Y., Tai, R., & Wu, C. (2019). Particle swarm optimization based on dimensional learning strategy. Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2018.12.009
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.