% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Bahl:877631,
      author       = {Bahl, Björn and Lützow, Julian and Shu, David and
                      Hollermann, Dinah Elena and Lampe, Matthias and Hennen,
                      Maike and Bardow, André},
      title        = {{R}igorous synthesis of energy systems by decomposition via
                      time-series aggregation},
      journal      = {Computers $\&$ chemical engineering},
      volume       = {112},
      issn         = {0098-1354},
      address      = {Amsterdam [u.a.]},
      publisher    = {Elsevier Science},
      reportid     = {FZJ-2020-02346},
      pages        = {70 - 81},
      year         = {2018},
      abstract     = {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.},
      cin          = {IEK-10},
      ddc          = {660},
      cid          = {I:(DE-Juel1)IEK-10-20170217},
      pnm          = {899 - ohne Topic (POF3-899)},
      pid          = {G:(DE-HGF)POF3-899},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000427486800008},
      doi          = {10.1016/j.compchemeng.2018.01.023},
      url          = {https://juser.fz-juelich.de/record/877631},
}