A two-directional target optimization model.

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.

Department dc:contributor.department

Operations Research

Grantor dc:publisher

Monterey, California. Naval Postgraduate School

Year dc:date.issued

1979

Author dc:creator

• Hamelin, Gregory R.

Advisor dc:contributor.advisor

• Howard, Gilbert T.

Statement dc: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.

Language dc:language.iso

en_US

Handle dc:identifier.uri

https://hdl.handle.net/10945/18902

OAI identifier oai:identifier

oai:calhoun.nps.edu:10945/18902