A heuristic algorithm for weapon target assignment and scheduling

Hyun Seop Uhm, Young Hoon Lee

Research output: Contribution to journalArticle

Abstract

The weapon target assignment (WTA) problem is to match defending weapons to attacking weapons so as to minimize loss from an attack or to maximize success of interception. In a missile defense system, a defending weapon and a missile guiding radar must be assigned to an attacking missile. The probability of destroying a target is a function of the assigned weapon and the target's collision point. The weapon target assignment and scheduling problem (WTAS) simultaneously schedules each target's collision time with a weapon and radar channel. The problem is formulated as an integer nonlinear program, and heuristics are developed and implemented that provide reasonable solution time. The heuristics rely on decomposition of the nonlinear program, linearization techniques, and simulated annealing. Computational experiments are reported for several test scenarios.

Original languageEnglish
Pages (from-to)53-62
Number of pages10
JournalMilitary Operations Research
Volume24
Issue number4
DOIs
Publication statusPublished - 2019

Bibliographical note

Funding Information:
This work was supported by Agency for Defense Development of Republic of Korea under contract UD180034ED.

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Mechanical Engineering
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A heuristic algorithm for weapon target assignment and scheduling'. Together they form a unique fingerprint.

Cite this