An optimization problem for designing non-uniformly spaced, linear arrays is formulated and solved by means of an improved genetic algorithm (IGA) procedure. The proposed iterative method is aimed at minimizing the side-lobes level and thinning the array by optimizing the element positions and weights. Selected examples are included, which demonstrate the effectiveness and the design flexibility of the proposed method in the framework of electromagnetic synthesis of linear arrays.
"Linear Antenna Synthesis with a Hybrid Genetic Algorithm," ,
Vol. 49, 1-22, 2004. doi:10.2528/PIER03121301
1. Balanis, C., Antenna Theory Analysis and Design, second edition, John Wiley and Sons, Inc., 1997.
2. Ares-Pena, F., "Application of genetic algorithms and simulated annealing to some antenna problems," Electromagnetic Optimiza- tion by Genetic Algorithms, 1999.
3. Murino, V., A. Trucco, and C. S. Regazzoni, "Synthesis of unequally spaced arrays by simulated annealing," IEEE Trans. Signal Processing, Vol. 44, 119-123, 1996. doi:10.1109/78.482017
4. Rahmat-Samii, Y. and E. Michielssen, Electromagnetic Optimiza- tion by Genetic Algorithms, Wiley & Sons, New York, 1999.
5. Yan, K. and Y. Lu, "Sidelobe reduction in array-pattern synthesis using genetic algorithms," IEEE Trans. Antennas and Propagation, Vol. 45, No. 7, 1117-1122, 1997. doi:10.1109/8.596902
6. Haupt, R. L., "Thinned arrays using genetic algorithms," IEEE Trans. Antennas and Propagation, Vol. 42, No. 7, 993-999, 1994. doi:10.1109/8.299602
7. Weile, D. S. and E. Michielssen, "Integer coded Pareto genetic algorithm design of constrained antenna arrays," Electron. Lett., Vol. 32, No. 9, 1744-1745, 1996. doi:10.1049/el:19961174
8. O'Neill, D. J., "Element placement in thinned arrays using genetic algorithms," IEEE Int. Conf. Oceans 94 Osates, Vol. II, No. 9, 301-306, 1994.
9. Trucco, A. and V. Murino, "Stochastic optimization of linear sparse arrays," IEEE Journal of Oceanic Engineering, Vol. 24, No. 3, 291-299, 1999. doi:10.1109/48.775291
10. Wolpert, D. H. and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. EVolutionary Computation, Vol. 1, No. 1, 67-82, 1997. doi:10.1109/4235.585893
11. Caorsi, S., A. Massa, and M. Pastorino, "A microwave procedure for NDT identification of a crack based on a genetic algorithm," IEEE Trans. Antennas Propagation.
12. Janikow, C. Z. and Z. Michalewicz, "An experimental comparison of binary and floating point representations in genetic algorithms," Proc. 4th Conf. Genetic Algorithms, 31-36, 1991.
13. Caorsi, S., A. Massa, and M. Pastorino, "A computational technique based on a real-coded genetic algorithm for microwave imaging purposes," IEEE Trans. Geoscience and Remote Sensing, Vol. 38, No. 4, 1697-1708, 2000. doi:10.1109/36.851968
14. Davis, L., Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.
15. Whitley, D., "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is the best," Proc. 3rd Int. Conf. Genetic Algorithms, 116-121, 1989.
16. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning Addison-Wesley, Reading, MA, 1989.
17. Haupt, R. L., "An introduction to genetic algorithms for electromagnetics," IEEE Antennas and Propagation Magazine, Vol. 37, 7-15, 1995. doi:10.1109/74.382334
18. Polak, E., Computational Methods in Optimization, Academic Press, New York, 1971.
19. Leeper, D. G., "Isophoric arrays â€” Massively thinned phased arrays with well-controlled sidelobes," IEEE Antennas and Propagation Magazine, Vol. 47, 1825-1835, 1999.
20. Leahy, R. M. and B. D. Jeffs, "On the design of maximally sparse beamforming arrays," IEEE Trans. Antennas and Propagation, Vol. 39, 1178-1187, 1991. doi:10.1109/8.97353