The Weapon-Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. Optimizing the WTA is about the selection of the most appropriate weapon for each target in the problem. Basically the aim is to have the maximum effect on targets. Different algorithms / branch and bound (B& / B), genetic algorithm (GA), variable neighborhood search (VNS), are used to solve this problem. In this thesis, a more complex version of this problem is defined and adapted to fire support automation (Command Control Communication Computer Intelligence, C4I) systems. For each target, a weapon with
appropriate ammunition, fuel, timing, status, risk is moved to an appropriate ammunitions, economy of fuel, risk analysis and time scheduling are all integrated into the solution. B& / B, GA and VNS are used to solve static and dynamic WTA problem. Simulations have shown that GA and VNS are the
best suited methods to solve the WTA problem.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12610025/index.pdf |
| Date | 01 September 2008 |
| Creators | Gunsel, Emrah |
| Contributors | Leblebicioglu, Kemal |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0017 seconds