Linear antenna array synthesis with modified invasive weed optimisation algorithm

Authors:
Siddharth Pal;Anniruddha Basak;Swagatam Das
Affiliations:
Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India.;Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India.;Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India
Venue:
International Journal of Bio-Inspired Computation
Year:
2011

Citing 0
Cited 4

Investigations on the synthesis of uniform linear antenna array using biogeography-based optimisation techniques

International Journal of Bio-Inspired Computation
Mass functions design of artificial physics optimisation algorithm for constrained optimisation problem

International Journal of Computer Applications in Technology
Constrained optimisation and robust function optimisation with EIWO

International Journal of Bio-Inspired Computation
Bio-inspired computation: success and challenges of IJBIC

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear antenna array design is one of the most important electromagnetic optimisation problems of current interest. This article describes the application of modified version of a recently developed metaheuristic algorithm, known as the invasive weed optimisation (IWO), to optimise the spacing between the elements of the linear array to produce a radiation pattern with minimum side lobe level and null placement control. IWO is a novel ecologically inspired algorithm that mimics the process of weeds colonisation and distribution and is capable of solving general multi-dimensional, linear and non-linear optimisation problems with appreciable efficiency. For this application, we modified the classical IWO by introducing a more explorative routine of changing the mutation step-size with iterations. Three design examples are presented that illustrate the use of the IWO algorithm, and the optimisation goal in each example is easily achieved. The results of the modified IWO algorithm have been shown to meet or beat the results obtained using other state-of-the-art metaheuristics like the classical IWO, genetic algorithm (GA), particle swarm optimisation (PSO), memetic algorithms (MA), and tabu search (TS) in a statistically meaningful way.