An iterative algorithm for optimizing COVID-19 vaccination strategies considering unknown supply

一种考虑未知供应量的COVID-19疫苗接种策略优化迭代算法

阅读:1

Abstract

BACKGROUND AND OBJECTIVE: The distribution of the newly developed vaccines presents a great challenge in the ongoing SARS-CoV-2 pandemic. Policy makers must decide which subgroups should be vaccinated first to minimize the negative consequences of the pandemic. These decisions must be made upfront and under uncertainty regarding the amount of vaccine doses available at a given time. The objective of the present work was to develop an iterative optimization algorithm, which provides a prioritization order of predefined subgroups. The results of this algorithm should be optimal but also robust with respect to potentially limited vaccine supply. METHODS: We present an optimization meta-heuristic which can be used in a classic simulation-optimization setting with a simulation model in a feedback loop. The meta-heuristic can be applied in combination with any epidemiological simulation model capable of depicting the effects of vaccine distribution to the modeled population, accepts a vaccine prioritization plan in a certain notation as input, and generates decision making relevant variables such as COVID-19 caused deaths or hospitalizations as output. We finally demonstrate the mechanics of the algorithm presenting the results of a case study performed with an epidemiological agent-based model. RESULTS: We show that the developed method generates a highly robust vaccination prioritization plan which is proven to fulfill an elegant supremacy criterion: the plan is equally optimal for any quantity of vaccine doses available. The algorithm was tested on a case study in the Austrian context and it generated a vaccination plan prioritization favoring individuals age 65+, followed by vulnerable groups, to minimize COVID-19 related burden. DISCUSSION: The results of the case study coincide with the international policy recommendations which strengthen the applicability of the approach. We conclude that the path-dependent optimum optimum provided by the algorithm is well suited for real world applications, in which decision makers need to develop strategies upfront under high levels of uncertainty.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。