The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Linear array synthesis using an ant-colony-optimization-based algorithm
Abstract
The aim of this work is to show the use of a well-known type of evolutionary computational optimization technique, ant colony optimization (ACO), in a typical electromagnetic problem: linear array synthesis. To this aim, an algorithm based on the fundamentals of ant colony optimization has been developed. The algorithm uses real numbers. Some examples using different optimization criteria are presented. Also, some guidelines for the use of the algorithm, especially for creating the desirability function, are supplied. The algorithm has been demonstrated to be versatile and useful for this problem. The purpose of the work is to show (via this particular application) the flexibility and easy implementation of this algorithm family, which makes it suitable for use in other electromagnetic optimization problems.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Cited by
Uwaechia, A. N., & Mahyuddin, N. M. (2020) · IEEE Access · doi:10.1109/access.2020.2984204 · Cited by 483
Invasive Weed Optimization and its Features in Electromagnetics
Karimkashi, S., & Kishk, A. A. (2010) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2010.2041163 · Cited by 390
Metadata
- Authors
- Rajo-Iglesias, E., & Quevedo-Teruel, O.
- Venue
- IEEE Antennas and Propagation Magazine
- Published
- 2007-04
- Volume
- 49
- Issue
- 2
- Pages
- 70-79
- ISSN
- 1045-9243 (ISSN-L)
- 1558-4143
- OpenAlex
- W1983632510
- Cited by
- 159
- References
- 1
- FWCI
- 14.12
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear array synthesis using an ant-colony-optimization-based algorithm. https://app.cochat.ai/papers/10.1109/map.2007.376644
- The paper
- Rajo-Iglesias, E., & Quevedo-Teruel, O. (2007). Linear array synthesis using an ant-colony-optimization-based algorithm. IEEE Antennas and Propagation Magazine. https://doi.org/10.1109/map.2007.376644
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.