一种近似动态规划方法在择期病人入院控制中的应用
An approximate dynamic programming approach to the admission control of elective patients
摘要:
在本文中,我们提出了一个近似的动态规划(ADP)算法来解决一个马尔可夫决策过程(MDP)制定的选修病人的入院控制。为了公平有效地管理来自多个专科的择期患者,我们建立了一个等待列表,并为每个患者分配一个随时间变化的动态优先级评分。然后,考虑到病人的随机到达,每周做出连续的决定。在每个周末,我们从等待名单中选择下一周接受治疗的患者。通过在无限范围内最小化MDP的费用函数,我们寻求在患者的等待时间和手术资源的过度利用之间实现最佳权衡。考虑到现实规模的问题的大规模造成的维数的诅咒,我们首先分析的MDP的结构特性,并提出了一种算法,便于搜索最佳的行动。然后,我们开发了一种新的基于并行学习的ADP算法的解决方案技术。实验结果表明,与传统的动态规划方法相比,所提出的算法具有更少的计算时间。此外,该算法被证明是能够计算高质量的接近最优的政策,现实规模的问题。
英文摘要:
In this paper, we propose an approximate dynamic programming (ADP) algorithm to solve a Markov decision process (MDP) formulation for the admission control of elective patients. To manage the elective patients from multiple specialties equitably and efficiently, we establish a waiting list and assign each patient a time-dependent dynamic priority score. Then, taking the random arrivals of patients into account, sequential decisions are made on a weekly basis. At the end of each week, we select the patients to be treated in the following week from the waiting list. By minimizing the cost function of the MDP over an infinite horizon, we seek to achieve the best trade-off between the patients' waiting times and the over-utilization of surgical resources. Considering the curses of dimensionality resulting from the large scale of realistically sized problems, we first analyze the structural properties of the MDP and propose an algorithm that facilitates the search for best actions. We then develop a novel reinforcement-learning-based ADP algorithm as the solution technique. Experimental results reveal that the proposed algorithms consume much less computation time in comparison with that required by conventional dynamic programming methods. Additionally, the algorithms are shown to be capable of computing high-quality near-optimal policies for realistically sized problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。