CIRCULAR ANTENNA ARRAY DESIGN BY USING EVOLUTIONARY SEARCH ALGORITHMS
Evolutionary Search Algorithms (EA) have been intensively used in solving numerical optimization problems. Since design of antenna arrays is a numerical optimization problem, EAs have been intensively used in solving antenna arrays design problems. Although EAs are widely used in antenna array desig...
        Saved in:
      
    
          | Published in | Progress in electromagnetics research. Research B Vol. 54; pp. 265 - 284 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
            Electromagnetics Academy
    
        01.09.2013
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1937-6472 1937-6472  | 
| DOI | 10.2528/PIERB13050112 | 
Cover
| Summary: | Evolutionary Search Algorithms (EA) have been intensively used in solving numerical optimization problems. Since design of antenna arrays is a numerical optimization problem, EAs have been intensively used in solving antenna arrays design problems. Although EAs are widely used in antenna array design problems, a performance comparison study of the intensively used EAs for circular antenna array design problem has been scarcely studied. In this paper, 3 different circular antenna array design problems have been solved by using 15 different evolutionary search algorithms (i.e., ABC, ACS, BSA, CK, CLPSO, CMAES, DE, E2-DSA, EPSDE, GSA, JADE, JDE, PSO, SADE, S-DSA). The objective function designed for solution of the relevant circular antenna array design problems ensures minimization of side lobe levels, acquisition of maximum directivity, and null control of the non-uniform, planar circular antenna array. Obtained statistical analysis results show that S-DSA solves the relevant circular antenna array design problems statistically better than the other evolutionary algorithms used in this paper. | 
|---|---|
| ISSN: | 1937-6472 1937-6472  | 
| DOI: | 10.2528/PIERB13050112 |