Abstract

This paper discusses a consensus-based alternating direction method of multipliers (ADMMs) approach for solving the dynamic dc optimal power flow (DC-OPF) problem with demand response in a distributed manner. In smart grid, emerging techniques together with distributed nature of data and information, significantly increase the complexity of power systems operation and stimulate the needs for distributed optimization. In this paper, the distributed DC-OPF approach solves local OPF problems of individual subsystems in parallel, which are coordinated via global consensus variables (i.e., phase angles on boundary buses of adjacent subsystems). Three distributed DC-OPF algorithms are discussed with different convergence performance and/or communication requirement. All three distributed algorithms can effectively handle prevailing constraints for the transmission network, generating units, and demand response in individual subsystems, while the global convergence can be guaranteed. In particular, based on the traditional distributed ADMM approach, a fully decentralized algorithm without the central controller is proposed in Algorithm 2 with a new communication strategy, in which only limited information on boundary buses are exchanged among adjacent subsystems. In addition, the accelerated ADMM is discussed in Algorithm 3 for improving the convergence performance. In recognizing distributed OPF approaches in literature, one major research focus on this paper is to quantify the impact of key parameters and subsystem partitioning strategies on the convergence performance and the data traffic via numerical case studies. A general guidance for subsystem partitioning is proposed and verified via large-scale power systems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.