The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Invasive Weed Optimization and its Features in Electromagnetics
Abstract
A new numerical stochastic optimization algorithm, inspired from colonizing weeds, is proposed for Electromagnetic applications. This algorithm, invasive weed optimization (IWO), is described and applied to different electromagnetic problems. The linear array antenna synthesis, the standard problem used by antenna engineers, is presented as an example for the application of the IWO. Compared to the PSO, The features of the IWO are shown. As another application, the design of aperiodic thinned array antennas by optimizing the number of elements and at the same time their positions is presented. By implementing this new scenario, thinned arrays with less number of elements and lower sidelobes, compared to the results achieved by genetic algorithm (GA) for the same aperture dimensions, are obtained. Finally, the IWO is applied to a U-slot patch antenna to have the desired dual-band characteristics.
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
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
A novel numerical optimization algorithm inspired from weed colonization
Mehrabian, A. R., & Lucas, C. (2006) · Ecological Informatics · doi:10.1016/j.ecoinf.2006.07.003 · Cited by 1,396
Thinned arrays using genetic algorithms
Haupt, R. L. (1994) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.299602 · Cited by 1,114
Electromagnetic Optimization by Genetic Algorithms
Rahmat‐Samii, Y., & Michielssen, E. (1999) · Microwave journal · Cited by 1,021
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
Genetic algorithm optimization applied to electromagnetics: a review
Weile, D. S., & Michielssen, E. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.558650 · Cited by 881
Jin, N., & Rahmat-Samii, Y. (2007) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2007.891552 · Cited by 805
An introduction to genetic algorithms for electromagnetics
Haupt, R. L. (1995) · IEEE Antennas and Propagation Magazine · doi:10.1109/74.382334 · Cited by 776
Khodier, M. M., & Christodoulou, C. G. (2005) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2005.851762 · Cited by 686
Otten, R. H. J. M., & van Ginneken, L. P. P. P. (1989) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1627-5 · Cited by 421
A broad-band U-slot rectangular patch antenna on a microwave substrate
Tong, K.-F., Luk, K.-M., Lee, K.-F., & Lee, R. Q. (2000) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.865229 · Cited by 305
Analysis and design of L-probe proximity fed-patch antennas
Guo, Y.-X., Mak, C.-L., Luk, K.-M., & Lee, K.-F. (2001) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.914252 · Cited by 199
Linear array synthesis using an ant-colony-optimization-based algorithm
Rajo-Iglesias, E., & Quevedo-Teruel, O. (2007) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2007.376644 · Cited by 159
Coleman, C. M., Rothwell, E. J., & Ross, J. E. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.825658 · Cited by 132
Improved particle swarm optimization technique using hard boundary conditions
Mikki, S. M., & Kishk, A. A. (2005) · Microwave and Optical Technology Letters · doi:10.1002/mop.21004 · Cited by 51
Self-citationElement placement in thinned arrays using genetic algorithms
O’Neill, D. J. (2002) · MTS/IEEE OCEANS Conference (OCEANS) · doi:10.1109/oceans.1994.364059 · Cited by 49
Cited by
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
A Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
Sharma, M., & Kaur, P. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09412-6 · Cited by 303
An intensify Harris Hawks optimizer for numerical and engineering optimization problems
Kamboj, V. K., Nandi, A., Bhadoria, A., & Sehgal, S. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.106018 · Cited by 288
Metadata
- Authors
- Karimkashi, S., & Kishk, A. A.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 2010-04
- Volume
- 58
- Issue
- 4
- Pages
- 1269-1278
- ISSN
- 0018-926X (ISSN-L)
- 1558-2221
- OpenAlex
- W2016706055
- Cited by
- 390
- References
- 20
- FWCI
- 36.94
- 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.