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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 288; číslo 1; s. 391 - 416
Hlavní autoři:	McKenna, Rebekah S., Robbins, Matthew J., Lunday, Brian J., McCormack, Ian M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.05.2020 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!