The DOI matches its Crossref record.
Locating multiple optima using particle swarm optimization
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
Cited by
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
“In addition, various search operators based on sociological or biological concepts have also been proposed, such as the niching PSO [32], cultural-based PSO [33] and the aging theory inspired PSO (ALC-PSO) [13].”
BackgroundA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
Orthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
Particle Swarm Optimization With an Aging Leader and Challengers
Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2173577 · Cited by 635
Modified cuckoo search: A new gradient free optimisation algorithm
Walton, S., Hassan, O., Morgan, K., & Brown, M. R. (2011) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2011.06.004 · Cited by 543
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Li, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2026270 · Cited by 466
Seeking Multiple Solutions: An Updated Survey on Niching Methods and Their Applications
Li, X., Epitropakis, M. G., Deb, K., & Engelbrecht, A. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2638437 · Cited by 339
Self-citationA Novel Hybrid Bat Algorithm with Harmony Search for Global Numerical Optimization
Wang, G., & Guo, L. (2013) · Journal of Applied Mathematics · doi:10.1155/2013/696491 · Cited by 296
Liu, Z., Cao, H., Chen, X., He, Z., & Shen, Z. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.07.019 · Cited by 277
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm
Zeng, N., Wang, Z., Liu, W., Zhang, H., Hone, K., & Liu, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3029748 · Cited by 269
Recent advances in engineering design optimisation: Challenges and future trends
Roy, R., Hinduja, S., & Teti, R. (2008) · CIRP Annals · doi:10.1016/j.cirp.2008.09.007 · Cited by 248
Metadata
- Authors
- Brits, R., Engelbrecht, A. P., & van den Bergh, F.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2007-06
- Volume
- 189
- Issue
- 2
- Pages
- 1859-1883
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2164161007
- Cited by
- 229
- References
- 0
- FWCI
- 13.78
- 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
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.