Optimization of Sparse Linear Arrays Using Harmony Search Algorithms

摘要

A sparse linear array, composed of a uniformly spaced core subarray and an extended sparse subarray, is synthesized using a harmony search (HS) and an exploratory harmony search (EHS) algorithms. The optimal solution is searched by changing the amplitudes of all the elements and the positions of the extended elements, under a set of practical constraints. Performance of the EHS, the HS, a genetic algorithm (GA) and a particle swarm optimization (PSO) algorithm, has also been compared in synthesizing these sparse linear arrays.