Search results

This paper aims to examine whether changing the clustering of countries within a United States Combatant Command (COCOM) area of responsibility promotes improved forecasting of conflict.

In this paper statistical learning methods are used to create new country clusters that are then used in a comparative analysis of model-based conflict prediction.

In this study a reorganization of the countries assigned to specific areas of responsibility are shown to provide improvements in the ability of models to predict conflict.

The study is based on actual historical data and is purely data driven.

The study demonstrates the utility of the analytical methodology but carries not implementation recommendations.

This is the first study to use the statistical methods employed to not only investigate the re-clustering of countries but more importantly the impact of that change on analytical predictions.

This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing over roads and railways subject to enemy interdiction.

Graph theory, a heuristic and a binary integer program are used in this paper.

This work allows transportation analysts at the United States Transportation Command to identify a relatively small number of roads or railways that, if interdicted by an enemy, could disrupt the flow of military cargo within any theater of operation.

This research does not capture aspects of time, such as the reality that cargo requirements and enemy threats may fluctuate each day of the contingency.

This work provides military logistics planners and decision-makers with a vulnerability assessment of theater distribution routes, including insights into which specific roads and railways may require protection to ensure the successful delivery of cargo from ports of debarkation to final destinations.

This work merges network connectivity and flow characteristics with enemy threat assessments to identify militarily-useful roads and railways most vulnerable to enemy interdictions. A geographic combatant command recently used this specific research approach to support their request for rapid rail repair capability.

This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment between origin and destination node pairs in some geographic region, which is an important logistics problem at the US Transportation Command.

The author uses a mathematical program and a traditional heuristic to provide optimal and near-optimal solutions, respectively. The author also compares the approaches for random, small-scale problems to assess the quality and computational efficiency of the heuristic solution, and also uses the heuristic to solve a notional, large-scale problem typical of real problems.

This work helps analysts identify how many ground transport vehicles are needed to meet cargo delivery requirements in any military theater of operation.

This research assumes all problem data is deterministic, so it does not capture variations in requirements or transit times between nodes.

This work provides prescriptive details to military analysts and decision-makers in a timely manner. Prior to this work, insights for this type of problem were generated using time-consuming simulation taking about a week and often involving trial-and-error.

This research provides new methods to solve an important logistics problem. The heuristic presented in this paper was recently used to provide operational insights about ground vehicle requirements to support a geographic combatant command and to inform decisions for railcar recapitalization within the US Army.

This study proposes targeted modernization of the Department of Defense (DoD's) Joint Forces Ammunition Logistics information system by implementing the optimized innovative information technology open architecture design and integrating Radio Frequency Identification Device data technologies and real-time optimization and control mechanisms as the critical technology components of the solution. The innovative information technology, which pursues the focused logistics, will be deployed in 36 months at the estimated cost of $568 million in constant dollars. We estimate that the Systems, Applications, Products (SAP)-based enterprise integration solution that the Army currently pursues will cost another $1.5 billion through the year 2014; however, it is unlikely to deliver the intended technical capabilities.

The purpose of this paper is to provide an introduction to the special issue on defence logistics. To achieve this, an overview of the field of defence logistics is offered together with a discussion of the historical and contemporary issues that have confronted researchers and practitioners. Current research is described, and a research agenda for future work in the field is proposed.

The paper is based upon a conceptual discussion of defence logistics as it has been studied in the past and is being studied in the present, and a reflection on the ways in which past research can usefully inform future research agendas.

The paper discusses the current state of defence logistics research, and proposes a research agenda for future work based upon the anticipated characteristics of future combat operations.

A future research agenda is proposed that is informed by recent transformations in the conduct of warfare, as well as through anticipated changes in the global strategic landscape. Comparisons are made between defence logistics operations and their commercial counterparts to illustrate where there may be opportunities for adaptation based on the underlying similarities.

This paper discusses the major threads and themes of defence logistics research as a discipline, highlights the changing landscape of conflict in the 21st century and provides a future research agenda for those working in the field.