The Time-dependent Interdependent Network Design Problem (td-INDP)and the Evaluation of Multi-system Recovery Strategies in Polynomial Time

摘要

Infrastructure systems are critical for societal resilience as well as government operation and defense.Thereby, it is imperative to perform thorough yet computationally efficient analyses on infrastructure systems,while quantifying their vulnerability and recoverability.Nevertheless, to be applicable in realistic scenarios,such analyses must consider different hyers of complexity not commonly dealt with together, such as the existence of limited capacities and resources, and the presence of interdependence among different systems.This paper presents a mathematical formulation to solve to optimality the time-dependent Interdependent Network Design Problem (td-INDP), which seeks the minimum-cost recovery strategy of a partially destroyed system of infrastructure networks, subject to operational, resources, and budget constraints, while considering interdependencies between them.In addition, given a disaster scenario, it is imperative to be able to evaluate in real time the feasibility and quality of pre-existing recovery plans.To assess this issue, this paper also presents a polynomial-time algorithm based on the td-INDP that determines the feasibility and optimal performance of a given recovery strategy.A realistic illustrative example shows the application of the presented td-INDP to optimally recover the interdependent system of water, power, and gas networks in Shelby County, TN, USA,subject to earthquake hazards due to its proximity to the New Madrid Seismic Zone (NMSZ).The results show the applicability of the presented td-INDP to realistic scenarios, offering a robust tool to support decision-makers in the design and evaluation of recovery strategies for multiple infrastructure systems at once.