A multi-objective approach for dynamic missile allocation using artificial neural networks for time sensitive decisions

Karasakal O., KARASAKAL E., Silav A.

Soft Computing, vol.25, no.15, pp.10153-10166, 2021 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 25 Issue: 15
  • Publication Date: 2021
  • Doi Number: 10.1007/s00500-021-05923-x
  • Journal Name: Soft Computing
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC, zbMATH
  • Page Numbers: pp.10153-10166
  • Keywords: Dynamic weapon target allocation problem, Air defense, Rescheduling, Artificial neural network, DEFENSE
  • Middle East Technical University Affiliated: Yes


© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.In this study, we develop a new solution approach for the dynamic missile allocation problem of a naval task group (TG). The approach considers the rescheduling of the surface-to-air missiles (SAMs), where a set of them have already been scheduled to a set of attacking anti-ship missiles (ASMs). The initial schedule is mostly inexecutable due to disruptions such as neutralization of a target ASM, detecting a new ASM, and breakdown of a SAM system. To handle the dynamic disruptions while keeping efficiency high, we use a bi-objective model that considers the efficiency of SAM systems and the stability of the schedule simultaneously. The rescheduling decision is time-sensitive, and the amount of information to be processed is enormous. Thus, we propose a novel approach that supplements the decision-maker (DM) in choosing a Pareto optimal solution considering two conflicting objectives. The proposed approach uses an artificial neural network (ANN) that includes an adaptive learning algorithm to structure the DM's prior articulated preferences. ANN acts like a DM during the engagement process and chooses one of the non-dominated solutions in each rescheduling time point. We assume that the DM's utility function is consistent with a non-decreasing quasi-concave function, and the cone domination principle is incorporated into the solution procedure. An extensive computational study is provided to present the effectiveness of the proposed approach.