Methods for Off-Line/on-Line Optimization Under Uncertainty

Abstract

In this work we present two general techniques to deal with multi-stage optimization problems under uncertainty, featuring off-line and on-line decisions. The methods are applicable when: 1) the uncertainty is exogenous; 2) there exists a heuristic for the on-line phase that can be modeled as a parametric convex optimization problem. The first technique replaces the on-line heuristics with an anticipatory solver, obtained through a systematic procedure. The second technique consists in making the off-line solver aware of the on-line heuristic, and capable of controlling its parameters so as to steer its behavior. We instantiate our approaches on two case studies: an energy management system with uncertain renewable generation and load demand, and a vehicle routing problem with uncertain travel times. We show how both techniques achieve high solution quality w.r.t. an oracle operating under perfect information, by obtaining different trade-offs in terms of computation time.

Cite

Text

De Filippo et al. "Methods for Off-Line/on-Line Optimization Under Uncertainty." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/177

Markdown

[De Filippo et al. "Methods for Off-Line/on-Line Optimization Under Uncertainty." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/filippo2018ijcai-methods/) doi:10.24963/IJCAI.2018/177

BibTeX

@inproceedings{filippo2018ijcai-methods,
  title     = {{Methods for Off-Line/on-Line Optimization Under Uncertainty}},
  author    = {De Filippo, Allegra and Lombardi, Michele and Milano, Michela},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {1270-1276},
  doi       = {10.24963/IJCAI.2018/177},
  url       = {https://mlanthology.org/ijcai/2018/filippo2018ijcai-methods/}
}