Optimizing vaccine distribution networks in low and middle-income countries

•We address the design of WHO-EPI vaccine distribution chains in low and middle income countries.•A mixed integer programming model is developed.•An MIP based algorithm is developed to solve very large problem formulations.•Data derived from four countries is used to analyze the algorithm's per...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Omega (Oxford) Jg. 99; S. 102197
Hauptverfasser: Yang, Yuwen, Bidkhori, Hoda, Rajgopal, Jayant
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.03.2021
Schlagworte:
ISSN:0305-0483, 1873-5274
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We address the design of WHO-EPI vaccine distribution chains in low and middle income countries.•A mixed integer programming model is developed.•An MIP based algorithm is developed to solve very large problem formulations.•Data derived from four countries is used to analyze the algorithm's performance.•It is shown that significant savings can accrue from redesigning the distribution network. Vaccination has been proven to be the most effective method to prevent infectious diseases. However, there are still millions of children in low and middle-income countries who are not covered by routine vaccines and remain at risk. The World Health Organization – Expanded Programme on Immunization (WHO-EPI) was designed to provide universal childhood vaccine access for children across the world and in this work, we address the design of the distribution network for WHO-EPI vaccines. In particular, we formulate the network design problem as a mixed integer program (MIP) and present a new algorithm for typical problems that are too large to be solved using commercial MIP software. We test the algorithm using data derived from four different countries in sub-Saharan Africa and show that the algorithm is able to obtain high-quality solutions for even the largest problems within a few minutes.
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2020.102197