Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Determining nodal capacities for military distribution problems

Determining nodal capacities for military distribution problems 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/approachSupply chain network design, mixed integer programs, heuristics and regression are used in this paper.FindingsThis 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/implicationsThis research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads.Practical implicationsThis 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/valueThis 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Defense Analytics and Logistics Emerald Publishing

Determining nodal capacities for military distribution problems

Download PDF
21 pages

Loading next page...
 
/lp/emerald-publishing/determining-nodal-capacities-for-military-distribution-problems-f0yOvnvsgO
Publisher
Emerald Publishing
Copyright
© In accordance with section 105 of the US Copyright Act, this work has been produced by a US government employee and shall be considered a public domain work, as copyright protection is not available.
ISSN
2399-6439
DOI
10.1108/jdal-03-2019-0006
Publisher site
See Article on Publisher Site

Abstract

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/approachSupply chain network design, mixed integer programs, heuristics and regression are used in this paper.FindingsThis 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/implicationsThis research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads.Practical implicationsThis 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/valueThis 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.

Journal

Journal of Defense Analytics and Logistics – Emerald Publishing

Published: Dec 6, 2019

Keywords: Heuristics; Regression analysis; Mixed integer programming; Supply chain network design; Capacity expansion and contraction

References

  • Capacity planning and warehouse location in supply chains with uncertain demands
    Aghezzaf, E.
  • Distribution network design: new problems and related models
    Ambrosino, D.; Scutella, M.G.
  • Designing a distribution network in a supply chain system: formulation and efficient solution procedure
    Amiri, A.
  • On solving complex multi-period location models using simulated annealing
    Antunes, A.; Peeters, D.
  • Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
    Badri, H.; Bashiri, M.; Hejazi, T.H.
  • A new approach to tactical and strategic planning in production–distribution networks
    Bashiri, M.; Badri, H.; Talebi, J.
  • Optimal capacity expansion over an infinite horizon
    Bean, J.C.; Smith, R.L.
  • A branch-and-cut method for the capacitated location-routing problem
    Belenguer, J.M.; Benavent, E.; Prins, C.; Prodhon, C.; Calvo, R.W.
  • A distribution network design problem in the automotive industry: MIP formulation and heuristics
    Boujelben, M.K.; Gicquel, C.; Minoux, M.
  • A MILP model and heuristic approach for facility location under multiple operational constraints
    Boujelben, M.K.; Gicquel, C.; Minoux, M.
  • A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
    Castro, J.; Nasini, S.; Saldanha-da-Gama, F.
  • A multi-period facility location problem with modular capacity adjustments and flexible demand fulfillment
    Correia, I.; Melo, T.
  • Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions
    Correia, I.; Melo, T.; Saldanha-da-Gama, F.
  • Dynamic design and re-design of multi-echelon, multi-product logistics networks with outsourcing opportunities: a computational study
    Cortinhal, M.J.; Lopes, M.J.; Melo, M.T.
  • A survey on two-echelon routing problems
    Cuda, R.; Guastaroba, G.; Speranza, M.G.
  • Investment and capacity choice under uncertain demand
    Dangl, T.
  • A multi-period capacitated school location problem with modular equipment and closest assignment considerations
    Delmelle, E.M.; Thill, J.C.; Peeters, D.; Thomas, I.
  • A dynamic location problem with maximum decreasing capacities
    Dias, J.; Captivo, M.E.; Clímaco, J.
  • Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
    Eskigun, E.; Uzsoy, R.; Preckel, P.V.; Beaujon, G.; Krishnan, S.; Tew, J.D.
  • The multiregion dynamic capacity expansion problem, part I
    Fong, C.O.; Srinivasan, V.
  • The multiregion dynamic capacity expansion problem: an improved heuristic
    Fong, C.O.; Srinivasan, V.
  • Analysis of the lead time and learning for capacity expansions
    Gaimon, C.; Burgess, R.H.
  • Multicommodity distribution system design by benders decomposition
    Geoffrion, A.M.; Graves, G.W.
  • Supply chain network design under uncertainty: a comprehensive review and future research directions
    Govindan, K.; Fattahi, M.; Keyvanshokooh, E.
  • Dynamic capacity expansion problem with deferred expansion and age-dependent shortage cost
    Hsu, V.N.
  • Incorporating location, routing and inventory decisions in supply chain network design
    Javid, A.A.; Azad, N.
  • Solving a dynamic facility location problem with partial closing and reopening
    Jena, S.D.; Cordeau, J.; Gendron, B.
  • A review of multi-factor capacity expansion models for manufacturing plants: searching for a holistic decision aid
    Julka, N.; Baines, T.; Tjahjono, B.; Lendermann, P.; Vitanov, V.
  • Multifacility-type capacity expansion planning: algorithms and complexities
    Lee, S.B.; Luss, H.
  • A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon
    Melo, M.T.; Nickel, S.; Saldanha-da-Gama, F.
  • A coordinated production planning model with capacity expansion and inventory management
    Rajagopalan, S.; Swaminathan, J.M.
  • Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs
    Sadjady, H.; Davoudpour, H.
  • An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes
    Shulman, A.
  • Multiperiod capacity expansion in globally dispersed regions
    Syam, S.S.
  • A new bi-objective location-routing-inventory problem with fuzzy demands
    Tavakkoli-Moghaddam, R.; Raziei, Z.
  • A dynamic model for facility location in the design of complex supply chains
    Thanh, P.N.; Bostel, N.; Péton, O.
  • A linear relaxation-based heuristic approach for logistics network design
    Thanh, P.N.; Péton, O.; Bostel, N.
  • Openxlsx: read, write and edit xlsx files
    Walker, A.; Braglia, L.
  • Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction
    Wilhelm, W.; Han, X.; Lee, C.