Shandong Science

   

Sparse Array Optimization Method using a Dynamic Genetic Algorithm

YAO Fengwei   

  1.  School of Communication and Information Engineering, Shanghai Technical Institute of Electronics and Information, Shanghai 201411, China
  • Received:2025-04-30 Accepted:2025-05-18 Online:2025-12-09
  • Contact: YAO Fengwei E-mail:jojoyao@163.com

Abstract: To address the optimization challenges associated with two-dimensional sparse arrays, this study proposes an improved dynamic genetic algorithm. This algorithm focuses on reducing the number of array elements while enhancing peak sidelobe suppression. This proposed algorithm introduces an evolutionary completion index that integrates the number of iterations and population fitness to accurately characterize the evolutionary progress of the population. In addition, according to this index, dynamically adjustable crossover and mutation operators are designed, which enable the algorithm to flexibly adjust crossover and mutation probabilities to satisfy the needs of different optimization stages, thereby improving the overall optimization performance. The experimental results revealed that compared with traditional genetic algorithms, the proposed algorithm can effectively suppress the peak sidelobe ratio by more than 3.9 dB in sparse array optimization, thereby exhibiting robust adaptability and stability across various sparsity levels.

Key words: two-dimensional sparse array, genetic algorithm, evolutionary completion index, dynamic parameters, sidelobe suppression

CLC Number: 

  • TN802

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0