1 / 32

Power Flow Analysis and Solution Methods in Electrical Engineering

This lecture focuses on Power Flow analysis in electrical systems, covering key iterative solution methods, specifically Gauss-Seidel and Newton-Raphson algorithms. Students are guided through important concepts, including different types of power flow buses (Load, Slack, Generator) and their roles in the iterative process. Practical examples illustrate Gauss iteration and stopping criteria, while the Newton-Raphson method emphasizes linear approximation for diverse power system configurations. The lecture also highlights grid planning and the collaborative approach required for establishing new transmission lines based on load and generation dynamics.

arama
Télécharger la présentation

Power Flow Analysis and Solution Methods in Electrical Engineering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ECE 476POWER SYSTEM ANALYSIS Lecture 12 Power Flow Professor Tom Overbye Department of Electrical andComputer Engineering

  2. Announcements • Be reading Chapter 6, also Chapter 2.4 (Network Equations). • HW 5 is 2.38, 6.9, 6.18, 6.30, 6.34, 6.38; do by October 6 but does not need to be turned in. • First exam is October 11 during class. Closed book, closed notes, one note sheet and calculators allowed

  3. Power Flow Requires Iterative Solution

  4. Gauss Iteration

  5. Gauss Iteration Example

  6. Stopping Criteria

  7. Gauss Power Flow

  8. Gauss Two Bus Power Flow Example • A 100 MW, 50 Mvar load is connected to a generator • through a line with z = 0.02 + j0.06 p.u. and line charging of 5 Mvar on each end (100 MVA base). Also, there is a 25 Mvar capacitor at bus 2. If the generator voltage is 1.0 p.u., what is V2? SLoad = 1.0 + j0.5 p.u.

  9. Gauss Two Bus Example, cont’d

  10. Gauss Two Bus Example, cont’d

  11. Gauss Two Bus Example, cont’d

  12. Slack Bus • In previous example we specified S2 and V1 and then solved for S1 and V2. • We can not arbitrarily specify S at all buses because total generation must equal total load + total losses • We also need an angle reference bus. • To solve these problems we define one bus as the "slack" bus. This bus has a fixed voltage magnitude and angle, and a varying real/reactive power injection.

  13. Gauss with Many Bus Systems

  14. Gauss-Seidel Iteration

  15. Three Types of Power Flow Buses • There are three main types of power flow buses • Load (PQ) at which P/Q are fixed; iteration solves for voltage magnitude and angle. • Slack at which the voltage magnitude and angle are fixed; iteration solves for P/Q injections • Generator (PV) at which P and |V| are fixed; iteration solves for voltage angle and Q injection • special coding is needed to include PV buses in the Gauss-Seidel iteration

  16. Gauss-Seidel Advantages • Each iteration is relatively fast (computational order is proportional to number of branches + number of buses in the system • Relatively easy to program

  17. Gauss-Seidel Disadvantages • Tends to converge relatively slowly, although this can be improved with acceleration • Has tendency to miss solutions, particularly on large systems • Tends to diverge on cases with negative branch reactances (common with compensated lines) • Need to program using complex numbers

  18. Newton-Raphson Algorithm • The second major power flow solution method is the Newton-Raphson algorithm • Key idea behind Newton-Raphson is to use sequential linearization

  19. Newton-Raphson Method (scalar)

  20. Newton-Raphson Method, cont’d

  21. Newton-Raphson Example

  22. Newton-Raphson Example, cont’d

  23. Sequential Linear Approximations At each iteration the N-R method uses a linear approximation to determine the next value for x Function is f(x) = x2 - 2 = 0. Solutions are points where f(x) intersects f(x) = 0 axis

  24. Newton-Raphson Comments • When close to the solution the error decreases quite quickly -- method has quadratic convergence • f(x(v)) is known as the mismatch, which we would like to drive to zero • Stopping criteria is when f(x(v))  <  • Results are dependent upon the initial guess. What if we had guessed x(0) = 0, or x (0) = -1? • A solution’s region of attraction (ROA) is the set of initial guesses that converge to the particular solution. The ROA is often hard to determine

  25. Multi-Variable Newton-Raphson

  26. Multi-Variable Case, cont’d

  27. Multi-Variable Case, cont’d

  28. Jacobian Matrix

  29. Power Grid Planning Process • The determination of new transmission lines to build is done in a coordinated process between the transmission grid owners and the regional reliability coordinators (MISO for downstate Illinois, PJM for the ComEd area). • The planning process takes into account a number of issues including changes in the load and proposed new generators • States have the ultimate siting authority.

  30. MISO 2011 Report Proposed Projects https://www.misoenergy.org/Library/Repository/Study/MTEP/MTEP11/MTEP11_Draft_Report.pdf

  31. MISO Generation Queue (July 2010) Source: Midwest ISO MTEP10 Report, Figure 9.1-7

  32. MISO Conceptual EHV Overlay Black lines are DC, blue lines are 765kV, red are 500 kV Source: Midwest ISO MTEP08 Report

More Related