A trust-region based sequential linear programming approach for AC optimal power flow problems

•Design of scalable trust-region based sequential linear programming (TR-SLP) algorithm for AC-OPF problem.•A feasibility restoration step is introduced to alleviate the problems associated with the infeasibilities of a linear approximation.•The AC-OPF problem for IEEE (14, 30, 57, 118 and 300) syst...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electric power systems research 2018-12, Vol.165, p.134-143
Hauptverfasser: Sampath, L.P.M.I., Patil, Bhagyesh V., Gooi, H.B., Maciejowski, J.M., Ling, K.V.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Design of scalable trust-region based sequential linear programming (TR-SLP) algorithm for AC-OPF problem.•A feasibility restoration step is introduced to alleviate the problems associated with the infeasibilities of a linear approximation.•The AC-OPF problem for IEEE (14, 30, 57, 118 and 300) systems, and Polish (2383wp, 2746wop, 3012wp) systems is simulated to show the effectiveness of the designed TR-SLP algorithm. This study proposes a new trust-region based sequential linear programming algorithm to solve the AC optimal power flow (OPF) problem. The OPF problem is solved by linearizing the cost function, power balance and engineering constraints of the system, followed by a trust-region to control the validity of the linear model. To alleviate the problems associated with the infeasibilities of a linear approximation, a feasibility restoration phase is introduced. This phase uses the original nonlinear constraints to quickly locate a feasible point when the linear approximation is infeasible. The algorithm follows convergence criteria to satisfy the first order optimality conditions for the original OPF problem. Studies on standard IEEE systems and large-scale Polish systems show an acceptable quality of convergence to a set of best-known solutions and a substantial improvement in computational time, with linear scaling proportional to the network size.
ISSN:0378-7796
1873-2046
DOI:10.1016/j.epsr.2018.09.002