Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Business

PDF

Air Force Institute of Technology

Approximate dynamic programming

Articles 1 - 1 of 1

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Resupply Operations Of A Dispersed Infantry Brigade Combat Team Using Approximate Dynamic Programming, Camero K. Song Mar 2021

Resupply Operations Of A Dispersed Infantry Brigade Combat Team Using Approximate Dynamic Programming, Camero K. Song

Theses and Dissertations

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.