Optimization of transportation requirements in the deployment of military units

Cataloged from PDF version of article.We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their home bases to their designated destinations while obeying constraints on scheduling and routing issues as well as on the availability and use of various types of transportation assets that operate on a multimodal transportation network. The DPP is a large-scale real-world problem for which analytical models do not exist.We propose a model for solving the problem and develop a solution methodology which involves an effective use of relaxation and restriction that significantly speeds up a CPLEX-based branch-and-bound. The solution times for intermediate-sized problems are around 1 h at maximum, whereas it takes about a week in the Turkish Armed Forces to produce a suboptimal feasible solution based on trial-and-error methods. The proposed model can be used to evaluate and assess investment decisions in transportation infrastructure and transportation assets as well as to plan and execute cost-effective deployment operations at different levels of planning. 2005 Elsevier Ltd. All rights reserved

Optimization of transportation requirements in the deployment of military units

We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their home bases to their designated destinations while obeying constraints on scheduling and routing issues as well as on the availability and use of various types of transportation assets that operate on a multimodal transportation network. The DPP is a large-scale real-world problem for which analytical models do not exist. We propose a model for solving the problem and develop a solution methodology which involves an effective use of relaxation and restriction that significantly speeds up a CPLEX-based branch-and-bound. The solution times for intermediate-sized problems are around 1 h at maximum, whereas it takes about a week in the Turkish Armed Forces to produce a suboptimal feasible solution based on trial-and-error methods. The proposed model can be used to evaluate and assess investment decisions in transportation infrastructure and transportation assets as well as to plan and execute cost-effective deployment operations at different levels of planning. © 2006 Elsevier Ltd. All rights reserved

Optimization of transportation requirements in the deployment of military units

Cataloged from PDF version of article.We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their home bases to their designated destinations while obeying constraints on scheduling and routing issues as well as on the availability and use of various types of transportation assets that operate on a multimodal transportation network. The DPP is a large-scale real-world problem for which no analytical models are existent. In this study, we define the problem in detail and analyze it with respect to the academic literature. We propose three mixed integer programming models with the objectives of cost, lateness (the difference between the arrival time of a unit and its earliest allowable arrival time at its destination), and tardiness (the difference between the arrival time of a unit and its latest arrival time at its destination) minimization to solve the problem. The cost-minimization model minimizes total transportation cost of a deployment and is of use for investment decisions in transportation resources during peacetime and for deployment planning in cases where the operation is not imminent and there is enough time to do deliberate planning that takes costs into account. The lateness and tardiness minimization models are of min-max type and are of use when quick deployment is of utmost concern. The lateness minimization model is for cases when the given fleet of transportation assets is sufficient to deploy units within their allowable time windows and the tardiness minimization model is for cases when the given fleet is not sufficient. We propose a solution methodology for solving all three models. The solution methodology involves an effective use of relaxation and restriction that significantly speeds up a CPLEX-based branchand-bound. The solution times for intermediate sized problems are around one hour at maximum for cost and lateness minimization models and around two hours for the tardiness minimization model. Producing a suboptimal feasible solution based on trial and error methods for a problem of the same size takes about a week in the current practice in the Turkish Armed Forces. We also propose a heuristic that is essentially based on solving the models incrementally rather than at one step. Computational results show that the heuristic can be used to find good feasible solutions for the models. We conclude the study with comments on how to use the models in the realworld.Akgün, İbrahimPh.D

Secure and Reconfigurable Network Design for Critical Information Dissemination in the Internet of Battlefield Things (IoBT)

