Game-Theoretic Anti-Submarine Warfare Mission Planner (Heuristic-Based, Fully Excel Capable)

摘要

This thesis introduces a Game-Theoretic Anti-Submarine Warfare Mission Planner (G-TAMP) that can quickly operate on a Navy Marine Corps Intranet (NMCI) computer without any software other than NMCI-standard Microsoft Office, Visual Basic for Applications (VBA), and a freely-available optimization package called LP SOLVE employed as a dynamically linked library. We replace the expensive and non-NMCI approved mathematical modeling software used by Adam Thomas in his 2008 thesis with a purpose-built, fast heuristic solver implemented in VBA. This heuristic, called the Alternating Flows Heuristic, approximately solves the Thomas defender attacker/ defender (D-A/D) model, thereby deploying both visible and secret anti-submarine warfare (ASW) platforms around a high-value unit (HVU) to minimize the probability that a hostile diesel-electric submarine (SSK) penetrates these platforms undetected and reaches the HVU. We analyze five scenarios and compare our heuristic solution with the optimal ones produced by Thomas' D-A/D model.