Approximate dynamic programming for the military inventory routing problem

Rebekah S. McKenna; Matthew J. Robbins; Brian J. Lunday; Ian M. McCormack

doi:10.1007/S10479-019-03469-8

Approximate dynamic programming for the military inventory routing problem

Rebekah S. McKenna, Matthew J. Robbins, Brian J. Lunday, Ian M. McCormack

School of Technology

Air Force Institute of Technology

Research output: Contribution to journal › Article › peer-review

Original language	American English
Journal	Annals of Operations Research
Volume	288
DOIs	https://doi.org/10.1007/S10479-019-03469-8
State	Published - May 1 2020

Disciplines

Applied Mathematics
Computer Sciences

Access to Document

10.1007/S10479-019-03469-8License: Unspecified

Cite this

@article{bdddec1c920b44c29edd9f2ef2690052,

title = "Approximate dynamic programming for the military inventory routing problem",

author = "McKenna, \{Rebekah S.\} and Robbins, \{Matthew J.\} and Lunday, \{Brian J.\} and McCormack, \{Ian M.\}",

note = "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 inventory routing problem (IRP) with vehicle loss and direct delivery, which we label the military IRP (MILIRP).",

year = "2020",

month = may,

day = "1",

doi = "10.1007/S10479-019-03469-8",

language = "American English",

volume = "288",

journal = "Annals of Operations Research",

}

TY - JOUR

T1 - Approximate dynamic programming for the military inventory routing problem

AU - McKenna, Rebekah S.

AU - Robbins, Matthew J.

AU - Lunday, Brian J.

AU - McCormack, Ian M.

N1 - 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 inventory routing problem (IRP) with vehicle loss and direct delivery, which we label the military IRP (MILIRP).

PY - 2020/5/1

Y1 - 2020/5/1

UR - https://doi.org/10.1007/s10479-019-03469-8

U2 - 10.1007/S10479-019-03469-8

DO - 10.1007/S10479-019-03469-8

M3 - Article

VL - 288

JO - Annals of Operations Research

JF - Annals of Operations Research

ER -

Approximate dynamic programming for the military inventory routing problem

Disciplines

Access to Document

Other files and links

Cite this