War game problem considering the mobility of weapons and targets

Abstract

War-Gaming is recognized as a valuable tool for commanders, leaders, and managers. Well-executed War-Games have delivered significant competitive advantages in numerous conflicts. The war-game confirmed the commanders’ knowledge of weapon systems and performance, as well as the time and space necessary to carry out battlefield maneuvers. One of the primary missions of each army on the battlefield is weapon target assignment. The weapon target assignment (WTA) is a critical problem to command to be solved in battlefield decisions. In a WTA problem, we should assign available weapons to determined targets appropriately to optimize the performance criteria. This study discusses a problem in relation to allocating and scheduling in WTA considering the mobility weapons and mobility targets. Bi-level linear programming problem is defined so that each level independently optimizes its own objective functions but is influenced by actions taken by another unit. To solve the under studied problem, three famous meta-heuristic algorithms including simulated annealing (SA), genetic algorithm (GA) and grey wolf optimizer (GWO) methods are proposed. Since the performance of meta-heuristic algorithms depends on setting the parameters, the Taguchi method has been used statistically for set parameters of the developed Algorithms. Performance evaluation of the presented algorithms is conducted through numerical experiments involving randomly generated test problems. To compare the results of proposed meta-heuristic algorithms, ANOVA and Tukey tests were used. The Computational results have shown that proposed GWO algorithm worked better than the SA and GA algorithms.