Impacts of communication limits on convergence of distributed DCOPF with flexible transmission

Abstract

This paper presents a fully-distributed DC optimal power flow (DCOPF) method that incorporates flexible transmission, and studies the impacts of communication limitations on the convergence properties of the proposed method. The distributed DCOPF algorithm iteratively solves the first order optimality conditions at each bus. To converge to the globally optimal solution, some information is communicated to the neighboring buses. While in an ideal case such data should be communicated at each iteration, commutation limitations are an inherent characteristic of real-world implementations. This paper divides the system into different areas, and puts communication constraints between different areas. While the information between buses within the same area is communicated at each iteration, the communication between neighboring areas occurs less frequently. This paper studies the impacts of this constraint on the convergence properties of the presented distributed DCOPF algorithm. Simulation studies on IEEE 118-bus system show that communication constraints affect both the number of iterations needed to reach convergence as well as the dynamics of solution evolution.