Synthesis of unequally spaced antenna arrays by a new differential evolutionary algorithm

Abstract

The differential evolution (DE) algorithm with a new differential mutation base strategy, namely best of random, is applied to the synthesis of unequally spaced antenna arrays. In the best of random mutation strategy, the best individual among three randomly chosen individuals is used as the mutation base while the other two are for the vector difference. Hence a good balance of diversity and evolution speed can be obtained. An indirect coding method is utilized to convert the constrained synthesis problem to an unconstrained one. The effect of angle resolution of the radiation pattern is also discussed. Simulation results demonstrate that the new DE algorithm is promising.