Author
Listed:
- Martin Bicher
- Claire Rippinger
- Melanie Zechmeister
- Beate Jahn
- Gaby Sroczynski
- Nikolai Mühlberger
- Julia Santamaria-Navarro
- Christoph Urach
- Dominik Brunmeir
- Uwe Siebert
- Niki Popper
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.
Suggested Citation
Martin Bicher & Claire Rippinger & Melanie Zechmeister & Beate Jahn & Gaby Sroczynski & Nikolai Mühlberger & Julia Santamaria-Navarro & Christoph Urach & Dominik Brunmeir & Uwe Siebert & Niki Popper, 2022.
"An iterative algorithm for optimizing COVID-19 vaccination strategies considering unknown supply,"
PLOS ONE, Public Library of Science, vol. 17(5), pages 1-12, May.
Handle:
RePEc:plo:pone00:0265957
DOI: 10.1371/journal.pone.0265957
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0265957. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.