Manoj Pathak
Early on in the COVID-19 pandemic in Wuhan, there was an unfair distribution of patients among hospitals and a delay in the delivery of medical supplies, which lowered the survival rate of infected people. This research suggests a strategy for allocating medical supplies per vehicle to each hospital and the supply sequence per vehicle to each hospital in order to build a quick and precise supply scheme for medical materials in significant public health emergencies. The following two sub-problems are specifically solved in this paper: calculating the medical supplies that may be transported in each vehicle to each hospital; and calculating the shortest transportation times and matching routes from any distribution facility to any hospital. It is carried out the strategy for resolving sub-problem by a series of iterations, each of which determines the quickest path from a distribution hub, via one or more hospitals, and back to the hub. This research suggests a distribution strategy for medical supplies in significant public health emergencies, in accordance with the sub problem. To address this problem, a multiple dynamic programming approach that combines a few distinct dynamic programming procedures is suggested.
KeywordsMajor Public Health Emergencies; Medical Supplies; Transportation Scheduling; Covid-19 Pandemic
English 
Spanish 
Chinese 
Russian 
French 
Japanese 
Portuguese 
Hindi