Approximate dynamic programming for the dispatch of military medical evacuation assets

DOI10.1016/j.ejor.2016.04.017zbMath1346.90857OpenAlexW2341067627MaRDI QIDQ323422

Brian J. Lunday, Matthew J. Robbins, Aaron J. Rettke

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.017

zbMATH Keywords

Markov decision processesapproximate dynamic programmingemergency medical dispatchleast squares temporal differencesmilitary medical evacuation (MEDEVAC)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (8)

Approximate dynamic programming for the military inventory routing problem ⋮ Enhancing Benders decomposition algorithm to solve a combat logistics problem ⋮ Examining military medical evacuation dispatching policies utilizing a Markov decision process model of a controlled queueing system ⋮ Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem ⋮ An approximate dynamic programming approach for comparing firing policies in a networked air defense environment ⋮ Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies ⋮ Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming ⋮ Surrender contagion in life insurance

Cites Work

• Unnamed Item
• Unnamed Item
• A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Optimal dispatching strategies for emergency vehicles to increase patient survivability
• Approximate policy iteration: a survey and some new methods
• Approximate Dynamic Programming for Ambulance Redeployment
• Approximate Dynamic Programming
• A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
• Spatial Process Simulation
• Ambulance location for maximum survival
• What you should know about approximate dynamic programming
• A Markovian Decision Model for Deciding How Many Fire Companies to Dispatch
• 10.1162/1532443041827907
• Spectra of some self-exciting and mutually exciting point processes
• Response Areas for Two Emergency Units
• Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage

This page was built for publication: Approximate dynamic programming for the dispatch of military medical evacuation assets