Resupply Operations of a Dispersed Infantry Brigade Combat Team using Approximate Dynamic Programming

Abstract

Military sustainment planners must consider the effective employment of Cargo Unmanned Aerial Vehicles (CUAVs) into resupply operations under austere threat conditions. Viewed as an inventory routing problem, the complexities of resupplying dislocated Forward Operating Bases (FOBs) under dangerous and dynamic conditions warrant additional features to the baseline problem. This research models a military stochastic inventory routing problem with multiple routing (MIL SIRP- MR) as a Markov decision process (MDP) model and provides high-quality policy solutions using a combination of approximate dynamic programming and ordinal optimization techniques.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 2021
Accession Number
AD1180369

Entities

People

  • Camero K. Song

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Biomedical
  • Human Systems

DTIC Thesaurus Topics

  • Afghanistan Conflict
  • Air Force
  • Aircrafts
  • Algorithms
  • Computer Programming
  • Department Of Defense
  • Dynamic Programming
  • Experimental Design
  • Information Systems
  • Kernel Functions
  • Knowledge Management
  • Literature Surveys
  • Logistics
  • Operations Research
  • Optimization
  • Sustainment
  • Systems Engineering
  • United States
  • Unmanned Aerial Vehicles
  • Unmanned Systems
  • Vehicles
  • Warfare

Readers

  • Aerospace logistics and air mobility.
  • Operations Research

Technology Areas

  • Autonomy
  • Autonomy - UAVs