Impacts of Genetic Algorithm Parameters on the Solution Performance for the Uniform Circular Antenna Array Pattern Synthesis Problem

Abstract

In this paper, the uniform circular antenna array pattern synthesis problem is solved by means of the real coded genetic algorithm (GA). At the same time, the impacts of the mutation rate and the crossover position on the GAperformance are also investigated. For this purpose, a circular antenna array with uniformly spaced isotropic elements having identical excitation amplitudes is used as a model. Unlike the conventional GA (with fixed mutation rate and random crossover positions), typical GA implementations with variable mutation rate and restricted crossover position are considered for performance improvement. In conclusion, for the specific problem, decreasing mutation rate with negative derivative is observed to be outperforming the implementations with different mutation rate behaviors. Moreover, regarding the crossover technique, it is observed that imposing some restrictions on the crossover positions (rather than fully random position selection) yields better solutions.

A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path

“…Recently, evolutionary algorithms (EAs) have been successfully applied to solve hard optimization problems [29][30][31][32][33]. EAs are population-based global search methods based on the mechanism of natural selection in biological systems.…”

Three‐phase adaptive differential evolution for antenna array synthesis

“…Accurate design and control of the high‐gain pattern are critical tasks for antenna arrays, optimization techniques are usually employed for the tasks 6‐11 . The goal is to obtain the optimal parameters of the feed currents and/or positions of array elements 12‐22 . Among various antenna arrays, circular antenna arrays and planar arrays are the most common arrays.…”

“…Among various antenna arrays, circular antenna arrays and planar arrays are the most common arrays. Many research works have been conducted on the feed current optimization of uniformly spaced circular antenna arrays 12‐16 . The location optimization of plane array elements is another popular topic 17‐22 .…”

Multi-Objective Feature Subset Selection using Non-dominated Sorting Genetic Algorithm

“…A solution x is said to dominate the other solution y if the solution x is no worse than y in all objectives and the solution x is strictly better than y in at least one objective [14]. There are other approaches using neural network [20], evolutionary multi agent system [21], evolutionary algorithm [22,25], a hybrid of evolutionary algorithm and neural network [23], approaches using genetic algorithm with particle swarm optimization [24], hybrid evolutionary algorithm [26], and using multi-objective approaches for heuristic optimization [27] for optimization and classification problems. The evolutionary based technique has been used as it works well for the problems with large dimensions, it is known to be a robust technique and it works well with all types of problems because it does not make any assumptions about underlying fitness landscape.…”