An air mission planning algorithm using decision analysis and mixed integer programming

• 成果类型: Article
• 署名作者: Griggs, BJ; Parnell, GS; Lehmkuhl, LJ
• 署名单位: Virginia Commonwealth University; United States Department of Defense; United States Air Force; US Air Force Research Laboratory
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.45.5.662
• 发表日期: 1997
• 页码: 662-676

摘要

This paper describes the development of an air mission planning algorithm for the Joint Stochastic Warfare Analysis Research (JSTOCHWAR). The overall problem scope was to develop an algorithm to handle major factors bearing on the combat mission planning problem while providing hook-ups for the JSTOCHWAR architecture. Other aspects of the problem included finding the appropriate level of detail, developing a fast solving technique, and attempting to use existing data. The problem was handled by using some ideas from existing aircraft allocation algorithms and by adding some new techniques. The proposed air mission planning algorithm supplies the optimum degree of force for campaign objectives by using a mixed integer program (MIP) to allocate the optimum number and type of aircraft and munitions against each target. The MIP takes advantage of the force multiplying effects of mass and mutual support through its use of strike packages with air defense suppression and air-to-air escort aircraft. Additionally, a decision tree algorithm determines the best plan in light of the uncertainties of weather and weather forecasts. This air mission planning algorithm omits many of the details in the actual aircraft tasking process, but in its continuous variable version, provides fast, nearly optimal solutions that should approximate real-world tasking results.