Branch-and-Price for Prescriptive Contagion Analytics

被引:0
|
作者
Jacquillat, Alexandre [1 ]
Li, Michael Lingzhi [2 ]
Rame, Martin [3 ]
Wang, Kai [4 ]
机构
[1] MIT, Sloan Sch Management, Cambridge, MA 02142 USA
[2] Harvard Univ, Harvard Business Sch, Cambridge, MA 02163 USA
[3] MIT, Operat Res Ctr, Cambridge, MA 02139 USA
[4] Tsinghua Univ, Sch Vehicle & Mobil, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
contagion analytics; column generation; branch and price; dynamic programming; COVID-19; INTEGER NONLINEAR PROGRAMS; GLOBAL OPTIMIZATION; PRODUCT DIFFUSION; MODEL; RELAXATION; EPIDEMICS; ALLOCATION; GROWTH;
D O I
10.1287/opre.2023.0308
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Contagion models are ubiquitous in epidemiology, social sciences, engineering, and management. This paper formulates a prescriptive contagion analytics model where a decision maker allocates shared resources across multiple segments of a population, each governed by continuous -time contagion dynamics. These problems feature a large-scale mixed -integer nonconvex optimization structure with constraints governed by ordinary differential equations. This paper develops a branch -and -price methodology for this class of problems based on (i) a set partitioning reformulation; (ii) a column generation decomposition; (iii) a state -clustering algorithm for discrete -decision continuous -state dynamic programming; and (iv) a tripartite branching scheme to circumvent nonlinearities. We apply the methodology to four real -world cases: vaccine distribution, vaccination centers deployment, content promotion, and congestion mitigation. Extensive experiments show that the algorithm scales to large and otherwise -intractable instances, outperforming stateof-the-art benchmarks. Our methodology provides practical benefits in contagion systems-In particular, we show that it can increase the effectiveness of a vaccination campaign in a setting replicating the rollout of COVID-19 vaccines in 2021. We provide an open -source implementation of the methodology to enable replication.
引用
下载
收藏
页数:24
相关论文
共 50 条
  • [1] Optimal placement by branch-and-price
    Ramachandaran, Pradeep
    Agnihotri, Ameya R.
    Ono, Satoshi
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    Madden, Patrick H.
    ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2005, : 337 - 342
  • [2] Branching in branch-and-price: a generic scheme
    Vanderbeck, Francois
    MATHEMATICAL PROGRAMMING, 2011, 130 (02) : 249 - 294
  • [3] Branch-and-price for routing with probabilistic customers
    Lagos, Felipe
    Klapp, Mathias A.
    Toriello, Alejandro
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
  • [4] Cutting Planes for Branch-and-Price Algorithms
    Desaulniers, Guy
    Desrosiers, Jacques
    Spoorendonk, Simon
    NETWORKS, 2011, 58 (04) : 301 - 310
  • [5] Branching in branch-and-price: a generic scheme
    François Vanderbeck
    Mathematical Programming, 2011, 130 : 249 - 294
  • [6] Primal Heuristics for Branch-and-Price Algorithms
    Luebbecke, Marco
    Puchert, Christian
    OPERATIONS RESEARCH PROCEEDINGS 2011, 2012, : 65 - 70
  • [7] A branch-and-price algorithm for a targeting problem
    Kwon, Ojeong
    Lee, Kyungsik
    Kang, Donghan
    Park, Sungsoo
    NAVAL RESEARCH LOGISTICS, 2007, 54 (07) : 732 - 741
  • [8] Branch-and-Price for Personalized Multiactivity Tour Scheduling
    Restrepo, Maria I.
    Gendron, Bernard
    Rousseau, Louis-Martin
    INFORMS JOURNAL ON COMPUTING, 2016, 28 (02) : 334 - 350
  • [9] A branch-and-price algorithm for the ring/ring problem
    Osorio, Cecilia Lescano
    Hoshino, Edna Ayako
    PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 516 - 522
  • [10] A Branch-and-Price Algorithm for the Multiple Knapsack Problem
    Lalonde, Olivier
    Cote, Jean-Francois
    Gendron, Bernard
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 3134 - 3150