%0 Journal Article
%A Bahl, Björn
%A Lützow, Julian
%A Shu, David
%A Hollermann, Dinah Elena
%A Lampe, Matthias
%A Hennen, Maike
%A Bardow, André
%T Rigorous synthesis of energy systems by decomposition via time-series aggregation
%J Computers & chemical engineering
%V 112
%@ 0098-1354
%C Amsterdam [u.a.]
%I Elsevier Science
%M FZJ-2020-02346
%P 70 - 81
%D 2018
%X The synthesis of complex energy systems usually involves large time series such that a direct optimization is computationally prohibitive. In this paper, we propose a decomposition method for synthesis problems using time-series aggregation. To initialize the method, the time series is aggregated to one time step. A lower bound is obtained by relaxing the energy balances and underestimating the energy demands leading to a relaxed synthesis problem, which is efficiently solvable. An upper bound is obtained by restricting the original problem with the full time series to an operation problem with a fixed structure obtained from the lower bound solution. If the bounds do not satisfy the specified optimality gap, the resolution of the time-series aggregation is iteratively increased. The decomposition method is applied to two real-world synthesis problems. The results show the fast convergence of the decomposition method outperforming commercial state-of-the-art optimization software.
%F PUB:(DE-HGF)16
%9 Journal Article
%U <Go to ISI:>//WOS:000427486800008
%R 10.1016/j.compchemeng.2018.01.023
%U https://juser.fz-juelich.de/record/877631