基于遗传模型改进蜂群算法的稀疏阵列优化

人工蜂群算法作为一种新兴的群体智能算法，在解决复杂连续问题时表现突出。但是由于算法本身内在运行机制的原因，算法在搜索上表现出优异的性能，却疏于开发。为了平衡搜索和开发二者之间的矛盾，提出了一种基于遗传模型改进的人工蜂群算法，并成功运用到了阵列综合领域。算法先将全局最优解引入邻域搜索过程，指导蜂群寻找最佳蜜源，加速算法收敛。为了避免人工蜂群算法陷入局部最优，需要提高其开发能力，通过借鉴遗传算法中的进化机制，建立了遗传模型，对采取最佳保留后的蜜源进行遗传操作，丰富蜜源的多样性。在一组广泛使用的数值函数上对改进人工蜂群算法进行了测试，实验数据表明，该算法相较于其他算法具有很强的竞争力。将该算法运用于线性阵列的稀疏优化，旨在降低阵列的峰值旁瓣电平，在同样的阵列约束下与其他算法进行了优化对比，仿真结果进一步证明了算法的有效性。

Thinned array optimization based on genetic model improved artificial bee colony algorithm

To solve the problem that artificial bee colony algorithm is good at exploration and neglect exploitation, this paper proposes an improved artificial bee colony algorithm based on genetic model, which has been successfully applied to array synthesis. Firstly, the global optimal solution is introduced into the neighborhood search process to guide the bees to find the best nectar source thus to accelerate the convergence of the algorithm. Secondly, to avoid the local optimization of the algorithm, the exploitation ability of artificial bee colony algorithm must be improved. The evolutionary mechanism of genetic algorithm is used for reference, and a genetic model is established to carry out genetic operation on the honey source after adopting the optimal retention, to enrich the diversity of honey source. The improved artificial bee colony algorithm is tested on a set of widely used numerical functions, and the experimental data show that the proposed algorithm has strong competitiveness compared with other algorithms. Then, the algorithm is applied to the sparse optimization of the linear array to reduce the peak sidelobe level of the array. The optimization is compared with other algorithms under the same array constraints. The simulation results further prove the effectiveness of the algorithm.