Towards optimal recovery scheduling for dynamic resilience of networked infrastructure

Prior research on the resilience of critical infrastructure usually utilizes the network model to characterize the structure of the components so that a quantitative representation of resilience can be obtained. Particularly, network component importance is addressed to express its significance in shaping the resilience performance of the whole system. Due to the intrinsic complexity of the problem, some idealized assumptions are exerted on the resilience-optimization problem to find partial solutions. This paper seeks to exploit the dynamic aspect of system resilience, i.e., the scheduling problem of link recovery in the post-disruption phase. The aim is to analyze the recovery strategy of the system with more practical assumptions, especially inhomogeneous time cost among links. In view of this, the presented work translates the resilience-maximization recovery plan into the dynamic decision-making of runtime recovery option. A heuristic scheme is devised to treat the core problem of link selection in an ongoing style. Through Monte Carlo simulation, the link recovery order rendered by the proposed scheme demonstrates excellent resilience performance as well as accommodation with uncertainty caused by epistemic knowledge.