TY - JOUR
T1 - Dynamic Gaussian mutation beetle swarm optimization method for large-scale weapon target assignment problems
AU - Xu, Han
AU - Zhang, An
AU - Bi, Wenhao
AU - Xu, Shuangfei
N1 - Publisher Copyright:
© 2024 Elsevier B.V.
PY - 2024/9
Y1 - 2024/9
N2 - The weapon target assignment is a crucial issue for firepower resources optimization in modern warfare. Such a problem is complicated, multi-constrained, strongly nonlinear, NP-complete and the existing studies did not consider the suitability between different weapons and targets. In this paper, a novel weapon target assignment model is established that involves the weapon-target suitability and is closer to the real combat scenarios. Then, in view of that the conventional weapon target assignment methods are difficult to be applied in the large-scale problems efficiently, this work proposes a dynamic Gaussian mutation beetle swarm optimization algorithm with rule-based chaotic initialization. With the assistance of the dynamic parameter adjustment strategies and Gaussian mutation, the improved algorithm has fast convergence speed and high convergence accuracy, and it can solve the weapon target assignment problems with excellent optimization capabilities. Besides, the rule-based chaotic initialization strategy is embedded in this algorithm to generate high-quality population with better diversity. Finally, two comparative simulation cases of different initialization methods and algorithms for solving the large-scale weapon target assignment problems are designed. The results demonstrate that the proposed approach can provide more superior assignment schemes than its competitors with enhanced efficiency.
AB - The weapon target assignment is a crucial issue for firepower resources optimization in modern warfare. Such a problem is complicated, multi-constrained, strongly nonlinear, NP-complete and the existing studies did not consider the suitability between different weapons and targets. In this paper, a novel weapon target assignment model is established that involves the weapon-target suitability and is closer to the real combat scenarios. Then, in view of that the conventional weapon target assignment methods are difficult to be applied in the large-scale problems efficiently, this work proposes a dynamic Gaussian mutation beetle swarm optimization algorithm with rule-based chaotic initialization. With the assistance of the dynamic parameter adjustment strategies and Gaussian mutation, the improved algorithm has fast convergence speed and high convergence accuracy, and it can solve the weapon target assignment problems with excellent optimization capabilities. Besides, the rule-based chaotic initialization strategy is embedded in this algorithm to generate high-quality population with better diversity. Finally, two comparative simulation cases of different initialization methods and algorithms for solving the large-scale weapon target assignment problems are designed. The results demonstrate that the proposed approach can provide more superior assignment schemes than its competitors with enhanced efficiency.
KW - Beetle swarm optimization
KW - Nonlinear integer programming
KW - Swarm intelligence optimization algorithm
KW - Weapon target assignment
UR - http://www.scopus.com/inward/record.url?scp=85195043982&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2024.111798
DO - 10.1016/j.asoc.2024.111798
M3 - 文章
AN - SCOPUS:85195043982
SN - 1568-4946
VL - 162
JO - Applied Soft Computing
JF - Applied Soft Computing
M1 - 111798
ER -