A rule based approach for aircraft dispatching to emerging targets

We consider strategies to handle time critical targets in a battlefield. These targets are assumed to be of different priorities. The approach is to model this as a multiple server spatial queue with priorities, where aircraft required to handle the targets are treated as servers. We consider a cutoff policy on servers that keeps some spare aircraft handy to accommodate higher priority targets that arrive in the near-term future. We also explore situations in which it would be worthwhile sending a non-closest aircraft. Further, both first-come-first-served and distance-based aircraft dispatching policies are examined. The three situations (cutoff policy; which aircraft to dispatch; which target to hit) are separately examined using a simulation model. The simultaneous impact of all three situations is also tested. Based on extensive statistical testing and results from a case study we conclude that it is of significant benefit to simultaneously use these policies when managing the dispatch of aircraft in a battlefield environment.