The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator
Abstract
A multimodal problem generator was used to test three versions of a genetic algorithm and the binary particle swarm algorithm in a factorial time-series experiment. Specific strengths and weaknesses of the various algorithms were identified.
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
Self-citationA 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
Self-citationThe 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
Self-citation
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
Self-citationParticle 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
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
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
Particle swarm optimization in electromagnetics
Robinson, J., & Rahmat-Samii, Y. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.823969 · Cited by 2,265
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
Clerc, M. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785513 · Cited by 1,692
Particle Swarm Optimization Versus Genetic Algorithms for Phased Array Synthesis
Boeringer, D. W., & Werner, D. H. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.825102 · Cited by 945
Feature selection based on rough sets and particle swarm optimization
Wang, X., Yang, J., Teng, X., Xia, W., & Jensen, R. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.09.003 · Cited by 837
Venter, G., & Sobieszczanski-Sobieski, J. (2003) · AIAA Journal · doi:10.2514/2.2111 · Cited by 802
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
Parrott, D., & Li, X. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859468 · Cited by 547
Particle swarm optimization with Gaussian mutation
Higashi, N., & Iba, H. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202250 · Cited by 544
The particle swarm optimization algorithm in size and shape optimization
Fourie, P. C., & Groenwold, A. A. (2002) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-002-0188-0 · Cited by 494
Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem
Clerc, M. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_8 · Cited by 462
A Novel Approach for Unit Commitment Problem via an Effective Hybrid Particle Swarm Optimization
Ting, T. O., Rao, M. V. C., & Loo, C. K. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.860907 · Cited by 446
Particle swarm optimization for traveling salesman problem
Wang, K.-P., Huang, L., Zhou, C.-G., & Pang, W. (2004) · Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693) · doi:10.1109/icmlc.2003.1259748 · Cited by 408
Robinson, J., Sinton, S., & Rahmat-Samii, Y. (2003) · IEEE Antennas and Propagation Society International Symposium (IEEE Cat. No.02CH37313) · doi:10.1109/aps.2002.1016311 · Cited by 372
A Study of Global Optimization Using Particle Swarms
Schutte, J. F., & Groenwold, A. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-003-6454-x · Cited by 367
PARTICLE SWARM OPTIMIZATION METHOD FOR IMAGE CLUSTERING
OMRAN, M., ENGELBRECHT, A. P., & SALMAN, A. (2005) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001405004083 · Cited by 288
An efficient method for segmentation of images based on fractional calculus and natural selection
Ghamisi, P., Couceiro, M. S., Benediktsson, J. A., & Ferreira, N. M. F. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.04.078 · Cited by 279
Elmasry, W., Akbulut, A., & Zaim, A. H. (2020) · Computer Networks · doi:10.1016/j.comnet.2019.107042 · Cited by 277
Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization
Venter, G., & Sobieszczanski-Sobieski, J. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0318-3 · Cited by 260
Machine learning for precise quantum measurement
Hentschel, A., & Sanders, B. C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.063603 · Cited by 197
Metadata
- Authors
- Kennedy, J., & Spears, W. M.
- Venue
- 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)
- Publisher
- IEEE
- Published
- 2002-11-27
- Pages
- 78-83
- OpenAlex
- W1959606346
- Cited by
- 387
- References
- 3
- FWCI
- 15.50
- 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.