The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Particle swarm optimiser with neighbourhood operator
Abstract
In recent years population based methods such as genetic algorithms, evolutionary programming, evolution strategies and genetic programming have been increasingly employed to solve a variety of optimisation problems. Recently, another novel population based optimisation algorithm - namely the particle swarm optimisation (PSO) algorithm, was introduced by R. Eberhart and J. Kennedy (1995). Although the PSO algorithm possesses some attractive properties, its solution quality has been somewhat inferior to other evolutionary optimisation algorithms (P. Angeline, 1998). We propose a number of techniques to improve the standard PSO algorithm. Similar techniques have been employed in the context of self organising maps and neural-gas networks (T. Kohonen, 1990; T.M. Martinez et al., 1994).
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
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
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
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
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
The particle swarm: social adaptation of knowledge
Kennedy, J. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592326 · Cited by 1,555
'Neural-gas' network for vector quantization and its application to time-series prediction
Martinetz, T. M., Berkovich, S. G., & Schulten, K. J. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238311 · Cited by 1,431
Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences
Angeline, P. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0040811 · Cited by 1,125
A review of evolutionary artificial neural networks
Yao, X. (1993) · International Journal of Intelligent Systems · doi:10.1002/int.4550080406 · Cited by 492
EVOLUTIONARY ARTIFICIAL NEURAL NETWORKS
YAO, X. (1993) · International Journal of Neural Systems · doi:10.1142/s0129065793000171 · Cited by 333
Cited by
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
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
Self-citationSelf-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
The particle swarm optimization algorithm: convergence analysis and parameter selection
Trelea, I. C. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00447-7 · Cited by 2,644
Metadata
- Authors
- Suganthan, P. N.
- Venue
- Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- Publisher
- IEEE
- Published
- 2003-01-20
- Pages
- 1958-1962
- OpenAlex
- W2157107726
- Cited by
- 514
- References
- 12
- FWCI
- 13.75
- Type
- conference paper
- 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.