Search results

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 recommends new criteria for selecting seaports of embarkation during military deployments. Most importantly, this research compares the current port selection criterion, which is to select the seaport with the shortest inland transport time from the deploying installation, to the proposed port selection criteria, which are to select the seaport based on the shortest combined inland and oceanic transit time to the destination theater.

The authors construct an original integer program to select seaports that minimize the expected delivery timeline for a set of notional, but realistic, deployment requirements. The integer program is solved considering the current as well as the proposed port selection criteria. The solutions are then compared using paired-samples t-tests to assess the statistical significance of the port selection criteria.

This work suggests that the current port selection criterion results in a 10–13% slower delivery of deploying forces as compared to the proposed port selection criteria.

This work assumes deterministic inland transit times, oceanic transit times, and seaport processing rates. Operational fluctuations in transit times and processing rates are not expected to change the findings from this research.

This research provides evidence that the current port selection criterion for selecting seaports for military units deploying from the Continental United States is suboptimal. More importantly, logistics planners could use these recommended port selection criteria to reduce the expected delivery timelines during military deployments.

Several military doctrinal references suggest that planners select seaports based on habitual installation-to-port pairings, especially for early deployers. This work recommends a change to the military's current port selection process based on empirical analyses that show improvements to deployment timelines.

This paper aims to introduce a new mixed integer programming formulation and associated heuristic algorithm to solve the Military Nodal Capacity Problem, which is a type of supply chain network design problem that involves determining the amount of capacity expansion required at theater nodes to ensure the on-time delivery of military cargo.

Supply chain network design, mixed integer programs, heuristics and regression are used in this paper.

This work helps analysts at the United States Transportation Command identify what levels of throughput capacities, such as daily processing rates of trucks and railcars, are needed at theater distribution nodes to meet warfighter cargo delivery requirements.

This research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads.

This work gives military analysts and decision makers prescriptive details about nodal capacities needed to meet demands. Prior to this work, insights for this type of problem were generated using multiple time-consuming simulations often involving trial-and-error to explore the trade space.

This work merges research of supply chain network design with military theater distribution problems to prescribe the optimal, or near-optimal, throughput capacities at theater nodes. The capacity levels must meet delivery requirements while adhering to constraints on the proportion of cargo transported by mode and the expected payloads for assets.

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 aims to examine ship loading strategies during large-scale military deployments. Ships are usually loaded to a stowage goal of about 65% of the ship's capacity. The authors identify how much cargo to load onto ships for each sailing and propose lower stowage goals that could improve the delivery of forces during the deployment.

The authors construct several mixed integer programs to identify optimal ship loading strategies that minimize delivery timelines for notional, but realistic, problem variables. The authors study the relative importance of these variables using experimental designs, regressions, correlations and chi-square tests of the empirical results.

The research specifies the conditions during which ships should be light loaded, i.e. loaded to less than 65% of total capacity. Empirical results show cargo delivered up to 16% faster with a light-loaded strategy compared to fully loaded ships.

This work assumes deterministic sailing times and ship loading times. Also, all timing aspects of the problem are estimated to the nearest natural number of days.

This research provides important new insights about optimal ship loading strategies, which were not previously quantified. More importantly, logistics planners could use these insights to reduce sealift delivery timelines during military deployments.

Most ship routing and scheduling problems minimize costs as the primary goal. This research identifies the situations in which ships transporting military forces should be light loaded, thereby trading efficiency for effectiveness, to enable faster overall delivery of unit equipment to theater seaports.

The objective of this research is to conduct an exploratory study that will gain consensus among restaurant industry professionals, academics and outside industry experts on the set of work practice dimensions in a high performance management systems (HPMS) for restaurant managers in the US casual restaurant sector.

An exploratory case study method was employed that used a combination of data collection techniques: interviews for the pilot study, the Delphi method and secondary data collection. Restaurant experts were chosen to consider the components of an HPMS construct for unit management in the US casual restaurant business. Assumptions were made based on a review of strategic human resource management literature, then experts were interviewed and a Delphi was conducted to gain consensus.

The authors find thirteen dimensions of an HPMS, which are common to unit management in US casual restaurants. Three work practices that were not considered relevant dimensions to the casual restaurant industry were removed from the Delphi. This translates into a difference of seven work practices between a manufacturing work system and a restaurant work system, which are either excluded or included in a restaurant work system.

Previous strategic human resource management research has dubbed HR work practices “high performance work practices”. With few exceptions these studies have been conducted in contextual settings that do not possess similar operational characteristics to the restaurant service industry. That there are differences in the business models between these industries and hence in the work practices between them is apparent from the results. Additionally, this study was targeted to management in the restaurant industry, not overall employment as the other studies.

The number of library‐related RSS and Atom applications is increasing daily. But, as yet, the formats and technology involved are far from stable. This article looks at the current state of the field, discusses future developments and considers implications for the library.