Comprehensive study of linear antenna array optimisation using the cuckoo search algorithm

2019 ◽  
Vol 13 (9) ◽  
pp. 1325-1333 ◽  
Author(s):  
Majid Khodier
Keyword(s):  
Antenna Array ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Linear Antenna ◽  
Linear Antenna Array ◽  
Comprehensive Study

Multi-population and dynamic-iterative cuckoo search algorithm for linear antenna array synthesis

2021 ◽  
pp. 108004
Author(s):  
Rohit Salgotra ◽  
Mohamed Abouhawwash ◽  
Urvinder Singh ◽  
Sriparna Saha ◽  
Nitin Mittal ◽  
...  
Keyword(s):  
Antenna Array ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Linear Antenna ◽  
Linear Antenna Array ◽  
Antenna Array Synthesis

scholarly journals Antenna Array Synthesis and Failure Correction Using Differential Search Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Kerim Guney ◽  
Ali Durmus ◽  
Suad Basbug
Keyword(s):  
Antenna Array ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Linear Antenna ◽  
Array Design ◽  
Linear Antenna Array ◽  
Different Types ◽  
Array Optimization ◽  
Different Characteristics ◽  
Antenna Array Synthesis

Differential search (DS) optimization algorithm is proposed for the synthesis of three different types of linear antenna array design examples. The first group of examples is that DS algorithm is used to locate wide nulls on the linear antenna array patterns by controlling amplitude-only. In these examples, sidelobe levels disposed to rise are also suppressed by using DS algorithm in the same optimization process. In the second group of examples, individual nulls are placed with the help of DS algorithm by controlling the amplitude-only, phase-only, and position-only. The last example is a linear antenna array failure correction example. In order to tolerate the element failures, DS is employed to recalculate the amplitude values of the remaining intact elements of the antenna array. The results show that DS is very capable to solve the linear antenna array optimization problems which have different characteristics.

scholarly journals Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Kerim Guney ◽  
Ali Durmus
Keyword(s):  
Differential Evolution ◽  
Antenna Array ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Clonal Selection Algorithm ◽  
Linear Antenna ◽  
Linear Antenna Array ◽  
Backtracking Search ◽  
Search Optimization ◽  
Backtracking Search Optimization Algorithm

An evolutionary method based on backtracking search optimization algorithm (BSA) is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO), genetic algorithm (GA), modified touring ant colony algorithm (MTACO), quadratic programming method (QPM), bacterial foraging algorithm (BFA), bees algorithm (BA), clonal selection algorithm (CLONALG), plant growth simulation algorithm (PGSA), tabu search algorithm (TSA), memetic algorithm (MA), nondominated sorting GA-2 (NSGA-2), multiobjective differential evolution (MODE), decomposition with differential evolution (MOEA/D-DE), comprehensive learning PSO (CLPSO), harmony search algorithm (HSA), seeker optimization algorithm (SOA), and mean variance mapping optimization (MVMO). The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.

Sign in / Sign up

Export Citation Format

Share Document