Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut

被引:5
|
作者
Guo, Penghui [1 ]
Zhu, Jianjun [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, Nanjing 211106, Peoples R China
关键词
Humanitarian logistics; Capacity reservation; Deprivation cost; Two-stage stochastic programming; Logic-based Benders decomposition; MACHINE SCHEDULING PROBLEM; DISASTER PREPAREDNESS; FACILITY LOCATION; LINEAR-PROGRAMS; OPTION CONTRACT; NETWORK DESIGN; SUPPLY CHAINS; MODEL; PROCUREMENT; LOGISTICS;
D O I
10.1016/j.ejor.2023.06.006
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Prepositioning of relief supplies has been widely addressed to cover the demands of humanitarian emergencies. However, cost inefficiency, item type limitation, and damage risk make solely relying on prepositioning unrealistic. We develop two-stage stochastic models that incorporate prepositioning, physical capacity reservation, and production capacity reservation for reactive procurement. As an alternative to the traditional physical capacity reservation, the production capacity reservation is inspired by the practice of the automotive industry, garment industry, etc. for manufacturing personal protective equipment during the pandemic. Our models minimize the supply-side monetary costs and the demand-side social impacts, i.e., deprivation costs. The discretized deprivation cost function is introduced to handle the nonlinear deprivation cost function. The hierarchical nature of our stochastic models motivates us to utilize the logic-based Benders decomposition (LBBD). Our Benders master problem contains one set of nonbinary integer variables for prepositioning inventory and another set of continuous variables for estimating the second-stage costs, which differs from the existing LBBD works that typically contain binary and continuous variables in the master problem. Hence, a new type of logic-based Benders optimality cut, namely logic-based subgradient cut, is first introduced. To compute the cutting coefficients efficiently, heuristics that can lead to almost optimal solutions is developed. We also develop warm-start cutting planes, namely wait-and-see cuts and expected-value cuts, to help with better upper bounds and lower bounds. Extensive numerical results followed by a case study validate the efficiency of the solution method, the value of incorporating stochasticity, and the superiority of the capacity reservation. & COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码:942 / 970
页数:29
相关论文
共 50 条
  • [41] Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
    Roshanaei, Vahid
    Luong, Curtiss
    Aleman, Dionne M.
    Urbach, David
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (02) : 439 - 455
  • [42] Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps
    Chen, Jian
    Ye, Xudong
    Ma, Wenjing
    Xu, Dehua
    COMPUTERS & OPERATIONS RESEARCH, 2024, 168
  • [43] Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks
    Varga, Johannes
    Karlsson, Emil
    Raidl, Guenther R.
    Ronnberg, Elina
    Lindsten, Fredrik
    Rodemann, Tobias
    MACHINE LEARNING, OPTIMIZATION, AND DATA SCIENCE, LOD 2023, PT I, 2024, 14505 : 24 - 38
  • [44] A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem
    Maschler, Johannes
    Raidl, Guenther R.
    OPERATIONS RESEARCH PROCEEDINGS 2015, 2017, : 393 - 399
  • [45] Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem
    Zhu, Xuedong
    Son, Junbo
    Zhang, Xi
    Wu, Jianguo
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 117
  • [46] Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
    Juvin, Carla
    Houssin, Laurent
    Lopez, Pierre
    COMPUTERS & OPERATIONS RESEARCH, 2023, 152
  • [47] Logic-based outer-approximation and benders decomposition algorithms for the synthesis of process networks
    Turkay, M
    Grossmann, IE
    STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 585 - 607
  • [48] Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags
    Hamdi, Imen
    Loukil, Taicir
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [49] Solving a stochastic facility location/fleet management problem with logic-based Benders' decomposition
    Fazel-Zarandi, Mohammad M.
    Berman, Oded
    Beck, J. Christopher
    IIE TRANSACTIONS, 2013, 45 (08) : 896 - 911
  • [50] A Logic-Based Benders Approach to Home Healthcare Delivery
    Heching, Aliza
    Hooker, J. N.
    Kimura, Ryo
    TRANSPORTATION SCIENCE, 2019, 53 (02) : 510 - 522