% 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{Schfer:877550,
      author       = {Schäfer, Pascal and Schweidtmann, Artur M. and Lenz,
                      Philipp H. A. and Markgraf, Hannah M. C. and Mitsos,
                      Alexander},
      title        = {{W}avelet-based grid-adaptation for nonlinear scheduling
                      subject to time-variable electricity prices},
      journal      = {Computers $\&$ chemical engineering},
      volume       = {132},
      issn         = {0098-1354},
      address      = {Amsterdam [u.a.]},
      publisher    = {Elsevier Science},
      reportid     = {FZJ-2020-02285},
      pages        = {106598 -},
      year         = {2020},
      abstract     = {Using nonlinear process models in discrete-time scheduling
                      typically prohibits long planning horizons with fine
                      temporal discretizations. Therefore, we propose an adaptive
                      grid algorithm tailored for scheduling subject to
                      time-variable electricity prices. The scheduling problem is
                      formulated in a reduced space. In the algorithm, the number
                      of degrees of freedom is reduced by linearly mapping one
                      degree of freedom to multiple intervals with similar
                      electricity prices. The mapping is iteratively refined using
                      a wavelet-based analysis of the previous solution. We apply
                      the algorithm to the scheduling of a compressed air energy
                      storage. We model the efficiency characteristics of the
                      turbo machinery using artificial neural networks. Using our
                      in-house global solver MAiNGO, the algorithm identifies a
                      feasible near-optimal solution with $ < 1\%$ deviation
                      in the objective value within $ < 5\%$ of the
                      computational time compared to a solution considering the
                      full dimensionality.},
      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:000498396100021},
      doi          = {10.1016/j.compchemeng.2019.106598},
      url          = {https://juser.fz-juelich.de/record/877550},
}