IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i5p662-676.html
   My bibliography  Save this article

An Air Mission Planning Algorithm Using Decision Analysis and Mixed Integer Programming

Author

Listed:
  • Brian J. Griggs

    (The Pentagon, Washington, DC)

  • Gregory S. Parnell

    (Virginia Commonwealth University, Richmond, Virginia)

  • Lee J. Lehmkuhl

    (Air Force Institute of Technology, Wright-Patterson Air Force Base, Ohio)

Abstract

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.

Suggested Citation

  • Brian J. Griggs & Gregory S. Parnell & Lee J. Lehmkuhl, 1997. "An Air Mission Planning Algorithm Using Decision Analysis and Mixed Integer Programming," Operations Research, INFORMS, vol. 45(5), pages 662-676, October.
  • Handle: RePEc:inm:oropre:v:45:y:1997:i:5:p:662-676
    DOI: 10.1287/opre.45.5.662
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.5.662
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.45.5.662?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Donald L. Keefer & Craig W. Kirkwood & James L. Corner, 2004. "Perspective on Decision Analysis Applications, 1990–2001," Decision Analysis, INFORMS, vol. 1(1), pages 4-22, March.
    2. P.S. Sheeba & Debasish Ghose, 2008. "Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(6), pages 581-591, September.
    3. Claudio Gambella & Andrea Lodi & Daniele Vigo, 2018. "Exact Solutions for the Carrier–Vehicle Traveling Salesman Problem," Transportation Science, INFORMS, vol. 52(2), pages 320-330, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:45:y:1997:i:5:p:662-676. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.