Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem

被引:13
|
作者
Jenkins, Phillip R. [1 ]
Robbins, Matthew J. [1 ]
Lunday, Brian J. [1 ]
机构
[1] Air Force Inst Technol, Dept Operat Sci, 2950 Hobson Way, Wright Patterson AFB, OH 45433 USA
关键词
OR in defense; Approximate dynamic programming; Markov decision process; Support vector regression; Military MEDEVAC; DECISION-PROCESS MODEL; RELOCATION;
D O I
10.1016/j.ejor.2020.08.004
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Military medical planners must consider how aeromedical evacuation (MEDEVAC) assets will be utilized when preparing for and supporting combat operations. This research examines the MEDEVAC dispatching, preemption-rerouting, and redeployment (DPR) problem. The intent of this research is to determine high-quality DPR policies that improve the performance of United States Army MEDEVAC systems and ultimately increase the combat casualty survivability rate. A discounted, infinite-horizon Markov decision process (MDP) model of the MEDEVAC DPR problem is formulated and solved via an approximate dynamic programming (ADP) strategy that utilizes a support vector regression value function approximation scheme within an approximate policy iteration algorithmic framework. The objective is to maximize the expected total discounted reward attained by the system. The applicability of the MDP model is examined via a notional, representative planning scenario based on high-intensity combat operations to defend Azerbaijan against a notional aggressor. Computational experimentation is performed to determine how selected problem features and algorithmic features affect the quality of solutions attained by the ADP-generated DPR policies and to assess the efficacy of the proposed solution methodology. The results from the computational experiments indicate the ADP-generated policies significantly outperform the two benchmark policies considered. Moreover, the results reveal that the average service time of high-precedence, time-sensitive requests decreases when an ADP policy is adopted during high-intensity conflicts. As the rate at which requests enter the MEDEVAC system increases, the performance gap between the ADP policy and the first benchmark policy (i.e., the currently practiced, closest-available dispatching policy) increases substantially. Conversely, as the rate at which requests enter the system decreases, the ADP performance improvement over both benchmark policies decreases, indicating the ADP policy provides little-to-no benefit over a myopic approach (e.g., as utilized in the benchmark policies) when the intensity of a conflict is low. Ultimately, this research informs the development and implementation of future tactics, techniques, and procedures for military MEDEVAC operations. Published by Elsevier B.V.
引用
收藏
页码:132 / 143
页数:12
相关论文
共 50 条
  • [1] Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
    Jenkins, Phillip R.
    Robbins, Matthew J.
    Lunday, Brian J.
    [J]. INFORMS JOURNAL ON COMPUTING, 2021, 33 (01) : 2 - 26
  • [2] Approximate dynamic programming for the aeromedical evacuation dispatching problem: Value function approximation utilizing multiple level aggregation
    Robbins, Matthew J.
    Jenkins, Phillip R.
    Bastian, Nathaniel D.
    Lunday, Brian J.
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 91
  • [3] Approximate Dynamic Programming for Ambulance Redeployment
    Maxwell, Matthew S.
    Restrepo, Mateo
    Henderson, Shane G.
    Topaloglu, Huseyin
    [J]. INFORMS JOURNAL ON COMPUTING, 2010, 22 (02) : 266 - 281
  • [4] Approximate dynamic programming for the dispatch of military medical evacuation assets
    Rettke, Aaron J.
    Robbins, Matthew J.
    Lunday, Brian J.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (03) : 824 - 839
  • [5] AMBULANCE REDEPLOYMENT: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH
    Maxwell, Matthew S.
    Henderson, Shane G.
    Topaloglu, Huseyin
    [J]. PROCEEDINGS OF THE 2009 WINTER SIMULATION CONFERENCE (WSC 2009 ), VOL 1-4, 2009, : 1801 - 1811
  • [6] Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
    Schmid, Verena
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (03) : 611 - 621
  • [7] Solving the joint military medical evacuation problem via a random forest approximate dynamic programming approach
    Rodriguez, Channel A.
    Jenkins, Phillip R.
    Robbins, Matthew J.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2023, 221
  • [8] Approximate dynamic programming for the military inventory routing problem
    McKenna, Rebekah S.
    Robbins, Matthew J.
    Lunday, Brian J.
    McCormack, Ian M.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 391 - 416
  • [9] Approximate dynamic programming for the military inventory routing problem
    Rebekah S. McKenna
    Matthew J. Robbins
    Brian J. Lunday
    Ian M. McCormack
    [J]. Annals of Operations Research, 2020, 288 : 391 - 416
  • [10] An approximate dynamic programming approach to tackling mass evacuation operations
    Rempel, Mark
    Shiell, Nicholi
    Tessier, Kaeden
    [J]. 2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,