A time step reduction method for multi-period optimal power flow problems

The computation of the optimum of a dynamical or multi-period Optimal Power Flow problem assuming an Interior Point Method (IPM) leads to linear systems of equations whose size is proportional to the number of considered time steps. In this preprint we investigate a possib...

Full description

Saved in:
Bibliographic Details
Main Authors: Schween, Nils (Author) , Meyer-Hübner, Nico (Author) , Gerstner, Philipp (Author) , Heuveline, Vincent (Author)
Format: Book/Monograph
Language:English
Published: Heidelberg Univ.-Bibliothek May 30, 2019
Series:Preprint series of the Engineering Mathematics and Computing Lab (EMCL) Preprint no. 2019-02
In: Preprint series of the Engineering Mathematics and Computing Lab (EMCL) (Preprint no. 2019-02)

DOI:10.11588/emclpp.2019.02.62749
Online Access:Verlag, kostenfrei, Volltext: http://nbn-resolving.de/urn:nbn:de:bsz:16-emclpp-627492
Verlag, kostenfrei, Volltext: https://doi.org/10.11588/emclpp.2019.02.62749
Verlag, kostenfrei, Volltext: https://journals.ub.uni-heidelberg.de/index.php/emcl-pp/article/view/62749
Get full text
Author Notes:Nils Schween, Nico Meyer-Hübner, Philipp Gerstner, Vincent Heuveline
Description
Summary:The computation of the optimum of a dynamical or multi-period Optimal Power Flow problem assuming an Interior Point Method (IPM) leads to linear systems of equations whose size is proportional to the number of considered time steps. In this preprint we investigate a possibility to reduce the amount of time steps needed to be taken into account: Assuming that the power grid’s dynamic is mainly determined by changes of the residual demand, we drop time steps in case it does not change much. Hence, the size of the linear systems can be reduced. We tested this method for the German Power Grid of the year 2023 and a synthetic 960 h profile. We were able to reduce the amount of time steps by 40% without changing the objective function’s value significantly.
Item Description:Gesehen am 03.06.2019
Physical Description:Online Resource
DOI:10.11588/emclpp.2019.02.62749