TY - JOUR
T1 - Optimization methods for decision making in disease prevention and epidemic control
AU - Deng, Yan
AU - Shen, Siqian
AU - Vorobeychik, Yevgeniy
PY - 2013/11
Y1 - 2013/11
N2 - This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i) vaccinating individuals and (ii) closing locations, given respective budgets with the goal of minimizing the expected number of infected individuals after intervention. The spread of diseases is inherently stochastic due to the uncertainty about disease transmission and human interaction. We use a bipartite graph to represent individuals' propensities of visiting a set of location, and formulate two integer nonlinear programming models to optimize choices of individuals to vaccinate and locations to close. Our first model assumes that if a location is closed, its visitors stay in a safe location and will not visit other locations. Our second model incorporates compensatory behavior by assuming multiple behavioral groups, always visiting the most preferred locations that remain open. The paper develops algorithms based on a greedy strategy, dynamic programming, and integer programming, and compares the computational efficacy and solution quality. We test problem instances derived from daily behavior patterns of 100 randomly chosen individuals (corresponding to 195 locations) in Portland, Oregon, and provide policy insights regarding the use of the two DPEC models.
AB - This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i) vaccinating individuals and (ii) closing locations, given respective budgets with the goal of minimizing the expected number of infected individuals after intervention. The spread of diseases is inherently stochastic due to the uncertainty about disease transmission and human interaction. We use a bipartite graph to represent individuals' propensities of visiting a set of location, and formulate two integer nonlinear programming models to optimize choices of individuals to vaccinate and locations to close. Our first model assumes that if a location is closed, its visitors stay in a safe location and will not visit other locations. Our second model incorporates compensatory behavior by assuming multiple behavioral groups, always visiting the most preferred locations that remain open. The paper develops algorithms based on a greedy strategy, dynamic programming, and integer programming, and compares the computational efficacy and solution quality. We test problem instances derived from daily behavior patterns of 100 randomly chosen individuals (corresponding to 195 locations) in Portland, Oregon, and provide policy insights regarding the use of the two DPEC models.
KW - 0-1 Knapsack problem
KW - Compensatory behavior modeling
KW - Disease prevention and intervention
KW - Dynamic programming
KW - Dynamic/static disease control
UR - http://www.scopus.com/inward/record.url?scp=84887021973&partnerID=8YFLogxK
U2 - 10.1016/j.mbs.2013.09.007
DO - 10.1016/j.mbs.2013.09.007
M3 - Article
C2 - 24121040
AN - SCOPUS:84887021973
SN - 0025-5564
VL - 246
SP - 213
EP - 227
JO - Mathematical Biosciences
JF - Mathematical Biosciences
IS - 1
ER -