Robust optimal discrete arc sizing for tree-shaped potential networks

Journal article

Publication Details

Author(s): Robinius M, Schewe L, Schmidt M, Stolten D, Thürauf J, Welder L
Journal: Computational Optimization and Applications
Publication year: 2019
ISSN: 0926-6003
Language: English


We consider the problem of discrete arc sizing for tree-shaped potential networks with respect to infinitely many demand scenarios. This means that the arc sizes need to be feasible for an infinite set of scenarios. The problem can be seen as a strictly robust counterpart of a single-scenario network design problem, which is shown to be NP-complete even on trees. In order to obtain a tractable problem, we introduce a method for generating a finite scenario set such that optimality of a sizing for this finite set implies the sizing's optimality for the originally given infinite set of scenarios. We further prove that the size of the finite scenario set is quadratically bounded above in the number of nodes of the underlying tree and that it can be computed in polynomial time. The resulting problem can then be solved as a standard mixed-integer linear optimization problem. Finally, we show the applicability of our theoretical results by computing globally optimal arc sizes for a realistic hydrogen transport network of Eastern Germany.

FAU Authors / FAU Editors

Schewe, Lars PD Dr.
Economics - Discrete Optimization - Mathematics (EDOM)
Schmidt, Martin Prof. Dr.
Juniorprofessur für Optimierung von Energiesystemen
Thürauf, Johannes
Economics - Discrete Optimization - Mathematics (EDOM)

External institutions with authors

Forschungszentrum Jülich / Research Centre Jülich (FZJ)

How to cite

Robinius, M., Schewe, L., Schmidt, M., Stolten, D., Thürauf, J., & Welder, L. (2019). Robust optimal discrete arc sizing for tree-shaped potential networks. Computational Optimization and Applications.

Robinius, Martin, et al. "Robust optimal discrete arc sizing for tree-shaped potential networks." Computational Optimization and Applications (2019).


Last updated on 2019-21-05 at 14:50