By Topic

Investigation of fixed and variable mutation rate performances in real coded Genetic Algorithm for uniform circular antenna array pattern synthesis problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yaman, F. ; Elektron. Muhendisligi Bolumu, Ankara Univ., Ankara, Turkey ; Yilmaz, A.E.

The purpose of this paper is to find the desired pattern of uniform circular antenna array with uniformly spaced isotropic elements having identical excitation amplitudes. For this purpose, angular position of array elements simulated in binary codes and populations representing the circular array are created. Afterwards, the selection, crossover and mutation operators of the Genetic Algorithm are performed on these populations. Fixed mutation rate method, which is used in the conventional Genetic Algorithm, is compared with the variable mutation rate method. In conclusion, mutation rate decreasing along with the generations is found to outperform to the fixed mutation rate for this particular type of antenna array application.

Published in:

Signal Processing and Communications Applications Conference (SIU), 2010 IEEE 18th

Date of Conference:

22-24 April 2010