The Internet of things (IoT) is revolutionizing the management and control of automated systems leading to a paradigm shift in areas such as smart homes, smart cities, health care, transportation, etc. The IoT technology is also envisioned to play an important role in improving the effectiveness of military operations in battlefields. The interconnection of combat equipment and other battlefield resources for coordinated automated decisions is referred to as the Internet of battlefield things (IoBT). IoBT networks are significantly different from traditional IoT networks due to the battlefield specific challenges such as the absence of communication infrastructure, and the susceptibility of devices to cyber and physical attacks. The combat efficiency and coordinated decision-making in war scenarios depends highly on real-time data collection, which in turn relies on the connectivity of the network and the information dissemination in the presence of adversaries. This work aims to build the theoretical foundations of designing secure and reconfigurable IoBT networks. Leveraging the theories of stochastic geometry and mathematical epidemiology, we develop an integrated framework to study the communication of mission-critical data among different types of network devices and consequently design the network in a cost effective manner.Comment: 8 pages, 9 figure

Optimizing Cost and Performance of Infrastrucure Alternatives at Contingency Bases in a Hub-and-Spoke Network

Military contingency bases require substantial resources and funding sustain and are often not connected to an infrastructure grid. Infrastructure assets produce the required outputs for sustainment, but are often expensive and inefficient, producing a significant logistical burden. With the increasing near-peer threats of opposing military forces, there is a need for more self-sufficient contingency bases with alternatives that reduce resources usage and the cost of sustainment. Accordingly, the goal of this research is to develop an optimization model capable of selecting infrastructure alternative combinations that minimize the overall resource usage and cost of sustainment at the contingency base level

Requirement for C-130 Aircraft in the Intratheater Korean Scenario

In an effort to provide a timely and reasonably accurate methodology for determining C-130 intratheater airlift requirements, this research concentrated on a rough-cut capacity approach using a straight forward linear programming spreadsheet model. To provide more detailed analysis, a more sophisticated linear program was investigated. Specifically, the spreadsheet model calculated the minimum number of C-130s required to carry required cargo, passenger, and aeromedical loads based on user-defined daily requirements. For a given scenario, inputs include the daily requirements and the expected capacity for C-130 aircraft, trucks, and 22-car trains. Included in the capacity inputs are the number of daily cycles or trips expected from a given mode of transportation. The model is automatically formulated based on these inputs and is solved using a spreadsheet solver. Graphical results are provided. This spreadsheet model is analyzed for a 20-day period, but any planning horizon can be used with modifications. Since the spreadsheet does not perform a parametric analysis, the data used in the spreadsheet formulation was input into the LINDO solver in order to perform parametric analyses

A PATH ENUMERATION REFORMULATION OF THE SCHEDULE MIXED INTEGER PROGRAM SUPPORTING EXPEDITIONARY ADVANCED BASE OPERATIONS.

The U.S. Marine Corps needs an accurate model for analyzing its logistical needs in support of Expeditionary Advanced Base Operations (EABO). EABO is a doctrinal method used by the U.S. Navy and Marine Corps for denying adversary forces access to the maritime global commons. Deployment and sustainment of forces engaged in EABO requires a distribution network supported by various surface and airborne connector platforms of differing capacity and speed. The Marine Corps currently has a model for analyzing its distribution networks in support of EABO, the Schedule Mixed Integer Program (S-MIP). However, the computational difficulty of S-MIP limits its usefulness in large-scale experiments. This thesis describes a path enumeration-based reformulation known as the Path Enumeration Mixed-Integer Program (PE-MIP). PE-MIP is designed to provide a less computationally difficult model than the antecedent model S-MIP. We compare the runtime of PE-MIP and the quality of its solutions with that of S-MIP model and find that PE-MIP provides faster and superior results to S-MIP. The application of PE-MIP by the research sponsor will further inform current Marine Corps and Navy operational plans, acquisition, and force structure decisions.Operational Analysis Directorate, USMC, QUANTICO, VA, 22134Major, United States Marine CorpsApproved for public release. Distribution is unlimited

Laser power conversion system analysis, volume 1

The orbit-to-orbit laser energy conversion system analysis established a mission model of satellites with various orbital parameters and average electrical power requirements ranging from 1 to 300 kW. The system analysis evaluated various conversion techniques, power system deployment parameters, power system electrical supplies and other critical supplies and other critical subsystems relative to various combinations of the mission model. The analysis show that the laser power system would not be competitive with current satellite power systems from weight, cost and development risk standpoints