Distributed Approach for DC Optimal Power Flow Calculations

Javad Mohammadi, Soummya Kar, Gabriela HugarXiv 2014 · DOI · arXiv

Abstract

The trend in the electric power system is to move towards increased amounts of distributed resources which suggests a transition from the current highly centralized to a more distributed control structure. In this paper, we propose a method which enables a fully distributed solution of the DC Optimal Power Flow problem (DC-OPF), i.e. the generation settings which minimize cost while supplying the load and ensuring that all line flows are below their limits are determined in a distributed fashion. The approach consists of a distributed procedure that aims at solving the first order optimality conditions in which individual bus optimization variables are iteratively updated through simple local computations and information is exchanged with neighboring entities. In particular, the update for a specific bus consists of a term which takes into account the coupling between the neighboring Lagrange multiplier variables and a local innovation term that enforces the demand/supply balance. The buses exchange information on the current update of their multipliers and the bus angle with their neighboring buses. An analytical proof is given that the proposed method converges to the optimal solution of the DC-OPF. Also, the performance is evaluated using the IEEE Reliability Test System as a test case.

Introduction

Traditionally, the electric power grid is managed by a central authority that calculates the most cost-effective way to generate power while ensuring transmission lines aren't overloaded—a problem known as Optimal Power Flow (OPF). However, the modern grid is changing. With the explosion of distributed energy resources (like rooftop solar) and "smart" demand-side management, centralized control is becoming a bottleneck. Managing thousands of tiny, fluctuating variables from a single center is computationally expensive and raises privacy concerns.

This paper introduces a fully distributed algorithm for solving the DC Optimal Power Flow (DC-OPF) problem, allowing power grid nodes to coordinate generation and manage line congestion through only local communication. By iteratively solving first-order optimality conditions using a "consensus + innovations" approach, the method eliminates the need for a central coordinator while mathematically guaranteeing convergence to the global optimum.

Methodology

The authors propose a distributed iterative approach based on the First-Order Optimality Conditions (KKT conditions) of the DC-OPF problem. Each bus $i$ in the network tracks its own power generation ($P_{G}$), voltage angle ($\theta$), and Lagrange multipliers ($\lambda, \mu$).

The update rule for each variable consists of two parts:

  1. Coupling term: This seeks consensus or agreement with neighboring Lagrange multipliers.
  2. Innovation term: This acts as a local correction factor to enforce physical laws, like the balance between supply and demand.

Buses only exchange their current voltage angles and Lagrange multipliers with physical neighbors. Sensitive data, such as specific generation costs or local capacity limits, never leave the local bus. To handle inequality constraints (like a generator's maximum output), the algorithm uses projection operators that "push" variables back into their feasible range if an update exceeds a limit.

Experimental Setup

The algorithm was evaluated using the IEEE Reliability Test System (RTS), a standard benchmark representing a realistic grid topology. The system was modified to include 32 generators and 17 loads to test both uncongested and congested scenarios.

The IEEE Reliability Test System (RTS) grid topology used for performance evaluation.

Results and Discussion

The researchers tested the algorithm under two primary conditions:

  • Uncongested Case: The system reached the optimal dispatch in approximately 600 iterations. All marginal prices ($\lambda$) converged to a single uniform value across the grid, as expected for an unconstrained system.
  • Congested Case: By reducing line limits to 55% of their original values, the authors forced the system into a constrained state. The algorithm successfully converged in about 1,400 iterations. In this case, the marginal prices correctly settled at different values for different parts of the grid, reflecting the physical reality of the bottleneck.
Convergence of generation output (a), bus angles (b), and Lagrange multipliers (c) over iterations.

Unlike standard decomposition methods (like ADMM) which can be mathematically heavy, this approach treats the optimization problem as a system of coupled equations to be solved dynamically. In an uncongested grid, the "marginal cost" of power should be the same everywhere. When a line hits its limit, this "price" diverges across the grid. The authors' distributed multipliers ($\lambda$) naturally capture these Locational Marginal Prices (LMPs) without a central calculator.

Conclusion

This work demonstrates that a "bus-level" distributed solution can reach the optimal state just by talking to immediate neighbors. While a significant step forward, the paper notes that extending this "innovation" approach to the more complex AC-OPF problem—which involves non-linear equations and reactive power—is a logical next step. Additionally, while the authors provide a sufficient condition for convergence, finding the optimal tuning parameters ($\alpha, \beta, \gamma, \delta$) for a specific grid remains a challenge for future research.

Summary updated

Abstract

The trend in the electric power system is to move towards increased amounts of distributed resources which suggests a transition from the current highly centralized to a more distributed control structure. In this paper, we propose a method which enables a fully distributed solution of the DC Optimal Power Flow problem (DC-OPF), i.e. the generation settings which minimize cost while supplying the load and ensuring that all line flows are below their limits are determined in a distributed fashion. The approach consists of a distributed procedure that aims at solving the first order optimality conditions in which individual bus optimization variables are iteratively updated through simple local computations and information is exchanged with neighboring entities. In particular, the update for a specific bus consists of a term which takes into account the coupling between the neighboring Lagrange multiplier variables and a local innovation term that enforces the demand/supply balance. The buses exchange information on the current update of their multipliers and the bus angle with their neighboring buses. An analytical proof is given that the proposed method converges to the optimal solution of the DC-OPF. Also, the performance is evaluated using the IEEE Reliability Test System as a test case.
BibTeX
@misc{mohammadi2014distributed,
  author = {Javad Mohammadi and Soummya Kar and Gabriela Hug},
  title = {{Distributed Approach for DC Optimal Power Flow Calculations}},
  year = {2014},
  eprint = {1410.4236},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1410.4236},
}
Figure