• Title/Summary/Keyword: anti-air fire distribution

Search Result 1, Processing Time 0.019 seconds

Polynomial-time Greedy Algorithm for Anti-Air Missiles Assignment Problem (지대공 미사일 배정 문제의 다항시간 탐욕 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.3
    • /
    • pp.185-191
    • /
    • 2019
  • During the modern battlefields of multi-batches flight formation attack situation, it is an essential task for a commander to make a proper fire distribution of air defense missile launch platforms for threat targets with effectively and quickly. Pan et al. try to solve this problem using genetic algorithm, but they are fails. This paper gets the initial feasible solution using high threat target first destroying strategy only use 75% available fire of each missile launch platform. Then, the assigned missile is moving to another target in the case of decreasing total threat. As a result of experiment, while the proposed algorithm is polynomial-time complexity greedy algorithm but this can be improve the solution than genetic algorithm.