TY - JOUR
T1 - Swarm intelligence algorithms for weapon-target assignment in a multilayer defense scenario
T2 - A comparative study
AU - Cao, Ming
AU - Fang, Weiguo
N1 - Publisher Copyright:
© 2020 by the authors.
PY - 2020/5/1
Y1 - 2020/5/1
N2 - Weapon-target assignment (WTA) is a kind of NP-complete problem in military operations research. To solve the multilayer defense WTA problems when the information about enemy's attacking plan is symmetric to the defender, we propose four heuristic algorithms based on swarm intelligence with customizations and improvements, including ant colony optimization (ACO), binary particle swarm optimization (BPSO), integer particle swarm optimization (IPSO) and sine cosine algorithm (SCA). Our objective is to assess and compare the performance of different algorithms to determine the best algorithm for practical large-scale WTA problems. The effectiveness and performance of various algorithms are evaluated and compared by means of a benchmark problem with a small scale, the theoretical optimal solution of which is known. The four algorithms can obtain satisfactory solutions to the benchmark problem with high quality and high robustness, while IPSO is superior to BPSO, ACO and SCA with respect to the solution quality, algorithmic robustness and computational efficiency. Then, IPSO is applied to a large-scale WTA problem, and its effectiveness and performance are further assessed. We demonstrate that IPSO is capable of solving large-scale WTA problems with high efficiency, high quality and high robustness, thus meeting the critical requirements of real-time decision-making in modern warfare.
AB - Weapon-target assignment (WTA) is a kind of NP-complete problem in military operations research. To solve the multilayer defense WTA problems when the information about enemy's attacking plan is symmetric to the defender, we propose four heuristic algorithms based on swarm intelligence with customizations and improvements, including ant colony optimization (ACO), binary particle swarm optimization (BPSO), integer particle swarm optimization (IPSO) and sine cosine algorithm (SCA). Our objective is to assess and compare the performance of different algorithms to determine the best algorithm for practical large-scale WTA problems. The effectiveness and performance of various algorithms are evaluated and compared by means of a benchmark problem with a small scale, the theoretical optimal solution of which is known. The four algorithms can obtain satisfactory solutions to the benchmark problem with high quality and high robustness, while IPSO is superior to BPSO, ACO and SCA with respect to the solution quality, algorithmic robustness and computational efficiency. Then, IPSO is applied to a large-scale WTA problem, and its effectiveness and performance are further assessed. We demonstrate that IPSO is capable of solving large-scale WTA problems with high efficiency, high quality and high robustness, thus meeting the critical requirements of real-time decision-making in modern warfare.
KW - Ant colony optimization
KW - Heuristic algorithms
KW - Particle swarm optimization
KW - Sine cosine algorithm
KW - Swarm intelligence
KW - Weapon-target assignment
UR - https://www.scopus.com/pages/publications/85090878934
U2 - 10.3390/SYM12050824
DO - 10.3390/SYM12050824
M3 - 文章
AN - SCOPUS:85090878934
SN - 2073-8994
VL - 12
JO - Symmetry
JF - Symmetry
IS - 5
M1 - 234
ER -