Purpose
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.
Design/methodology/approach
Supply chain network design, mixed integer programs, heuristics and regression are used in this paper.
Findings
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.
Research limitations/implications
This research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads.
Practical implications
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.
Originality/value
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.
Best Practices for Simulated Annealing in Multiprocessor Task Distribution Problems