On Assigning Long-Endurance Unmanned Aircraft Systems to Theater Combatant Commands
Abstract
We describe, formulate, and propose a heuristic algorithm for Strategic Command's problem of assigning long-endurance unmanned aircraft systems to theater combatant commands (COCOMs). We identify the problem's important characteristics, which include the relative priorities of the different COCOMs, the relative priorities of the different requirements in each COCOM, the different amounts of aircraft time required to work on the different requirements, and the probabilistic results of pursuing a given task. We formulate the problem as a binary nonlinear program (NLP) with a polynomial objective function and linear constraints. We identify the data required to define an instance of the problem. We discuss different approaches to finding solutions to the NLP and recommend a greedy heuristic algorithm, which is given in detail.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 2010
- Accession Number
- ADA513753
Entities
People
- Roger C. Burk
Organizations
- United States Military Academy