Application of genetic algorithms in the design and optimization of array patterns

Abstract

This paper shows the advantage of using genetic algorithms in several cases of pattern synthesis. These methods are able to escape from local minima and maxima. It is also possible to search a small sample of a large solution space when the number of variables in the problem is very high. We present examples for linear and planar arrays.