An approximate dynamic programming approach to food security of communities following hazards
Abstract
Food security can be threatened by extreme natural hazard events for households of all social classes within a community. To address food security issues following a natural disaster, the recovery of several elements of the built environment within a community, including its building portfolio, must be considered. Building portfolio restoration is one of the most challenging elements of recovery owing to the complexity and dimensionality of the problem. This study introduces a stochastic scheduling algorithm for the identification of optimal building portfolio recovery strategies. The proposed approach provides a computationally tractable formulation to manage multi-state, large-scale infrastructure systems. A testbed community modeled after Gilroy, California, is used to illustrate how the proposed approach can be implemented efficiently and accurately to find the near-optimal decisions related to building recovery following a severe earthquake.
Keywords
Cite
@article{arxiv.1812.10540,
title = {An approximate dynamic programming approach to food security of communities following hazards},
author = {Saeed Nozhati and Yugandhar Sarkale and Bruce R. Ellingwood and Edwin K. P. Chong and Hussam Mahmoud},
journal= {arXiv preprint arXiv:1812.10540},
year = {2019}
}
Comments
As opposed to the preemptive scheduling problem, which was addressed in multiple works by us, we deal with a non-preemptive stochastic scheduling problem in this work. Submitted to 13th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP13 Seoul, South Korea, May 26-30, 2019