Line Limit Preserving Power System Equivalent

Slides:



Advertisements
Similar presentations
Applied Informatics Štefan BEREŽNÝ
Advertisements

Variational Methods for Graphical Models Micheal I. Jordan Zoubin Ghahramani Tommi S. Jaakkola Lawrence K. Saul Presented by: Afsaneh Shirazi.
16.4 Estimating the Cost of Operations Project GuidePrepared By Dr. T. Y. LinVinayan Verenkar Computer Science Dept San Jose State University.
CS4432: Database Systems II
Transportation Problem (TP) and Assignment Problem (AP)
Part 3 Linear Programming 3.4 Transportation Problem.
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.
1 Maximizing Lifetime of Sensor Surveillance Systems IEEE/ACM TRANSACTIONS ON NETWORKING Authors: Hai Liu, Xiaohua Jia, Peng-Jun Wan, Chih- Wei Yi, S.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
Computer Algorithms Integer Programming ECE 665 Professor Maciej Ciesielski By DFG.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Clustering In Large Graphs And Matrices Petros Drineas, Alan Frieze, Ravi Kannan, Santosh Vempala, V. Vinay Presented by Eric Anderson.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
CS Dept, City Univ.1 Maximal Lifetime Scheduling for Wireless Sensor Surveillance Networks Prof. Xiaohua Jia Dept. of Computer Science City University.
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 2 Ryan Kinworthy CSCE Advanced Constraint Processing.
Summarized by Soo-Jin Kim
Optimization for Operation of Power Systems with Performance Guarantee
Chapter 6 Linear Programming: The Simplex Method
Chapter 9 Network Theorems.
The Collocation of Measurement Points in Large Open Indoor Environment Kaikai Sheng, Zhicheng Gu, Xueyu Mao Xiaohua Tian, Weijie Wu, Xiaoying Gan Department.
Slide 1 of 27 Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and edited by Longin Jan Latecki.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
Low-Rank Kernel Learning with Bregman Matrix Divergences Brian Kulis, Matyas A. Sustik and Inderjit S. Dhillon Journal of Machine Learning Research 10.
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Branch-and-Cut Valid inequality: an inequality satisfied by all feasible solutions Cut: a valid inequality that is not part of the current formulation.
Client Assignment in Content Dissemination Networks for Dynamic Data Shetal Shah Krithi Ramamritham Indian Institute of Technology Bombay Chinya Ravishankar.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Lecture 14 Power Flow Professor Tom Overbye Department of Electrical and Computer Engineering ECE 476 POWER SYSTEM ANALYSIS.
Announcements Please read Chapter 7 HW 6 is due today
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
PIVOTING The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex.
Prof. Yu-Chee Tseng Department of Computer Science
Announcements Homework 7 is 6.46, 6.49, 6.52, 11.19, 11.21, 11.27; due date is October 30 Potential spring courses: ECE 431 and ECE 398RES (Renewable Electric.
Part 3 Linear Programming
Lap Chi Lau we will only use slides 4 to 19
Topics in Algorithms Lap Chi Lau.
Chapter 2 Resistive Circuits
The minimum cost flow problem
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Perturbation method, lexicographic method
ECEN 460 Power System Operation and Control
Chapter 1. Introduction Mathematical Programming (Optimization) Problem: min/max
LMP calculations Congestion evaluation
Load Flow Studies Eng. Edvan Moyo BEng, MEng, MBA
Chapter 4 Linear Programming: The Simplex Method
Part 3 Linear Programming
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Chap 3. The simplex method
Integer Programming (정수계획법)
ECE 333 Green Electric Energy
Branch and Bound.
ECEN 460 Power System Operation and Control
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Integer Programming (정수계획법)
Chapter 5 Transportation, Assignment, and Transshipment Problems
ECE 576 Power System Dynamics and Stability
Assignment Problems Guoming Tang CSC Graduate Lecture.
Uncapacitated Minimum Cost Problem in a Distribution Network
Flow Feasibility Problems
ECEN 615 Methods of Electric Power Systems Analysis
ECEN 615 Methods of Electric Power Systems Analysis
Part 3 Linear Programming
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Ax = b Methods for Solution of the System of Equations (ReCap):
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

Line Limit Preserving Power System Equivalent ECE 590I Line Limit Preserving Power System Equivalent Wonhyeok Jang Work with Prof. Overbye, Saurav Mohapatra & Hao Zhu

Contents Introduction Preliminaries Cases Algorithm Examples Conclusions

Introduction Equivalent power system Purpose of equivalent A model system with fewer nodes and branches than the original Purpose of equivalent More efficient simulation Without sacrificing too much fidelity of simulation results of the original

Introduction Ward equivalent (Kron’s reduction) Objective of work Traditional method to equivalence power system network models Loses desired attributes of the original system Objective of work Develop equivalents that preserve desired attributes, the line limits in this work, of the original system

Preliminary – Line limits Thermal line limits are intended to limit Temperature attained by the energized conductors Resulting sag Loss of tensile strength Limits are calculated where conductor sag is at minimum allowable clearance Geographical condition Climate condition

Preliminary - Kron’s reduction When a bus k between bus i and j is equivalenced First term on RHS is admittance of existing line Second term on RHS is admittance of equivalent line Theses equivalent lines have no limits Goal is to assign limits to theses equivalent lines that preserve desired attribute of the original

Preliminary - PTDF Power Transfer Distribution Factor Linear approximation of the impact of power flowing on each line w.r.t the amount t of an arbitrary basic transaction w ∆fl: fraction of power transfer flowing on line l ∆t: specific amount of transaction w Basic transaction 𝑤≜ 𝑚, 𝑛, 𝑡

Preliminary - PTDF PTDFs on the retained lines are not affected by equivalencing Original system with PTDFs from 2 to 3 Equivalent system with PTDFs from 2 to 3

Preliminary - MPT Desired attribute to preserve by assigning limits Maximum power transfer (MPT) between retained buses match that for the same buses in the original MPT between bus i and j can be calculated with PTDF 𝑀𝑃𝑇 𝑖𝑗 =min⁡ 𝐿𝑖𝑛𝑒 𝑙𝑖𝑚𝑖𝑡 𝑙 𝑃𝑇𝐷𝐹 𝑖𝑗,𝑙 l: each line of the system Need to match for MPTs between all the first neighbor buses of the bus being eliminated

General Case Bus E, between bus A and B, is going to be eliminated Need to calculate the new limit for the equivalent line between bus A and B

Special Case Series Combination If two lines are in series and the node joining them is equivalenced, then the total limit must be the lower of the two limits 𝐿𝑖𝑚𝑖𝑡 𝑡=min⁡(𝐿𝑖𝑚𝑖𝑡 1, 𝐿𝑖𝑚𝑖𝑡 2, . . . , 𝐿𝑖𝑚𝑖𝑡 𝑛)

Special Case Parallel Combination New limit is determined by which line in the parallel lines is binding 𝐿𝑖𝑚𝑖𝑡 𝑡=min⁡(𝐿𝑖𝑚1 𝑍1 𝑍𝑡 ,𝐿𝑖𝑚2 𝑍2 𝑍𝑡 , . . ., 𝐿𝑖𝑚𝑛 𝑍𝑛 𝑍𝑡 )

Algorithm Sequentially as each bus is being equivalenced Combine limits of parallel lines Calculate PTDFs between the first neighbor buses Calculate MPT between the first neighbor buses, only considering the lines that are being eliminated Limits on the retained lines do not need to be considered since they remain the same Determine limits for equivalent lines so the MPTs of the equivalent match that in the original

Ex - 4 bus system MPTs in the original system MPT 2-3: 216.7 MW (1-3 binding) MPT 2-4: 171.7 MW (1-4 binding) MPT 3-4: 144.9 MW (1-4 binding) For 2-3 direction, eq. line limits are Lim23 >= 216.7*0.234 = 50.7 MW Lim24 >= 216.7*0.024 = 5.2 MW Lim34 >= 216.7*0.088 = 19.1 MW Original system with PTDF from 2 to 3 Reduced system with PTDF from 2 to 3

Ex - 4 bus system (Exact solution) Directions 2-3 2-4 3-4 Eq Lim 23 >= 50.7 MW 4.8 MW 29.8 MW Eq Lim 24 >= 5.2 MW 41.4 MW 31.4 MW Eq Lim 34 >= 19.1 MW 18.7 MW 28.5 MW Often, solution is just the largest in each row This works when each column has one solution There are cases with no exact solutions when equality constraints for at least one direction may not by satisfied

Ex - 4 bus system (No solution 1 - Overestimate) When there’s no solution -> Bound the solution Line limit 1-4 is reduced from 60 MVA to 20 MVA Others are all the same with the original MPTs in the original system MPT 2-3: 216.7 MW (1-3 binding) MPT 2-4: 57.2 MW (1-4 binding) MPT 3-4: 48.3 MW (1-4 binding) Original system with PTDF from 2 to 3

Ex - 4 bus system (No solution 1 - Overestimate) Directions 2-3 2-4 3-4 Eq Lim 23 >= 50.7 MW 1.6 MW 9.9 MW Eq Lim 24 >= 5.2 MW 13.8 MW 10.5 MW Eq Lim 34 >= 19.1 MW 6.2 MW 9.5 MW All of the inequality constraints are satisfied for each row But power flow in direction 3-4 is overestimated since no entries in its column is enforced

Ex - 4 bus system (No solution 2 - underestimate) We make sure power flow in each direction is less than the original MPT Then at least one inequality constraints would be violated and this will underestimate the MPT We define “limit violation cost” for each entry of the matrix, which is the sum of violations for all entries in each row

Ex - 4 bus system (No solution 2 - underestimate) Original eq. line limit matrix Directions 2-3 2-4 3-4 Eq Lim 23 >= 50.7 MW 1.6 MW 9.9 MW Eq Lim 24 >= 5.2 MW 13.8 MW 10.5 MW Eq Lim 34 >= 19.1 MW 6.2 MW 9.5 MW Limit violation cost matrix Directions 2-3 2-4 3-4 Eq Lim 23 57.4 40.8 Eq Lim 24 13.9 3.3 Eq Lim 34 16.2 9.6 For the first row, the 2-3 entry is 0 since it involves no limit violations; the 2-4 entry 57.4 = (50.7 – 1.6) + (9.9 – 1.6) The 3-4 entry 40.8 = (50.7 – 9.9)

Ex - 4 bus system (No solution 2 - underestimate) Minimum matching problem – Hungarian algorithm Choose one entry in each row and each column that minimizes the sum of the violation costs Limit violation cost matrix Directions 2-3 2-4 3-4 Eq Lim 23 57.4 40.8 Eq Lim 24 13.9 3.3 Eq Lim 34 16.2 9.6 Underestimate solution Directions 2-3 2-4 3-4 Eq Lim 23 >= 50.7 MW 1.6 MW 9.9 MW Eq Lim 24 >= 5.2 MW 13.8 MW 10.5 MW Eq Lim 34 >= 19.1 MW 6.2 MW 9.5 MW

Conclusions Able to determine limits for eq. lines In case of no exact limits, we bound the limits When the number of first neighbor buses increase, then there’s rapid increase of the number of computation There’s a certain value of line limits that turns a exact solution case to no exact solution case Investigation of which factor changes solution types is needed

Thank you!

Ex - 7 bus system Original 7-bus system Eliminating bus 3

Ex - 7 bus system Determination of equivalent line limits 1-2 1-4 2-4 Eqv Line 1-2 11.2 MW 4.1 MW 1.2 MW Eqv Line 1-4 53.8 MW 56.8 MW 38.7 MW Eqv Line 2-4 17.8 MW 43.2 MW 61.3 MW MPT comparison of lines being eliminated between 7-bus and 6-bus 1-2 1-4 2-4 Original 7-bus 412.1 MW (line 1-3 binding) 187.1 MW (line 3-4 binding) 223.7 MW Reduced 6-bus (Eq line 1-2 binding) (Eq line 1-4 binding) (Eq line 2-4 binding) Error rate (%) 0.0 MPT comparison of all lines between 7-bus and 6-bus 1-2 1-4 2-4 Original 7-bus 118.7 MW (line 1-2 binding) 148.2 MW 223.7 MW (line 3-4 binding) Reduced 6-bus (Eq line 2-4 binding) Error rate (%) 0.0

Ex - 7 bus system Equivalent 6-bus system Eliminating bus 5

Ex - 7 bus system Determination of equivalent line limits 2-4 2-7 4-7 Eqv Line 2-4 22.9 MW 3.6 MW 10.6 MW Eqv Line 2-7 17.1 MW 96.4 MW 56.5 MW Eqv Line 4-7 37.1 MW 41.1 MW 49.4 MW MPT comparison of lines being eliminated between 6-bus and 5-bus 2-4 2-7 4-7 Reduced 6-bus 301.4 MW (line 4-5 binding) 250.1 MW (line 2-5 binding) 171.8 MW Reduced 5-bus (Eq line 2-4 binding) (Eq line 2-7 binding) (Eq line 4-7 binding) Error rate (%) 0.0 MPT comparison of all lines between 6-bus and 5-bus 2-4 2-7 4-7 Reduced 6-bus 223.7 MW (line 2-4 binding) 250.1 MW (line 2-5 binding) 171.8 MW (line 4-5 binding) Reduced 5-bus (Eq line 2-7 binding) (Eq line 4-7 binding) Error rate (%) 0.0

Ex - 7 bus system Equivalent 5-bus system Eliminating bus 2

Ex - 7 bus system (overestimate) Determination of equivalent line limits 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 53.4 MW 20.2 MW 23.8 MW 0.1 MW 45.9 MW 9.6 MW Eqv Line 1-6 37.5 MW 68.2 MW 75.0 MW 49.6 MW 50.4 MW Eqv Line 1-7 12.4 MW 14.9 MW 26.0 MW 35.1 MW 32.6 MW Eqv Line 4-6 27.6 MW 24.3 MW 11.2 MW 92.6 MW 76.3 MW 41.7 MW Eqv Line 4-7 6.8 MW 4.0 MW 10.1 MW 18.9 MW 35.2 MW 18.3 MW Eqv Line 6-7 1.6 MW 4.5 MW 10.4 MW 11.4 MW 45.5 MW

Ex - 7 bus system (overestimate) MPT comparison of lines being eliminated between 5-bus and 4-bus 1-4 1-6 1-7 4-6 4-7 6-7 Reduced 5-bus 148.2 MW (line 1-2 binding) 120.2 MW 123.3 MW 238.6 MW (line 2-4 binding) 275.3 MW 375.1 MW (line 2-7 binding) Reduced 4-bus (Eq line 1-4 binding) 132.2 MW (Eq line 1-6 binding) 166.4 MW (Eq line 1-7 binding) (Eq line 1-7 & Eq line 4-7 binding) (Eq line 6-7 binding) Error rate (%) 0.0 10.0 34.9 MPT comparison of all lines between 5-bus and 4-bus 1-4 1-6 1-7 4-6 4-7 6-7 Reduced 5-bus 148.2 MW (line 1-2 binding) 120.2 MW 123.3 MW 238.6 MW (line 2-4 binding) 171.8 MW (line 4-7 binding) 375.1 MW (line 2-7 binding) Reduced 4-bus (Eq line 1-4 binding) 132.2 MW (Eq line 1-6 binding) 154.9 MW (Eq line 1-7 binding) (Eq line 6-7 binding) Error rate (%) 0.0 10.0 34.9

Ex - 7 bus system (underestimate) Determination of equivalent line limits 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 53.4 MW 20.2 MW 23.8 MW 0.1 MW 45.9 MW 9.6 MW Eqv Line 1-6 37.5 MW 68.2 MW 75.0 MW 49.6 MW 50.4 MW Eqv Line 1-7 12.4 MW 14.9 MW 26.0 MW 35.1 MW 32.6 MW Eqv Line 4-6 27.6 MW 24.3 MW 11.2 MW 92.6 MW 76.3 MW 41.7 MW Eqv Line 4-7 6.8 MW 4.0 MW 10.1 MW 18.9 MW 35.2 MW 18.3 MW Eqv Line 6-7 1.6 MW 4.5 MW 10.4 MW 11.4 MW 45.5 MW Limit violation costs 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 0.0 62.7 51.6 152.3 7.5 104.8 Eqv Line 1-6 96.9 6.8 36.4 36.6 45.5 Eqv Line 1-7 59.1 49.0 15.7 72.7 2.4 Eqv Line 4-6 127.7 141.2 206.5 16.3 85.6 Eqv Line 4-7 55.1 69.5 42.1 17.5 Eqv Line 6-7 84.1 69.7 46.0 42.9 25.3

Ex - 7 bus system (underestimate) Find minimum sum of limit violation costs using Hungarian algorithm 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 0.00 55.86 35.88 152.28 7.47 104.80 Eqv Line 1-6 96.94 20.66 36.63 45.51 Eqv Line 1-7 59.12 42.26 72.73 2.44 Eqv Line 4-6 127.69 134.38 190.79 16.33 85.61 Eqv Line 4-7 55.11 62.68 26.42 17.54 Eqv Line 6-7 84.13 62.94 30.32 42.94 25.29 6.79 15.72 22.51

Ex - 7 bus system (underestimate) Find minimum sum of limit violation costs using Hungarian algorithm 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 0.00 55.86 35.88 152.28 7.47 104.80 Eqv Line 1-6 96.94 20.66 36.63 45.51 Eqv Line 1-7 59.12 42.26 72.73 2.44 Eqv Line 4-6 127.69 134.38 190.79 16.33 85.61 Eqv Line 4-7 55.11 62.68 26.42 17.54 Eqv Line 6-7 84.13 62.94 30.32 42.94 25.29 6.79 15.72 22.51

Ex - 7 bus system (underestimate) Determination of equivalent line limits 1-4 1-6 1-7 4-6 4-7 6-7 Eqv Line 1-4 53.4 20.2 23.8 0.1 45.9 9.6 Eqv Line 1-6 37.5 68.2 75.0 49.6 50.4 Eqv Line 1-7 12.4 14.9 26.0 35.1 32.6 Eqv Line 4-6 27.6 24.3 11.2 92.6 76.3 41.7 Eqv Line 4-7 6.8 4.0 10.1 18.9 35.2 18.3 Eqv Line 6-7 1.6 4.5 10.4 11.4 45.5

Ex - 7 bus system (underestimate) MPT comparison of lines being eliminated between 5-bus and 4-bus 1-4 1-6 1-7 4-6 4-7 6-7 Reduced 5-bus 148.2 MW (line 1-2 binding) 120.2 MW 123.3 MW 238.6 MW (line 2-4 binding) 275.3 MW 375.1 MW (line 2-7 binding) Reduced 4-bus (Eq line 1-4 binding) (Eq line 1-6 binding) (Eq line 1-7 binding) 217.0 MW 204.0 MW 298.7 MW Error rate (%) 0.0 -9.1 -25.9 -20.4 MPT comparison of all lines between 5-bus and 4-bus 1-4 1-6 1-7 4-6 4-7 6-7 Reduced 5-bus 148.2 MW (line 1-4 binding) 120.2 MW (line 1-2 binding) 123.3 MW 238.6 MW (line 2-4 binding) 171.8 MW (line 4-7 binding) 375.1 MW (line 2-7 binding) Reduced 4-bus (Eq line 1-6 binding) (Eq line 1-7 binding) 217.0 MW 298.7 MW Error rate (%) 0.0 -9.1 -20.4