Optimization of aperiodic array patterns using GA and SDA

In this paper the author makes use of the advantage of broad search space of genetic algorithms (GA) for finding an ultimate solution, together with the preciseness of the optimum given by the steepest descent algorithm (SDA). The problem analyzed in this paper is an extension of the previous work on optimization of aperiodic array patterns. The optimization procedure proposed in this paper is, first, to find an initial position by using GA, and then by using that initial position, try to find an ultimate solution by SDA. The author has succeeded in reducing the sidelobe levels by 4 dB compared with those obtained by using only SDA.