The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Particle swarm optimization in electromagnetics
Abstract
The particle swarm optimization (PSO), new to the electromagnetics community, is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper introduces a conceptual overview and detailed explanation of the PSO algorithm, as well as how it can be used for electromagnetic optimizations. This paper also presents several results illustrating the swarm behavior in a PSO algorithm developed by the authors at UCLA specifically for engineering optimizations (UCLA-PSO). Also discussed is recent progress in the development of the PSO and the special considerations needed for engineering implementation including suggestions for the selection of parameter values. Additionally, a study of boundary conditions is presented indicating the invisible wall technique outperforms absorbing and reflecting wall techniques. These concepts are then integrated into a representative example of optimization of a profiled corrugated horn antenna.
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
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
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
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
Evolving artificial neural networks
Yao, X. (1999) · Proceedings of the IEEE · doi:10.1109/5.784219 · Cited by 2,981
Electromagnetic Optimization by Genetic Algorithms
Rahmat‐Samii, Y., & Michielssen, E. (1999) · Microwave journal · Cited by 1,021
Self-citationHybrid Particle Swarm Optimiser with breeding and subpopulations
Løvbjerg, M., Rasmussen, T., & Krink, T. (2001) · Cited by 429
Kennedy, J., & Spears, W. M. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699326 · Cited by 387
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
Self-citationStereotyping: improving particle swarm performance with cluster analysis
Kennedy, J. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870832 · Cited by 354
Cited by
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
Jin, N., & Rahmat-Samii, Y. (2007) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2007.891552 · Cited by 805
Self-citationKhodier, M. M., & Christodoulou, C. G. (2005) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2005.851762 · Cited by 686
Analysis of the Publications on the Applications of Particle Swarm Optimisation
Poli, R. (2008) · Journal of Artificial Evolution and Applications · doi:10.1155/2008/685175 · Cited by 651
Karacolak, T., Hood, A. Z., & Topsakal, E. (2008) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2008.919373 · Cited by 633
Metadata
- Authors
- Robinson, J., & Rahmat-Samii, Y.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 2004-02
- Volume
- 52
- Issue
- 2
- Pages
- 397-407
- ISSN
- 0018-926X (ISSN-L)
- 1558-2221
- OpenAlex
- W2142375107
- Cited by
- 2,265
- References
- 10
- FWCI
- 82.35
- 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.