Testing facility location and dynamic capacity planning for pandemics with demand uncertainty

被引:41
作者
Liu, Kanglin [1 ]
Liu, Changchun [2 ]
Xiang, Xi [3 ]
Tian, Zhili [4 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
[2] Natl Univ Singapore, Inst Operat Res & Analyt, Singapore 117602, Singapore
[3] Natl Univ Singapore, Dept Ind Syst Engn & Management, Singapore 117602, Singapore
[4] Coastal Carolina Univ, Coll Business, 119 Chanticleer Dr E, Conway, SC 29526 USA
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
OR In disaster relief; Dynamic facility location; Capacity planning; Online convex optimization; Gradient descent; SHELTER LOCATION; NETWORK DESIGN; ROBUST MODEL; EXPANSION; FRAMEWORK;
D O I
10.1016/j.ejor.2021.11.028
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The outbreak of coronavirus disease 2019 (COVID-19) has seriously affected the whole world, and epidemic research has attracted increasing amounts of scholarly attention. Critical facilities such as warehouses to store emergency supplies and testing or vaccination sites could help to control the spread of COVID-19. This paper focuses on how to locate the testing facilities to satisfy the varying demand, i.e., test kits, caused by pandemics. We propose a two-phase optimization framework to locate facilities and adjust capacity during large-scale emergencies. During the first phase, the initial prepositioning strategies are determined to meet predetermined fill-rate requirements using the sample average approximation formulation. We develop an online convex optimization-based Lagrangian relaxation approach to solve the problem. Specifically, to overcome the difficulty that all scenarios should be addressed simultaneously in each iteration, we adopt an online gradient descent algorithm, in which a near-optimal approximation for a given Lagrangian dual multiplier is constructed. During the second phase, the capacity to deal with varying demand is adjusted dynamically. To overcome the inaccuracy of long-term prediction, we design a dynamic allocation policy and adaptive dynamic allocation policy to adjust the policy to meet the varying demand with only one day's prediction. A comprehensive case study with the threat of COVID-19 is conducted. Numerical results have verified that the proposed two-phase framework is effective in meeting the varying demand caused by pandemics. Specifically, our adaptive policy can achieve a solution with only a 3.3% gap from the optimal solution with perfect information. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:150 / 168
页数:19
相关论文
共 81 条
  • [1] Abbasi-Yadkori Y, 2014, PR MACH LEARN RES, V32, P496
  • [2] Online algorithms: a survey
    Albers, S
    [J]. MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) : 3 - 26
  • [3] Alem D., 2021, EUR J OPER RES
  • [4] [Anonymous], 2009, Humanitarian Logistics
  • [5] [Anonymous], 2003, P 20 INT C MACH LEAR
  • [6] Facility location dynamics: An overview of classifications and applications
    Arabani, Alireza Boloori
    Farahani, Reza Zanjirani
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 62 (01) : 408 - 420
  • [7] Modelling and optimal control of multi strain epidemics, with application to COVID-19
    Arruda, Edilson F.
    Das, Shyam S.
    Dias, Claudia M.
    Pastore, Dayse H.
    [J]. PLOS ONE, 2021, 16 (09):
  • [8] DYNAMIC WAREHOUSE LOCATION ANALYSIS
    BALLOU, RH
    [J]. JOURNAL OF MARKETING RESEARCH, 1968, 5 (03) : 271 - 276
  • [9] Basciftci B., 2021, ARXIV
  • [10] Distributionally robust facility location problem under decision-dependent stochastic demand
    Basciftci, Beste
    Ahmed, Shabbir
    Shen, Siqian
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 292 (02) : 548 - 561