A family of position mutated hierarchical particle swarm optimization algorithms with time varying acceleration coefficients (viz.HPSO-TVAC, ) is introduced in this paper. The proposed position mutation schemes help the swarm to get out of local optima traps and the hierarchical nature of the swarm prevents premature convergence. One distinct advantage of the proposed algorithms over the existing mutated PSO algorithms is that HPSO-TVAC do not involve any controlling parameter. Performance of the proposed algorithms is evaluated on standard benchmark functions. Comparative study shows that
HPSO-TVAC performs better than the other HPSO-TVAC, HPSO-TVAC, comprehensive learning PSO (CLPSO), adaptive-CLPSO (A-CLSPO), PSO with time-varying inertia weight (PSO-TVIW), and constriction factor PSO (CFPSO)for the benchmark functions considered. We apply the proposed algorithm to the synthesis of uniformly excited, unequally dpaced linear array to minimize sidelobe level (SLL) and to control first-null-beamwidth (FNBW) and null locations. Further, we apply the proposed algorithm to the synthesis of unequally spaced sparse planar array to minimize SLL.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.