  


Robust Optimal Discrete Arc Sizing for TreeShaped Potential Networks
Martin Robinius(m.robiniusfzjuelich.de) Abstract: We consider the problem of discrete arc sizing for treeshaped 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 singlescenario network design problem, which is shown to be NPcomplete 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 mixedinteger 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. Keywords: Discrete arc sizing, Network design, Potential networks, Scenario generation, Robust optimization, Mixedinteger linear optimization Category 1: Robust Optimization Category 2: Integer Programming ((Mixed) Integer Linear Programming ) Category 3: Applications  Science and Engineering Citation: Download: [PDF] Entry Submitted: 02/01/2018 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  