空天防御2025，Vol.8Issue(1)：54-61,8.
武器-目标分配问题的两阶段求解算法
Two-Stage Solution Algorithm for Weapon-Target Assignment Problem
摘要
Abstract
In modern warfare,the air attack target has fast attack speed and diversified attack modes,posing a greater challenge to the ground-to-air short-range defense combat mission.Considering the assignment requirements of rapid decision-making and saturated interception of incoming targets in ground-to-air short-range defense operations,this paper established a mathematical programming model.Utilizing a weapon-target assignment problem with the objective function of maximizing the cost-effectiveness ratio and the constraints of weapon resources and minimum expected kill probability,a two-stage allocation strategy was proposed,and a genetic-auction algorithm was designed.In the first stage,the number of future targets equalled the number of weapon fire channels by replication operation.In the second stage,the auction algorithm was applied to resolve the problem accurately.Compared with the existing simulation experiments of the intelligent optimization algorithms,the algorithm proposed in this study can significantly shorten the chromosome length in the first stage,compress the feasible solution space,and produce stable solution results,thus providing effective decision-making auxiliary information for the first-line commanders quickly.关键词
地对空近程防御/武器-目标分配/两阶段策略/遗传-拍卖算法/可行解空间压缩Key words
ground-to-air close-range defence combat mission/weapon-target assignment/two-stage solution way/genetics-auction algorithm/compress the feasible solution space分类
军事科技引用本文复制引用
雷宝明,张鑫淼,黄俊松,黄西尧,刘晓阳..武器-目标分配问题的两阶段求解算法[J].空天防御,2025,8(1):54-61,8.基金项目
中国航空基金(NO.2023Z001053001) （NO.2023Z001053001）
智能博弈国家重点实验室开放研究课题(NO.ZBKF-24-14) （NO.ZBKF-24-14）
中国航天科技集团有限公司上海航天科技创新基金资助项目(SAST2021-055) （SAST2021-055）
