Optimization of Airfield Parking and Fuel Asset Dispersal to Maximize Survivability and Mission Capability Level

While the US focus for the majority of the past two decades has been on combatting insurgency and promoting stability in Southwest Asia, strategic focus is beginning to shift toward concerns of conflict with a near-peer state. Such conflict brings with it the risk of ballistic missile attack on air bases. With 26 conflicts worldwide in the past 100 years including attacks on air bases, new doctrine and modeling capacity are needed to enable the Department of Defense to continue use of vulnerable bases during conflict involving ballistic missiles. Several models have been developed to date for Air Force strategic planning use, but these models have limited use on a tactical level or for civil engineer use. This thesis presents the development of a novel model capable of identifying base layout characteristics for aprons and fuel depots to maximize dispersal and minimize impact on sortie generation times during normal operations. This model is implemented using multi-objective genetic algorithms to identify solutions that provide optimal tradeoffs between competing objectives and is assessed using an application example. These capabilities are expected to assist military engineers in the layout of parking plans and fuel depots that ensure maximum resilience while providing minimal impact to the user while enabling continued sortie generation in a contested region

A stochastic program for optimizing military sealift subject to attack

We describe a stochastic program for planning the wartime, sealift deployment of military cargo subject to attack. The cargo moves on ships from US or allied seaports of embarkation through seaports of debarkation (SPODs) near the theater of war where it is unloaded and sent on to final , in-theater destinations. The question we ask is: Can a deployment-planning model, with probabilistic knowledge of the time and location of potential enemy attacks on SPODs, successfully hedge against those attacks? That is, can this knowledge be used to reduce the expected disruption caused by such attacks? A specialized, multi-stage stochastic mixed-integer program is developed and answers that question in the affirmative. Furthermore, little penalty is incurred with the stochastic solution when no attack occurs, and worst-case scenarios are better. In the short term, insight gained from the stochastic-programming approach also enables better scheduling using current rule-based methods

Literature review: The vaccine supply chain

Vaccination is one of the most effective ways to prevent and/or control the outbreak of infectious diseases. This medical intervention also brings about many logistical questions. In the past years, the Operations Research/Operations Management community has shown a growing interest in the logistical aspects of vaccination. However, publications on vaccine logistics often focus on one specific logistical aspect. A broader framework is needed so that open research questions can be identified more easily and contributions are not overlooked.In this literature review, we combine the priorities of the World Health Organization for creating a flexible and robust vaccine supply chain with an Operations Research/Operations Management supply chain perspective. We propose a classification for the literature on vaccine logistics to structure this relatively new field, and identify promising research directions. We classify the literature into the following four components: (1) product, (2) production, (3) allocation, and (4) distribution. Within the supply chain classification, we analyze the decision problems for existing outbreaks versus sudden outbreaks and developing countries versus developed countries. We identify unique characteristics of the vaccine supply chain: high uncertainty in both supply and demand; misalignment of objectives and decentralized decision making between supplier, public health organization and end customer; complex political decisions concerning allocation and the crucial

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks

A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks

In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks