233
2018
2019
eng
791
819
29
73(3)
article
1
2018-02-01
2018-02-01
--
Robust Optimal Discrete Arc Sizing for Tree-Shaped Potential Networks
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.
Computational Optimization and Applications
10.1007/s10589-019-00085-x
2
Published
Creative Commons - CC BY - Namensnennung 4.0 International
Martin Robinius
Lars Schewe
Martin Schmidt
Detlef Stolten
Johannes Thürauf
Lara Welder
eng
uncontrolled
Discrete arc sizing
eng
uncontrolled
Mixed-integer linear optimization
eng
uncontrolled
Potential networks
eng
uncontrolled
Scenario generation
eng
uncontrolled
Robust optimization
Friedrich-Alexander-Universität Erlangen-Nürnberg
B07
B08
Forschungszentrum Jülich
Universität Trier
https://opus4.kobv.de/opus4-trr154/files/233/diameter_hydrogen_preprint.pdf