TY - JOUR
T1 - Two-stage recoverable robust optimization for an integrated location–allocation and evacuation planning problem
AU - Yin, Yunqiang
AU - Xu, Xinrui
AU - Wang, Dujuan
AU - Yu, Yugang
AU - Cheng, T. C.E.
N1 - Publisher Copyright:
© 2024 Elsevier Ltd
PY - 2024/4
Y1 - 2024/4
N2 - We consider an integrated location–allocation and evacuation planning problem in a disaster context, where the effects of a disaster, including the uncertain capacities of relief facilities (rescue centers and distribution centers), uncertain demands for relief supplies and casualty treatment services, and uncertain availability of transportation links are characterized by a discrete scenario set. Instead of complete failures, we allow the disrupted relief facilities only lose part of their capacity. To deal with the uncertainties, we propose a two-stage recoverable robust optimization model, where the location decision of relief facilities, the allocation decision of delivering relief supplies from relief facilities to affected areas, the transfer decision of transporting casualties from affected areas to rescue centers etc are defined in two stages where the first-stage solution should be robust against the possible effects of a disaster that are revealed in the second stage, and the second-stage solution involves some recovery actions, which we term as multi-mitigation strategies: re-opening and re-operation, re-allocation, and relief supply sharing, to mitigate the effects. To solve the model to optimality, we develop a nested two-stage decomposition algorithm that iterates between a master problem considering only a subset of disaster scenarios solved by a Benders decomposition algorithm that incorporates some non-trivial acceleration strategies, and an adversarial separation problem that identifies disaster scenarios to enhance the worst-case recovery cost of the master problem. We introduce some warm-start techniques to accelerate the convergence of the solution algorithm. We conduct numerical studies on simulation instances to assess the performance of the solution algorithm, and analyze the robustness and recoverability of the model. We also conduct extensive numerical studies on realistic instances from Ya'an and Ganzi to demonstrate the benefits of accounting for recoverable robustness over a stochastic policy and a robust policy without recovery actions, the benefits of considering integrated optimization over sequential optimization, and the benefits of considering partial capacity loss and multi-mitigation strategies.
AB - We consider an integrated location–allocation and evacuation planning problem in a disaster context, where the effects of a disaster, including the uncertain capacities of relief facilities (rescue centers and distribution centers), uncertain demands for relief supplies and casualty treatment services, and uncertain availability of transportation links are characterized by a discrete scenario set. Instead of complete failures, we allow the disrupted relief facilities only lose part of their capacity. To deal with the uncertainties, we propose a two-stage recoverable robust optimization model, where the location decision of relief facilities, the allocation decision of delivering relief supplies from relief facilities to affected areas, the transfer decision of transporting casualties from affected areas to rescue centers etc are defined in two stages where the first-stage solution should be robust against the possible effects of a disaster that are revealed in the second stage, and the second-stage solution involves some recovery actions, which we term as multi-mitigation strategies: re-opening and re-operation, re-allocation, and relief supply sharing, to mitigate the effects. To solve the model to optimality, we develop a nested two-stage decomposition algorithm that iterates between a master problem considering only a subset of disaster scenarios solved by a Benders decomposition algorithm that incorporates some non-trivial acceleration strategies, and an adversarial separation problem that identifies disaster scenarios to enhance the worst-case recovery cost of the master problem. We introduce some warm-start techniques to accelerate the convergence of the solution algorithm. We conduct numerical studies on simulation instances to assess the performance of the solution algorithm, and analyze the robustness and recoverability of the model. We also conduct extensive numerical studies on realistic instances from Ya'an and Ganzi to demonstrate the benefits of accounting for recoverable robustness over a stochastic policy and a robust policy without recovery actions, the benefits of considering integrated optimization over sequential optimization, and the benefits of considering partial capacity loss and multi-mitigation strategies.
KW - Allocation
KW - Benders decomposition
KW - Location
KW - Robust optimization
UR - http://www.scopus.com/inward/record.url?scp=85185882843&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2024.102906
DO - 10.1016/j.trb.2024.102906
M3 - Journal article
AN - SCOPUS:85185882843
SN - 0191-2615
VL - 182
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
M1 - 102906
ER -