In this paper we address the problem of optimal sizing of a given number of energy storage systems in a distribution network. These devices represent an effective solution for distribution system operators to prevent over- and undervoltages in distribution feeders. The sizing problem is first formulated in a two-stage stochastic framework in order to cope with uncertainty on future demand and distributed generation. By taking a scenario-based approach, this problem is then approximated in the form of a multi-scenario, multi-period optimal power flow. Since the size of the latter problem becomes rapidly prohibitive as the number of scenarios grows, a novel scenario reduction procedure is proposed. The procedure consists of solving a sequence of problems with scenario sets of increasing size. Tightness of the lower bound generated at each iteration can be checked very efficiently. Typically, a tight solution is obtained for sizes much smaller than that of the original scenario set. The algorithm is tested on the topology of a real Italian distribution network, using historical data of demand and generation to build the scenarios.
Bucciarelli, M., Paoletti, S., Vicino, A. (2017). A scenario reduction approach for optimal sizing of energy storage systems in power distribution networks. In Proc. of 56th IEEE Conference on Decision and Control (pp.4497-4502). Institute of Electrical and Electronics Engineers Inc. [10.1109/CDC.2017.8264322].
A scenario reduction approach for optimal sizing of energy storage systems in power distribution networks
Bucciarelli, Martina;Paoletti, Simone;Vicino, Antonio
2017-01-01
Abstract
In this paper we address the problem of optimal sizing of a given number of energy storage systems in a distribution network. These devices represent an effective solution for distribution system operators to prevent over- and undervoltages in distribution feeders. The sizing problem is first formulated in a two-stage stochastic framework in order to cope with uncertainty on future demand and distributed generation. By taking a scenario-based approach, this problem is then approximated in the form of a multi-scenario, multi-period optimal power flow. Since the size of the latter problem becomes rapidly prohibitive as the number of scenarios grows, a novel scenario reduction procedure is proposed. The procedure consists of solving a sequence of problems with scenario sets of increasing size. Tightness of the lower bound generated at each iteration can be checked very efficiently. Typically, a tight solution is obtained for sizes much smaller than that of the original scenario set. The algorithm is tested on the topology of a real Italian distribution network, using historical data of demand and generation to build the scenarios.File | Dimensione | Formato | |
---|---|---|---|
BPV17.pdf
non disponibili
Descrizione: Articolo principale
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
194.37 kB
Formato
Adobe PDF
|
194.37 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/1056942