Real time algorithms for scheduling problem in unplanned firing operation

초록

We focus on the Real Time Fire Scheduling Problem (RFSP), which is the problem of determining the firing sequence to minimize the threatening probability to achieve tactical goals. In this paper, we assume that there are m weapons that can fire to n targets (> m) and that the weapons are already assigned to targets. A single weapon or multiple weapons may fire to a single target, and these operations must begin at the same time. We propose mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and the results show that the proposed algorithm outperforms the commonly adopted launch meth- od in field artillery. ICIC International © 2020.

키워드