A two-directional target optimization model.

Loading...
Thumbnail Image
Authors
Hamelin, Gregory R.
Subjects
Advisors
Howard, Gilbert T.
Date of Issue
1979
Date
March 1979
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections