改进的蚁群干扰资源分配方法

Improved Ant Colony Optimization Algorithm for Jamming Resource Allocation

蚁群算法作为新型智能优化算法,应用于干扰资源分配时,寻优过程的收敛速度较慢,且获得全局最优值的概率较低。为了改善基于蚁群算法的干扰资源分配效率,同时提升得到全局最优解的概率,提出了衰减因子在寻优过程中按照指数型函数进行变化,即初始寻优阶段衰减因子取相对较小的数值,随着迭代次数的增加,衰减因子取值单调递增且呈现指数规律变化。仿真分析验证了所提方法的正确性,该方法不仅可以改善干扰资源分配过程中的收敛效率,同时具有较高的全局最优获取概率。

Ant Colony Optimization(ACO)is a new intelligence optimization algorithm.When applied to jamming resource allocation,the velocity of convergence in optimization process is slow and the probability of obtaining the global optimal solution is low.In order to raise the efficiency of jamming resource allocation and the probability of getting global optimal solution,the attenuation factor is improved to a variable that changes according to the exponential function in optimization process.The attenuation factor is taken as a relatively small value in the initial search phase,and increases monotonically and exponentially as the number of iterations increases.Simulation results illustrate the effectiveness of the proposed method,the high efficiency of jamming resource allocation,and higher global optimal solution acquisition probability.