% 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{Baumgrtner:877607,
author = {Baumgärtner, Nils and Bahl, Björn and Hennen, Maike and
Bardow, André},
title = {{R}i{SES}3: {R}igorous {S}ynthesis of {E}nergy {S}upply and
{S}torage {S}ystems via time-series relaxation and
aggregation},
journal = {Computers $\&$ chemical engineering},
volume = {127},
issn = {0098-1354},
address = {Amsterdam [u.a.]},
publisher = {Elsevier Science},
reportid = {FZJ-2020-02322},
pages = {127 - 139},
year = {2019},
abstract = {Synthesis of energy systems is a complex task typically
depending on multiple large time series for demands, prices
and resources. Problem complexity increases further by
time-coupling constraints, e.g., due to storage systems. To
still efficiently solve complex synthesis problems, we
propose the rigorous synthesis method RiSES3. RiSES3
provides feasible solutions (upper bounds) with known
quality (lower bounds). Lower bounds are obtained by two
competitive approaches: linear-programming relaxation and
relaxation based on time-series aggregation. To obtain a
feasible design for the energy system, we use time-series
aggregation and subsequently solve an operational problem
yielding an upper bound. To tighten the bounds, we
iteratively increase the resolution of the time-series
aggregation and tighten the relaxation. RiSES3 is applied to
two industrial synthesis problems of energy systems with
time-coupling constraints, storage systems and volatile
prices. RiSES3 shows fast convergence, outperforming a
commercial state-of-the-art solver.},
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:000470829700011},
doi = {10.1016/j.compchemeng.2019.02.006},
url = {https://juser.fz-juelich.de/record/877607},
}