In a smart microgrid currents injected by distributed energy resources (DERs) and by the point of common coupling can be adapted to minimize the energy cost. Design and quality constraints usually make the problem grow fast with the number of nodes in the network. In this paper we provide a solution to the optimization problem having a significantly reduced complexity with respect to existing techniques. The efficiency of the proposed solution stems by modeling the smart microgrid as a linear network where loads are approximated as impedances. This simplification allows avoiding explicit use of power flow equations, and having a number of equation proportional to the number of DERs rather than to the total number of nodes (loads and DERs). The optimal power flow problem is then solved by a semidefinite programming (SDP) relaxation, which provides the initial point for the search of a feasible solution by a sequential convex programming procedure based on a local linear approximation of non-convex constraints. Numerical results show the merits of the proposed approach for typical smart microgrid scenarios.

Power Flow Optimization for Smart Microgrids by SDP Relaxation on Linear Networks

ERSEGHE, TOMASO;TOMASIN, STEFANO
2013

Abstract

In a smart microgrid currents injected by distributed energy resources (DERs) and by the point of common coupling can be adapted to minimize the energy cost. Design and quality constraints usually make the problem grow fast with the number of nodes in the network. In this paper we provide a solution to the optimization problem having a significantly reduced complexity with respect to existing techniques. The efficiency of the proposed solution stems by modeling the smart microgrid as a linear network where loads are approximated as impedances. This simplification allows avoiding explicit use of power flow equations, and having a number of equation proportional to the number of DERs rather than to the total number of nodes (loads and DERs). The optimal power flow problem is then solved by a semidefinite programming (SDP) relaxation, which provides the initial point for the search of a feasible solution by a sequential convex programming procedure based on a local linear approximation of non-convex constraints. Numerical results show the merits of the proposed approach for typical smart microgrid scenarios.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2683644
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 39
  • ???jsp.display-item.citation.isi??? 35
social impact