|
|
|
| Two-Stage Solution Algorithm for Weapon⁃Target Assignment Problem |
| LEI Baoming1， ZHANG Xinmiao2， HUANG Junsong3，
HUANG Xiyao3， LIU Xiaoyang3 |
| 1. Unmanned System Research Institute， Northwestern Polytechnical University， Xi'an 710072， Shaanxi， China；
2. School of Mathematics and Statistics， Northwestern Polytechnical University， Xi'an 710129， Shaanxi， China；
3. Shanghai Electro-Mechanical Engineering Institute， Shanghai 201109， China |
|
|
|
|
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.
|
|
Published: 22 March 2025
|
|
|
|
|
|
|
|
|
2025, Vol. 8 
