Efficient decision makings for dynamic weapon-target assignment by virtual permutation and tabu search heuristics

  • Authors:

  • Bin Xin;Jie Chen;Juan Zhang;Lihua Dou;Zhihong Peng

  • Affiliations:

  • School of Automation, Beijing Institute of Technology, Beijing, China and Key Laboratory of Complex System Intelligent Control and Decision, Ministry of Education, Beijing, China;School of Automation, Beijing Institute of Technology, Beijing, China and Key Laboratory of Complex System Intelligent Control and Decision, Ministry of Education, Beijing, China;School of Automation, Beijing Institute of Technology, Beijing, China and Key Laboratory of Complex System Intelligent Control and Decision, Ministry of Education, Beijing, China;School of Automation, Beijing Institute of Technology, Beijing, China and Key Laboratory of Complex System Intelligent Control and Decision, Ministry of Education, Beijing, China;School of Automation, Beijing Institute of Technology, Beijing, China and Key Laboratory of Complex System Intelligent Control and Decision, Ministry of Education, Beijing, China

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The dynamic weapon-target assignment (DWTA) problem is a typical constrained combinatorial optimization problem with the objective of maximizing the total value of surviving assets threatened by hostile targets through all defense stages. A generic asset-based DWTA model is established, especially for the warfare scenario of force coordination, to formulate this problem. Four categories of constraints, involving capability constraints, strategy constraints, resource constraints (i.e., ammunition constraints), and engagement feasibility constraints, are taken into account in the DWTA model. The concept of virtual permutation (VP) is proposed to facilitate the generation of feasible decisions. A construction procedure (CP) converts VPs into feasible DWTA decisions. With constraint satisfaction guaranteed by the synergy of VPs and the CP, an elaborate local search (LS) operator, namely move-to-head operator, is constructed to avoid repeatedly generating the same decisions. The operator is integrated into two tabu search (TS) algorithms to solve DWTA problems. Comparative experiments involving a random sampling method, an LS method, a hybrid genetic algorithm, a hybrid ant-colony optimization algorithm, and our TS algorithms show that the proposed TS heuristics for DWTA outperform their competitors in most test cases and they are competent for high-quality real-time DWTA decision makings.