PROJECT TITLE :
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 employing a harmony search (HS) and an exploratory harmony search (EHS) algorithms. The optimal solution is searched by changing the amplitudes of all the weather and also the positions of the extended parts, below a group of sensible 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.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here