IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v304y2023i1p99-112.html
   My bibliography  Save this article

Modularity maximization to design contiguous policy zones for pandemic response

Author

Listed:
  • Baghersad, Milad
  • Emadikhiav, Mohsen
  • Huang, C. Derrick
  • Behara, Ravi S.

Abstract

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.

Suggested Citation

  • Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
  • Handle: RePEc:eee:ejores:v:304:y:2023:i:1:p:99-112
    DOI: 10.1016/j.ejor.2022.01.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722000303
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2022.01.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Edward L. Glaeser & Caitlin S. Gorback & Stephen J. Redding, 2020. "How Much Does COVID-19 Increase with Mobility? Evidence from New York and Four Other U.S. Cities," Working Papers 2020-22, Princeton University. Economics Department..
    2. Djordje Dugošija & Aleksandar Savić & Zoran Maksimović, 2020. "A new integer linear programming formulation for the problem of political districting," Annals of Operations Research, Springer, vol. 288(1), pages 247-263, May.
    3. Pablo D. Fajgelbaum & Amit Khandelwal & Wookun Kim & Cristiano Mantovani & Edouard Schaal, 2021. "Optimal Lockdown in a Commuting Network," American Economic Review: Insights, American Economic Association, vol. 3(4), pages 503-522, December.
    4. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    5. Camacho-Collados, M. & Liberatore, F. & Angulo, J.M., 2015. "A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector," European Journal of Operational Research, Elsevier, vol. 246(2), pages 674-684.
    6. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    7. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    8. Santiago, Rafael & Lamb, Luís C., 2017. "Efficient modularity density heuristics for large graphs," European Journal of Operational Research, Elsevier, vol. 258(3), pages 844-865.
    9. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    10. GARFINKEL, Robert S. & NEMHAUSER, Geroge L., 1970. "Optimal political districting by implicit enumeration techniques," LIDAM Reprints CORE 54, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Önal, Hayri & Wang, Yicheng & Dissanayake, Sahan T.M. & Westervelt, James D., 2016. "Optimal design of compact and functionally contiguous conservation management areas," European Journal of Operational Research, Elsevier, vol. 251(3), pages 957-968.
    12. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    13. Haase, Knut & Müller, Sven, 2014. "Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints," European Journal of Operational Research, Elsevier, vol. 237(2), pages 677-689.
    14. Serina Chang & Emma Pierson & Pang Wei Koh & Jaline Gerardin & Beth Redbird & David Grusky & Jure Leskovec, 2021. "Mobility network models of COVID-19 explain inequities and inform reopening," Nature, Nature, vol. 589(7840), pages 82-87, January.
    15. Hiwa Farughi & Madjid Tavana & Sobhan Mostafayi & Francisco J. Santos Arteaga, 2020. "A novel optimization model for designing compact, balanced, and contiguous healthcare districts," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(11), pages 1740-1759, November.
    16. Roland G. Fryer Jr. & Richard Holden, 2011. "Measuring the Compactness of Political Districting Plans," Journal of Law and Economics, University of Chicago Press, vol. 54(3), pages 493-535.
    17. R. S. Garfinkel & G. L. Nemhauser, 1970. "Optimal Political Districting by Implicit Enumeration Techniques," Management Science, INFORMS, vol. 16(8), pages 495-508, April.
    18. Ricca, Federica & Simeone, Bruno, 2008. "Local search algorithms for political districting," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1409-1426, September.
    19. David Holtz & Michael Zhao & Seth G. Benzell & Cathy Y. Cao & Mohammad Amin Rahimian & Jeremy Yang & Jennifer Allen & Avinash Collis & Alex Moehring & Tara Sowrirajan & Dipayan Ghosh & Yunhao Zhang & , 2020. "Interdependence and the cost of uncoordinated responses to COVID-19," Proceedings of the National Academy of Sciences, Proceedings of the National Academy of Sciences, vol. 117(33), pages 19837-19843, August.
    20. Costa, Alberto, 2015. "MILP formulations for the modularity density maximization problem," European Journal of Operational Research, Elsevier, vol. 245(1), pages 14-21.
    21. S. W. Hess & J. B. Weaver & H. J. Siegfeldt & J. N. Whelan & P. A. Zitlau, 1965. "Nonpartisan Political Redistricting by Computer," Operations Research, INFORMS, vol. 13(6), pages 998-1006, December.
    22. Rodolfo Carvajal & Miguel Constantino & Marcos Goycoolea & Juan Pablo Vielma & Andrés Weintraub, 2013. "Imposing Connectivity Constraints in Forest Planning Models," Operations Research, INFORMS, vol. 61(4), pages 824-836, August.
    23. Arian Ashourvan & Qawi K Telesford & Timothy Verstynen & Jean M Vettel & Danielle S Bassett, 2019. "Multi-scale detection of hierarchical community architecture in structural and functional brain networks," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-36, May.
    24. F Caro & T Shirabe & M Guignard & A Weintraub, 2004. "School redistricting: embedding GIS tools with integer programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 836-849, August.
    25. Han, Jialin & Hu, Yaoguang & Mao, Mingsong & Wan, Shuping, 2020. "A multi-objective districting problem applied to agricultural machinery maintenance service network," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1120-1130.
    26. Paul Bergey & Cliff Ragsdale & Mangesh Hoskote, 2003. "A Simulated Annealing Genetic Algorithm for the Electrical Power Districting Problem," Annals of Operations Research, Springer, vol. 121(1), pages 33-55, July.
    27. Laroze, Denise & Neumayer, Eric & Plümper, Thomas, 2021. "COVID-19 does not stop at open borders: Spatial contagion among local authority districts during England's first wave," Social Science & Medicine, Elsevier, vol. 270(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ba, Zhichao & Ma, Yaxue & Cai, Jinyao & Li, Gang, 2023. "A citation-based research framework for exploring policy diffusion: Evidence from China's new energy policies," Technological Forecasting and Social Change, Elsevier, vol. 188(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    2. Antonio Diglio & Stefan Nickel & Francisco Saldanha-da-Gama, 2020. "Towards a stochastic programming modeling framework for districting," Annals of Operations Research, Springer, vol. 292(1), pages 249-285, September.
    3. Eduardo Álvarez-Miranda & Camilo Campos-Valdés & Maurcio Morales Quiroga & Matías Moreno-Faguett & Jordi Pereira, 2020. "A Multi-Criteria Pen for Drawing Fair Districts: When Democratic and Demographic Fairness Matter," Mathematics, MDPI, vol. 8(9), pages 1-26, August.
    4. Christian Haas & Lee Hachadoorian & Steven O Kimbrough & Peter Miller & Frederic Murphy, 2020. "Seed-Fill-Shift-Repair: A redistricting heuristic for civic deliberation," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-34, September.
    5. Han, Jialin & Hu, Yaoguang & Mao, Mingsong & Wan, Shuping, 2020. "A multi-objective districting problem applied to agricultural machinery maintenance service network," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1120-1130.
    6. Balázs Fleiner & Balázs Nagy & Attila Tasnádi, 2017. "Optimal partisan districting on planar geographies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 879-888, December.
    7. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    8. Djordje Dugošija & Aleksandar Savić & Zoran Maksimović, 2020. "A new integer linear programming formulation for the problem of political districting," Annals of Operations Research, Springer, vol. 288(1), pages 247-263, May.
    9. Anderson Kenji Hirose & Cassius Tadeu Scarpin & José Eduardo Pécora Junior, 2020. "Goal programming approach for political districting in Santa Catarina State: Brazil," Annals of Operations Research, Springer, vol. 287(1), pages 209-232, April.
    10. Flavia Bonomo & Diego Delle Donne & Guillermo Durán & Javier Marenco, 2013. "Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census," Interfaces, INFORMS, vol. 43(4), pages 373-384, August.
    11. Fernando Tavares-Pereira & José Figueira & Vincent Mousseau & Bernard Roy, 2007. "Multiple criteria districting problems," Annals of Operations Research, Springer, vol. 154(1), pages 69-92, October.
    12. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2023. "Approximation schemes for districting problems with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 233-248.
    13. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.
    14. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    15. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2021. "Solutions for districting problems with chance-constrained balancing requirements," Omega, Elsevier, vol. 103(C).
    16. Benadè, Gerdus & Ho-Nguyen, Nam & Hooker, J.N., 2022. "Political districting without geography," Operations Research Perspectives, Elsevier, vol. 9(C).
    17. Hyun Kim & Yongwan Chun & Kamyoung Kim, 2015. "Delimitation of Functional Regions Using a p-Regions Problem Approach," International Regional Science Review, , vol. 38(3), pages 235-263, July.
    18. Juan A. Díaz & Dolores E. Luna, 2017. "Primal and dual bounds for the vertex p-median problem with balance constraints," Annals of Operations Research, Springer, vol. 258(2), pages 613-638, November.
    19. Sommer Gentry & Eric Chow & Allan Massie & Dorry Segev, 2015. "Gerrymandering for Justice: Redistricting U.S. Liver Allocation," Interfaces, INFORMS, vol. 45(5), pages 462-480, October.
    20. Ram Gopalan & Steven O. Kimbrough & Frederic H. Murphy & Nicholas Quintus, 2013. "The Philadelphia Districting Contest: Designing Territories for City Council Based Upon the 2010 Census," Interfaces, INFORMS, vol. 43(5), pages 477-489, October.

    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:eee:ejores:v:304:y:2023:i:1:p:99-112. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.