Approximate dynamic programming for the military inventory routing problem

The United States Army can benefit from effectively utilizing cargo unmanned aerial vehicles (CUAVs) to perform resupply operations in combat environments to reduce the use of manned (ground and aerial) resupply that incurs risk to personnel. We formulate a Markov decision process (MDP) model of an...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 288; no. 1; pp. 391 - 416
Main Authors:	McKenna, Rebekah S., Robbins, Matthew J., Lunday, Brian J., McCormack, Ian M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2020 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Approximation theory Benchmarks Business and Management Combinatorics Dispersion Dynamic programming Inventory control Iterative methods Management Markov processes Methods Military Military supplies Operations research Operations Research/Decision Theory Original Research Policies Route planning Theory of Computation Unmanned aerial vehicles United States United States > US Approximate dynamic programming Inventory routing problem Least squares temporal differences Markov decision processes Military
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!