Aircraft Mission Planning
2012 (English)Report (Other academic)
This paper deals with a Military Aircraft Mission Planning Problem, where the problem is to find time efficient flight paths for a given aircraft fleet that should attack a number of ground targets. Due to the nature of the attack, two aircraft need to rendezvous at the target, that is, they need to be synchronized in both space and time. At the attack, one aircraft is launching a guided weapon, while the other is illuminating the target. Each target is associated with multiple attack and illumination options. Further, there may be precedence constraints between targets, limiting the order of the attacks. The objective is to maximize the outcome of the entire attack, while also minimizing the mission time span. We present two mathematical models for this problem and compare their efficiency on some small test cases. We also provide some heuristic approaches since direct application of a general MIP solver to the mathematical model is only practical for smaller scenarios. The heuristics are compared and they successfully provide solutions to a number of scenarios.
Place, publisher, year, edition, pages
2012. , 72 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2012:7
Aircraft Routing, Generalized Vehicle Routing Problem, Precedence, Synchronization, Military Operations Research, Decision Support
IdentifiersURN: urn:nbn:se:liu:diva-77074OAI: oai:DiVA.org:liu-77074DiVA: diva2:524832