Nondominated sorting genetic algorithm-II based sidelobe suppression of concentric regular hexagonal array of antennas

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Research in the evolutionary optimization algorithm (EA) has turned its focus towards solving real life and complex multi-objective problems (MOP). Objective of this work is to obtain good quality design parameters for uniformly excited concentric hexagonal array to achieve low sidelobe pencil beam radiation pattern and high directivity. The optimizing variables are the inter-ring gaps and inter-element gaps in each ring. The objective function vector comprises of three pattern parameters relative peak sidelobe level, peak directivity and the population of the array. Widely accepted multi-objective evolutionary algorithm, namely, Elitist Non-dominated Sorting based Genetic Algorithm (NSGA II) is utilized to achieve these solutions. Optimized design parameters are found better than un-optimized design parameters in every aspect.

Cite

CITATION STYLE

APA

Das, S., Mandal, D., Kar, R., & Ghoshal, S. P. (2015). Nondominated sorting genetic algorithm-II based sidelobe suppression of concentric regular hexagonal array of antennas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8947, pp. 697–705). Springer Verlag. https://doi.org/10.1007/978-3-319-20294-5_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free