We develop solution methods for the air defense problem of a naval task group in this dissertation. We consider two interdependent problems. The first problem is the optimal allocation of a set of defensive missile systems of a naval task group to a set of attacking air targets. We call this problem the Missile Allocation Problem (MAP). The second problem called the Sector Allocation Problem (SAP) is the determination of a robust air defense formation for a naval task group by locating ships in predefined sectors on the surface. For MAP, we present three different mixed integer programming formulations. MAP by its nature requires real time solution. We propose efficient heuristic solution procedures that satisfy the demanding time requirement of MAP. We also develop mathematical programming models for SAP. Proposed branch and bound solution scheme for SAP yields highly satisfactory solutions. We characterize the interaction between MAP and SAP and develop an integrated solution approach.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/2/12604699/index.pdf |
| Date | 01 January 2004 |
| Creators | Karasakal, Orhan |
| Contributors | Ozdemirel, Nur Evin |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | Ph.D. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0019 seconds