Optimal Stochastic Dynamic Scheduling for Managing Community Recovery from Natural Hazards
Saeed Nozhati, Yugandhar Sarkale, Edwin K. P. Chong, Bruce R., Ellingwood

TL;DR
This paper presents a stochastic optimization framework using Markov decision processes and rollout algorithms to compute optimal community recovery policies after natural hazards, outperforming current strategies and accommodating different risk attitudes.
Contribution
It introduces a novel MDP-based stochastic scheduling method with rollout algorithms for large-scale community recovery, considering multiple uncertainties and risk preferences.
Findings
Optimal policies outperform existing recovery strategies.
Method effectively handles large-scale, real-world community networks.
Applicable to risk-neutral and risk-averse decision-making.
Abstract
Following the occurrence of an extreme natural or man-made event, community recovery management should aim at providing optimal restoration policies for a community over a planning horizon. Calculating such optimal restoration polices in the presence of uncertainty poses significant challenges for community leaders. Stochastic scheduling for several interdependent infrastructure systems is a difficult control problem with huge decision spaces. The Markov decision process (MDP)-based optimization approach proposed in this study incorporates different sources of uncertainties to compute the restoration policies. The computation of optimal scheduling schemes using our method employs the rollout algorithm, which provides an effective computational tool for optimization problems dealing with real-world large-scale networks and communities. We apply the proposed methodology to a realistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
