In the early days of the COVID-19 pandemic in Wuhan, there was an unreasonable allocation between hospitals and a lack of timely transportation of medical supplies, which reduced the cure rate of infected cases. To solve the problem, this research proposes a method for scheduling medical supplies in major public health emergencies to develop a rapid and accurate supply scheme for medical materials, including the allocation of medical materials per vehicle to each hospital and the supply sequence per vehicle to each hospital. Specifically, this paper solves the following two sub-problems: (1) calculating the shortest transportation times and the corresponding routes from any distributing center(s) to any hospital(s); (2) calculating the medical supplies per vehicle transporting to each hospital. The method of solving sub-problem 1 is performed by multiple iterations, each of which calculates the shortest route from a distributing center, through one or more hospitals, and back to the distributing center. According to sub-problem 2, this research proposes a distribution model of medical supplies in major public health emergencies. A multiple dynamic programming algorithm which is a combination of some separated dynamic programming operations is proposed to solve this model. This algorithm also realizes the rapid updating of the scheme in the context of the changing number of vehicles. The first sub-problem can be solved in normal times, while the second one should be solved on the premise of obtaining the corresponding data after the occurrence of a major public health emergency. In the case study section, the whole method proposed in this research is employed in the medical supplies scheduling in the early stage of the COVID-19 outbreak in Wuhan, which proves the availability of the method. The main innovation of the method proposed in this research is that the problems can obtain the optimal solution while the time complexity is within an acceptable range.

武汉COVID-19大流行初期，医院之间分配不合理，医疗物资运输不及时，降低了感染病例的治愈率。针对该问题，本研究提出重大突发公共卫生事件医疗物资调度方法，制定快速准确的医疗物资供应方案，包括每车医疗物资到各医院的分配和每车到各医院的供应顺序。医院。具体来说，本文解决了以下两个子问题：（1）计算从任何配送中心到任何医院的最短运输时间和相应的路线；(2)计算每辆车运往各医院的医疗物资。解决子问题1的方法是通过多次迭代进行的，每次迭代计算从一个配送中心，经过一个或多个医院，回到配送中心的最短路线。根据子问题2，本研究提出重大突发公共卫生事件医疗物资分配模型。提出了一种多动态规划算法，它是一些分离的动态规划操作的组合，以解决该模型。该算法还实现了方案在车辆数量变化情况下的快速更新。第一个子问题平时可以解决，第二个子问题需要在重大突发公共卫生事件发生后，在获得相应数据的前提下解决。在案例研究部分，本研究提出的整个方法应用于武汉COVID-19爆发初期的医疗物资调度，证明了该方法的可用性。本研究提出的方法的主要创新点在于问题能够在时间复杂度在可接受范围内的情况下得到最优解。