一种基于蚁群算法的准动态防空武器分配算法

摘要

武器目标分配问题是一个典型的限制组合优化问题，旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题，提出了基于时间窗的准动态武器目标分配算法，该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标，并将该算法推广至多类防空武器的优化分配中。通过大量实验验证，该算法在性能、时间复杂度等方面均有较大优势，并且能较好地适应战场态势的变化，及时调整分配方案，具有很好的实用性。%Weapon-target assignment (WTA)is a typical constrained combinatorial optimization problem,subject to maximize the total value of surviving assets threatened by hostile targets through all defense stages. It includes two versions-static WTA and dynamic WTA. A quasi-dynamic WTA based on time window is proposed in this paper. The algorithm comprehensively take kill probability,kill time and weapon consume into consideration. And it has been applied to multi-channel defense weapon. A comparison of the proposed algorithm with several existing search approaches shows that the proposed algorithm outperforms its competitors and it is more adaptable on WTA problems.