Modularity maximization to design contiguous policy zones for pandemic response

被引:6
作者
Baghersad, Milad [1 ]
Emadikhiav, Mohsen [1 ]
Huang, C. Derrick [1 ]
Behara, Ravi S. [1 ]
机构
[1] Florida Atlantic Univ, Coll Business, Dept Informat Technol & Operat Management, Boca Raton, FL 33431 USA
关键词
OR in disaster relief; Contiguous community detection; Modularity maximization; Pandemic response coordination; Column-generation algorithm; BRANCH-AND-PRICE; DENSITY MAXIMIZATION; DISTRICTING PROBLEM; EFFICIENT; ALGORITHM; MODEL;
D O I
10.1016/j.ejor.2022.01.012
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The health and economic devastation caused by the COVID-19 pandemic has created a significant global humanitarian disaster. Pandemic response policies guided by geospatial approaches are appropriate additions to traditional epidemiological responses when addressing this disaster. However, little is known about finding the optimal set of locations or jurisdictions to create policy coordination zones. In this study, we propose optimization models and algorithms to identify coordination communities based on the natural movement of people. To do so, we develop a mixed-integer quadratic-programming model to maximize the modularity of detected communities while ensuring that the jurisdictions within each community are contiguous. To solve the problem, we present a heuristic and a column-generation algorithm. Our computational experiments highlight the effectiveness of the models and algorithms in various instances. We also apply the proposed optimization-based solutions to identify coordination zones within North Carolina and South Carolina, two highly interconnected states in the U.S. Results of our case study show that the proposed model detects communities that are significantly better for coordinating pandemic related policies than the existing geopolitical boundaries. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:99 / 112
页数:14
相关论文
共 69 条
[1]   Column generation algorithms for exact modularity maximization in networks [J].
Aloise, Daniel ;
Cafieri, Sonia ;
Caporossi, Gilles ;
Hansen, Pierre ;
Perron, Sylvain ;
Liberti, Leo .
PHYSICAL REVIEW E, 2010, 82 (04)
[2]  
[Anonymous], 2020, LANCET, V396, P447, DOI 10.1016/S0140-6736(20)31749-9
[3]  
[Anonymous], PHYS REV E 2
[4]  
[Anonymous], Fiscal Monitor, October 2020: Policies for the Recovery
[5]   Multi-scale detection of hierarchical community architecture in structural and functional brain networks [J].
Ashourvan, Arian ;
Telesford, Qawi K. ;
Verstynen, Timothy ;
Vettel, Jean M. ;
Bassett, Danielle S. .
PLOS ONE, 2019, 14 (05)
[6]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[7]   A decision support system for the electrical power districting problem [J].
Bergey, PK ;
Ragsdale, CT ;
Hoskote, M .
DECISION SUPPORT SYSTEMS, 2003, 36 (01) :1-17
[8]   A simulated annealing genetic algorithm for the electrical power districting problem [J].
Bergey, PK ;
Ragsdale, CT ;
Hoskote, M .
ANNALS OF OPERATIONS RESEARCH, 2003, 121 (1-4) :33-55
[9]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[10]   A tabu search heuristic and adaptive memory procedure for political districting [J].
Bozkaya, B ;
Erkut, E ;
Laporte, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) :12-26