Comparison of Iterative Schemes for Approximating the Solution of the AC OPF

Contact: Eleni Stai

Background:

Computing a dispatch plan for a distribution network with stochastic resources and storage devices while accounting for operational constraints and system losses involves an AC Optimal Power Flow (AC OPF). This problem involves the non-linear power flow equations, thus it is, as well known, nonconvex and hard to solve. There are several approaches in literature for approximating the solution of the AC OPF with several of them providing an exact solution under stronger or milder conditions.

In this project we will design and develop/implement iterative schemes for computing an optimal dispatch plan for a distribution network with stochastic resources and storage devices. In these iterative schemes we will use as core algorithms for approximating the solution of the AC OPF existing ones from literature [1], [2]. Also, we will perform comparisons among them both from a theoretical and from a numerical point of view.

Project Goals:

  • Design & Development of iterative algorithms for approximating the solution of the AC OPF.
  • Comparative results via numerical evaluations.

Required Skills:

  • MATLAB
  • Load Flow
  • Optimal Power Flow
  • Optimization

Supervisors: Eleni Stai

References: