Swarm intelligence
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Multiobjective Optimization: Theoretical Advances and Applications (Advanced Information and Knowledge Processing)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Monopulse antennas form an important methodology of realizing tracking radar and they are based on the simultaneous comparison of sum and difference signals to compute the angle-error and to steer the antenna patterns in the direction of the target (i.e., the boresight direction). In this study, we consider the synthesis problem of difference patterns in monopulse antennas from the perspective of Multi-objective Optimization (MO). The synthesis problem is recast as a multi-objective optimization problem (for the first time, to the best of our knowledge), where the Maximum Side-Lobe Level (MSLL) and Beam Width (BW) of principal lobe are taken as the two objectives. The Optimal Pareto Fronts (OPF) are obtained for different number of elements and subarrays using one of the best-known evolutionary MO algorithms till date, called the Non-dominated Sorting Genetic Algorithm (NSGA-II). The quality of solutions obtained is compared with the help of Pareto fronts on the basis of the two objectives to investigate the dependence of the number of elements and the number of sub-arrays on the final solution. Then we find the best compromise solutions for 20 element array and compare the results with standard single objective algorithms such as the Differential Evolution (DE) that has been reported in literature so far for the synthesis problem.