Robust Optimization for Tree-Structured Stochastic Network Design

Authors

  • Xiaojian Wu Cornell University
  • Akshat Kumar Singapore Management University
  • Daniel Sheldon University of Massachusetts Amherst and Mount Holyoke College
  • Shlomo Zilberstein University of Massachusetts Amherst

DOI:

https://doi.org/10.1609/aaai.v31i1.11176

Keywords:

Network Design, Robust Optimization, Dynamic Programming, Approximation Algorithm

Abstract

Stochastic network design is a general framework for optimizing network connectivity. It has several applications in computational sustainability including spatial conservation planning, pre-disaster network preparation, and river network optimization. A common assumption in previous work has been made that network parameters (e.g., probability of species colonization) are precisely known, which is unrealistic in real- world settings. We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers. We assume that fish passability probabilities are known only imprecisely, but are within some interval bounds. We then develop a planning approach that computes the policies with either high robust ratio or low regret. Empirically, our approach scales well to large river networks. We also provide insights into the solutions generated by our robust approach, which has significantly higher robust ratio than the baseline solution with mean parameter estimates.

Downloads

Published

2017-02-12

How to Cite

Wu, X., Kumar, A., Sheldon, D., & Zilberstein, S. (2017). Robust Optimization for Tree-Structured Stochastic Network Design. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.11176

Issue

Section

Special Track on Computational Sustainability