Multiobjective Synthesis of Linear Arrays by Using an Improved Genetic Algorithm
In this paper, an improved genetic algorithm with dynamic weight vector (IGA-DWV) is proposed for the pattern synthesis of a linear array. To maintain the diversity of the selected solution in each generation, the objective function space is divided by the dynamic weight vector, which is uniformly d...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2019-01-01
|
| Series: | International Journal of Antennas and Propagation |
| Online Access: | http://dx.doi.org/10.1155/2019/1064103 |
| Summary: | In this paper, an improved genetic algorithm with dynamic weight vector (IGA-DWV) is proposed for the pattern synthesis of a linear array. To maintain the diversity of the selected solution in each generation, the objective function space is divided by the dynamic weight vector, which is uniformly distributed on the Pareto front (PF). The individuals closer to the dynamic weight vector can be chosen to the new population. Binary- and real-coded genetic algorithms (GAs) with a mapping method are implemented for different optimization problems. To reduce the computation complexity, the repeat calculation of the fitness function in each generation is replaced by a precomputed discrete cosine transform matrix. By transforming the array pattern synthesis into a multiobjective optimization problem, the conflict among the side lobe level (SLL), directivity, and nulls can be efficiently addressed. The proposed method is compared with real number particle swarm optimization (RNPSO) and quantized particle swarm optimization (QPSO) as applied in the pattern synthesis of a linear thinned array and a digital phased array. The numerical examples show that IGA-DWV can achieve a high performance with a lower SLL and more accurate nulls. |
|---|---|
| ISSN: | 1687-5869 1687-5877 |