Approximate dynamic programming for the military inventory routing problem

DOI10.1007/S10479-019-03469-8MaRDI QIDQ2173135zbMATH OpenOpenAlexWikidataFDO

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

Publication date 22 April 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-019-03469-8

zbMATH Keywords

approximate dynamic programminginventory routing problemleast squares temporal differencesMarkov decision processesmilitary

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Approximate dynamic programming for military medical evacuation dispatching policies
• Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
• An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach)
• Approximate dynamic programming methods for an inventory allocation problem under uncertainty

Cites work

• 10.1162/1532443041827907
• Approximate dynamic programming for military medical evacuation dispatching policies
• Approximate dynamic programming for missile defense interceptor fire control
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Approximate dynamic programming. Solving the curses of dimensionality
• Approximate policy iteration: a survey and some new methods
• Commentary: Post-decision states and separable approximations are powerful tools of approximate dynamic programming
• Designing and reporting on computational experiments with heuristic methods
• Dynamic programming and optimal control. Vol. 1.
• Dynamic programming and optimal control. Vol. 2
• Instrumental variable methods for system identification
• Linear least-squares algorithms for temporal difference learning
• The Stochastic Inventory Routing Problem with Direct Deliveries

Cited in

(9)

• Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Approximate dynamic programming for military medical evacuation dispatching policies
• Sequential decision-making under uncertainty: a robust MDPs review
• Dynamic programming in inventory management: a review
• An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
• Modified monotone policy iteration for interpretable policies in Markov decision processes and the impact of state ordering rules
• Stochastic dynamic inventory-routing: a comprehensive review

This page was built for publication: Approximate dynamic programming for the military inventory routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173135)