Economic dispatch

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Economic dispatch is the short-term determination of the optimal output of a number of electricity generation facilities, to meet the system load, at the lowest possible cost, subject to transmission and operational constraints. The Economic Dispatch Problem is solved by specialised computer software which should honour the operational and system constraints of the available resources and corresponding transmission capabilities. In the US Energy Policy Act of 2005 the term is defined as "the operation of generation facilities to produce energy at the lowest cost to reliably serve consumers, recognising any operational limits of generation and transmission facilities".[1]

The main idea is that in order to serve load at minimum total cost, the set of generators with the lowest marginal costs must be used first, with the marginal cost of the final generator needed to meet load setting the system marginal cost. This is the cost of delivering one additional MW of energy onto the system. The historic methodology for economic dispatch was developed to manage fossil fuel burning power plants, relying on calculations involving the input/output characteristics of power stations.

Basic mathematical formulation[2][edit]

The economic dispatch problem can be thought of as maximising the economic welfare W of a power network whilst meeting system constraints. For a network with n buses (nodes), where Ik represents the net power injection at bus k, and Ck(Ik) is the cost function of producing power at bus k, the unconstrained problem is formulated as:

\min_{I_k}\; (-W)=\min_{I_k}\;\left \{ \sum_{k=1}^n C_k(I_k)\right \}

Constraints imposed on the are the need to maintain a power balance, and that the flow on any line must not exceed its capacity. For the power balance, the sum of the net injections at all buses must be equal to the power losses in the branches of the network:

 \sum_{k=1}^n I_k = L(I_1,I_2,\dots,I_{n-1})

The power losses L depend on the flows in the branches and thus on the net injections as shown in the above equation. However it cannot depend on the injections on all the buses as this would give an over-determined system. Thus one bus is chosen as the Slack bus and is omitted from the variables of the function L. The choice of Slack bus is entirely arbitrary, here bus n is chosen.

The second constraint involves capacity constraints on the flow on network lines. For a system with m lines this constraint is modelled as:

 F_l(I_1,I_2,\dots,I_{n-1}) \leq F_{l}^{max} \qquad l=1,\dots,m

where Fl is the flow on branch l, and Flmax is the maximum value that this flow is allowed to take. Note that the net injection at the slack bus is not included in this equation for the same reasons as above.

These equations can now be combined to build the Lagrangian of the optimization problem:

 \mathcal{L}= \sum_{k=1}^n C_k(I_k) + \pi \left [ L(I_1,I_2,\dots,I_{n-1})-\sum_{k=1}^n I_k \right ] + \sum_{l=1}^m \mu_l \left [ F_{l}^{max}-F_l(I_1,I_2,\dots,I_{n-1}) \right ]

where π and μ are the Lagrangian multipliers of the constraints. The conditions for optimality are then:

 {\partial \mathcal{L}\over\partial I_k} = 0 \qquad k=1,\dots,n
 {\partial \mathcal{L}\over\partial \pi} = 0
 {\partial \mathcal{L}\over\partial \mu_l} = 0 \qquad l=1,\dots,m
 \mu_l \cdot \left [ F_{l}^{max}-F_l(I_1,I_2,\dots,I_{n-1}) \right ]  = 0 \quad \mu_l \geq 0 \quad k=1,\dots,n

where the last condition is needed to handle the inequality constraint on line capacity.

Solving these equations is computationally difficult as they are nonlinear and implicitly involve the solution of the power flow equations. The analysis can be simplified using a linearised model called a DC power flow.


  1. ^ Energy Policy Act 2005.
  2. ^ Kirschen, Daniel (2010). Fundamentals of Power System Economics. Wiley. ISBN 0-470-84572-4. 

External links[edit]