Multi-loitering Munitions Cooperative Interference Resource Allocation Based on Hybrid Ant Colony Algorithm

Aiming at optimizing the cooperative jamming resource allocation in cooperative operation of loitering munitions, a cooperative jamming resource allocation algorithm based on hybrid ant colony algorithm is proposed. First of all, according to the characteristics of cooperative jamming operation of loitering munitions, the jamming effectiveness evaluation indices are determined, and the jamming benefit decision matrix is constructed. And then a cooperative jamming resource allocation model of multiple loitering munitions is established to solve the problem of asymmetric number of loitering munitions and radars. Finally, a hybrid ant colony algorithm is designed by introducing cross mutation mechanism and metropolis criterion. As the problem that ant colony algorithm tends to fall into local optimal solution is solved, it enhances the global optimization ability of the algorithm. Simulation results show that, compared with the basic ant colony algorithm, the proposed algorithm has good robustness and scalability, and improves the convergence speed of the optimal solution.