In the present paper we introduce a new distributed optimization approach to the solution of general Optimal Power Flow problem for unbalanced and mesh networks. A new convex formulation, based on McCormick Envelopes, is proposed with a decomposition profile and a distributed approach based on proximal coordination. The resulting algorithm is shown to converge with a rate of o(1/τ), where τ is the number of iterations. The approach is validated on a modified IEEE 13 bus network, with added distributed energy resources including distributed generation and demand response.

A distributed approach to the optimal power flow problem for unbalanced and mesh networks

Ferro G.;Robba M.;
2020-01-01

Abstract

In the present paper we introduce a new distributed optimization approach to the solution of general Optimal Power Flow problem for unbalanced and mesh networks. A new convex formulation, based on McCormick Envelopes, is proposed with a decomposition profile and a distributed approach based on proximal coordination. The resulting algorithm is shown to converge with a rate of o(1/τ), where τ is the number of iterations. The approach is validated on a modified IEEE 13 bus network, with added distributed energy resources including distributed generation and demand response.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S2405896320304201-main.pdf

accesso aperto

Descrizione: Contributo in atti di convegno
Tipologia: Documento in versione editoriale
Dimensione 603.74 kB
Formato Adobe PDF
603.74 kB Adobe PDF Visualizza/Apri

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/11567/1077738
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 5
social impact