Load Optimization for Navy Landing Ship Tank

The success of military operations mainly relies on the proper flow of the logistical supplies such as water, food, ammunition, etc. from source to the operation theater on time. There are special types of transportation vessels regarding the feature of supply. However, when transporting special material like ammunition, most navies usually prefer utilizing their own transportation capabilities since they require special treatment. For this reason, such material is carried in special boxes, called containers. To minimize the transportation cost and time, an efficient container stowage plan is necessary in terms of loading and unloading these containers. This chapter aims to develop a solution methodology to the problem with the focus on military logistics planning. For this purpose, the author develops a mathematical model that attempts to minimize the transportation time by creating proper loading and unloading sequence of containers to military cargo ships.

Optimization in Military Planning

In recent years, advancing technology has introduced a wide range of resources for military forces. This rapid improvement in the number and types of military resources also led to difficulties in the management of resource allocation issues in combat missions. The general resource allocation problem can be defined as determining the optimal sequence of resource usage allocations while maximizing the kills on the enemy's forces or minimizing casualties. In this chapter, the authors investigate the resource allocation problems and solution approaches observed in planning military missions. Theoretical background information and some examples based on real-time data are provided to illustrate the chosen problem types.

Assessing the Performance of a SAR Boat Location-Allocation Plan via Simulation

Maritime search and rescue (SAR) operation is a critical process that aims to minimize the loss of life, injury, and material damage by rendering aid to persons in distress or imminent danger at sea. Optimal allocation of SAR vessels is a strategic level process that is to be carried out with a plan to react rapidly. This chapter seeks to evaluate the performance of a SAR boat location plan using simulation. The proposed methodology in this chapter works in two stages: First, an optimal allocation scheme of SAR resources is determined via a multi-objective mathematical model. Next, simulation is used to test the performance of the analytical solution under stochastic demand. With the heaviest traffic and maritime risk, the methodology is applied to a case study in the Aegean Sea.

Optimization of NAS Lemoore Scheduling to Support a Growing Aircraft Population

The manual process for flight scheduling at Naval Air Station Lemoore accommodates the needs of 16 fighter resident squadrons as well as constraints imposed by limited military operating area availability. Given the complexity of this problem, attempting to additionally avoid periods of high activity and resultant congestion would challenge the manual process. However, congestion leads to long wait times for flight-line services. Refueling operations are particularly costly when operational time is lost, and resources are backlogged. The problem of avoiding inefficient periods of high demand is complicated by the two types of refueling available: hot refueling, which occurs when the aircraft's engine is running, and cold refueling, which occurs when the aircraft is shut down. Achieving a balance between the two refueling methods is key to maximizing operational effectiveness. The authors discuss an optimization model designed to determine the best daily flight schedules based on the squadrons' flying and training requirements, the refueling infrastructure, and range availability.

Preserving Logistical Support for Deployed Battle Groups in Hostile Environments

The U.S. Navy's at-sea replenishment system is a mobile supply line designed to support the deployed carrier task force (CTF)/cruiser/destroyer (CRUDES) surface action group (SAG) and forward deployed units while at sea. In the Pacific, the main component of the mobile supply line, the combat logistics force (CLF) ship, has become a possible target with the development of the anti-ship ballistic missile. With the ability to target and disable a CLF, an enemy can now disable a deployed CTF/CRUDES fleet by eliminating its required resources. With the goal of preserving the CLF's capabilities to perform its mission while avoiding ASBM threat, the authors consider the possibility of utilizing a “mini-CLF” to shuttle fuel between CLFs operating in a safe environment and warships operating in a threat zone. The authors perform two analyses: they (1) analyze the feasibility of using the Littoral combat ship/joint high-speed vessel, reconfigured as a shuttle to transport resources, and (2) analyze requirements for development of a new class of ships to support the CTF/CRUDES SAG while deployed in the Pacific.

Test and Evaluation for Weapon Systems

Defense systems are complex and expensive and decision makers acquiring these systems aspire better value for money. As part of a procurement decision, test and evaluation (T&E) is conducted to assess if the system is meeting desired requirements. This chapter reviews the concepts in T&E for weapon systems in the navy and presents the process for its implementation. The authors point out the role of modeling and simulation and how to use them to support T&E. The review reveals that developmental and operational T&E can examine weapon systems requirements before their deployment, T&E process can effectively be implemented in six steps, and mission/capacity requirements must be decomposed into predefined evaluation criteria.

The Problem of Locating and Routing Unmanned Aerial Vehicles

In this chapter, locating and routing of a UAV fleet is discussed. Since the research in the location and routing of UAVs is very limited, the related problems are reviewed. A basic problem and its extended version found in the literature are redefined along with their MILP formulation. Both of the problems are characterized by a prize collecting objective function and a homogeneous fleet of fixed number of UAVs based on naval platforms. The aim is described as maximization of the collected importance value associated to interest points. A solution method that is based on ACO is discussed. The usage of this robust method for both the basic and the extended versions of the problem is explained. The improvement room in the present solution method and future research directions are also discussed.

Multi-Criteria Decision Making

Multi-criteria decision making (MCDM) is a discipline that explicitly considers assessing alternatives in a decision problem with respect to multiple criteria. Those methods are frequently used to solve real-life decision problems that incorporate multiple, conflicting, and incommensurate criteria. Considering the chaotic, complex, and ambiguous nature and the dynamics of the military operations, most decision problems observed in military organizations also follow a similar structure involving multiple criteria. This chapter gives an overview of the basic decision-making problem types and decision processes observed in military organizations and provides information on the MCDM methodologies adopted to solve those problems.

Attrition Models and Applications

Frederick W. Lanchester proposed simple ordinary differential equations that plainly model the attrition of fighting forces in a battlefield. With this insight, researchers studied extensions of these equations to model various battles for years. Novel studies include the application of these equations to miscellaneous field apart from battles that comprise reciprocal contention of opponents. If well-defined, these models can assist decision makers in revealing the shortcomings of a war strategy and discovering the bottlenecks that should be optimized. The recent studies prove that the insights gained from these models can also be utilized in other fields such as economy, biology, engineering, etc. This chapter includes the classic Lanchester equations, significant extensions of classical models, and a number of important application examples.

An Overview on Set Covering Problems With a Focus on Military Applications

This chapter deals with the set covering problem, a specific type of a discrete location and representative combinatorial optimization problem, which occupies a huge space in military operations research with its various applications. After presenting a brief literature survey of set covering problems, the author provides a formal description and the mathematical model of the problem. Finally, the key position of those problem types in the military domain and with real-world applications is discussed.