You are on page 1of 286
EPRI Electric Power Research Institute Topics: EPRI EL-6145, Power system protection Project 2444-2 Protective relay coordination Final Report Relay settings December 1988 Distance relays Overcurrent relays RELAY code Computer-Aided Relay Protection Coordination Prepared by University of Washington Seattle, Washington SUBJECTS ToPIcs AUDIENCE BACKGROUND: OBJECTIVES ‘APPROACH RESULTS REPORT SUMMARY Power system planning and engineering / Power system operations Power system protection Distance relays Protective relay coordination Overcurrent relays Relay settings RELAY code ‘System protection and operation engineers Computer-Aided Relay Protection Coordination The coordination of protective relays—devices that detect power system abnormalities—allows utilities to assure power system ‘integrity and reliability. Computer-aided engineering tools such as the RELAY code will help protection engineers coordinate relay settings more accurately and with less effort than manual methods permit. Incorrect protective relay operation is a factor in many system interruptions. Manual relay coordination is time-consuming and sometimes results in incorrect relay settings, especially as system conditions change. Earlier work (EPRI report EL-3337) defined the functional characteristics of a computer-aided engineering (CAE) protection system, identifying steps in the relay coordination process. That study also developed an initial version of the computer-aided transmission protection system code (RELAY) for IBM ‘mainframes. Additional work under EPRI project RP2670-1 produced a ver- sion of the code for IBM-PC-compatible computers. To develop and document an interactive computer program that automati- cally produces protective relay settings with correct coordination. The project team documented enhancements made to the initial version of the RELAY code after publication of EPRI report EL-3397. These enhancements include further development of the database, a more effi cient approach to topological analysis, and more-etticient algorithms for ‘coordinating overcurrent and distance relays. They also documented the four test systems used in code development and validation. Puget Sound Power and Light Company tested the program. ‘The RELAY code, a modular software system, is built around a relational database management system (DBMS). Modules in the code include A short-circuit-current program +A topological analysis module that orders the primary-backup relay pairs “An overcurrent relay coordination module +A distance relay coordination module EPRI ELerss EPRI PERSPECTIVE PROJECT Interface programs allow each module to access data from or write results to the DBMS. Two versions of the software are available—one for an IBM mainframe (MVS/TSO, VM/CMS) and one for an IBM-PC- compatible computer. Both versions have interactive capability and can coordinate distance and overcurrent relays. The mainframe version inoludes some graphics capability; the menu-driven PC version does not provide graphics. The PC version can coordinate relays in a region of 10 buses and 20 lines and can be redimensioned to accommodate larger domains of interest Uiilities, faced with deregulation and the need to be more competitive, are seeking ways to improve productivity of their employees. Develop- ‘ments in computer hardware and software have made the computer an indispensable tool in productivity improvement. Setting and coordinating protective relays—traditionally performed manually by utiity engineers— is a time-consuming process. The introduction of CAE methods can improve productivity and provide better protective relay coordination, which in turn can improve system reliability. For example, Puget Sound Power and Light Company now uses the RELAY program regularly to coordinate relays on their 115-kV subtransmission system, The report documents work to date on the RELAY code and discusses ‘subsystem coordination and adaptive protection. Additional work under the current project is to develop RELAY code user's manual for release in 1988. RP2444-2 EPRI Project Manager: Dominic Maratukulam Electrical Systems Division Contractor: University of Washington For further information on EPRI research programs, call EPRI Technical Information Specialists (415) 855-2411 Computer-Aided Relay Protection Coordination EL6145 Research Project 2444.2 Final Report, December 1988 Prepared by UNIVERSITY OF WASHINGTON Department of Electrical Engineering FTO Seattle, Washington 98195 Principal investigators S.S, Venkata M. J, Damborg AK. Jampala R. Remaswami Prepared for Electric Power Research Institute 3412 Hillview Avenue Palo Alto, California 94304 EPRI Project Manager D. Maratukularn Power System Planning and Operatior Electrical Systems Division ORDERING INFORMATION Requests for copies of this report should be directed to Research Reports Center (RRO), Box 50490, Palo Alto, CA 94903, (415) 965.4081. There is no charge for reports requested by EPRI member uilites and afflates, US. utility associations, US. government agencies (federal, state, and local), media, and foreign organizations with which EPRI has {an information exchange agreement. On raquest, RAC will sand a catalog of EPRI reports. occ Power Resouch inst and EPRI ate egies sence mats of Else Pow Reser nate, ne \Conyritt © 1986 Elecre Power Research iste, Ie Al gts recone, Nonice, ‘hi repo wos prepares bythe orgezson) named below ao an scour of work sponeored by the Elctic Power Researen ie, ne. (EPA, Nother EPR, members ef CPR, he organo) named below ean poron acing on teal ary of ra: (} makes any Waray express er mpi, wl espct othe We ary ‘norman, acpi math, er provese dalosad ne rep or ht auch uae may net eagerly ‘ned gris: or 0) assures any Babies wth respect othe We to fo damages essing Kor the us ‘07 information, apparatus, maroc, or proces didoeed in ts repo. Proparod by Univers of Washington ‘Seat, Washington ABSTRACT ‘This is the final report on RP2444-2 which provides power system protection engineers with interactive tools for coordination of overcurrent and distance relays. The initial efforts of this, Project was under RP1764-6 and resulted in the EPRI report EL-3337 and in the first version of a set of computer programs to accomplish the coordination task. This report completes the documentation of that work. Two final versions of the computer code have been developed and are distributed by Electric Power Software Center, Dallas, Texas, one for IBM mainframes and one for PC's. ‘This report documents all the enhancements of the code beyond the results reported in EL 3337. These enhancements include further development of the database, a more efficient approach to the topological analysis and more efficient algorithms for the coordination of overcurrent and distance relays. An important feature of the code is that these modules are all integrated with a relational database management system (DBMS). The report also contains a discussion of the four test systems used in the code development and validation. Complete results are given for the largest test system, TS 4, a 38 bus, 61 line system from the Puget Sound Power and Light Co. (PSPL). ‘This CAE tool has proven to be very useful in engineering practice. PSPL uses it on a regular basis for their coordination needs and it has proven to give results that are at least 2s good, and in many respects superior to, those achieved "manually." Of course, it does so with a great savings in engineering effort. Finally, two advanced concepts, namely, subsystem coordination and adaptive transmission protection are also introduced and described. ACKNOWLEDGMENTS We are grateful to Electric Power Research Institute (EPRI) for supporting this work under project RP 2444-2. We also express our sincere appreciation to Mr. R. Iveson, Mr. J.V. Mitsche, Mr. M. G. Lauby and Mr. D. Maratukulam of EPRI for providing constructive suggestions and directions throughout the investigation of this work and other related work, We also gratefully acknowledge the assistance rendered by Puget Sound Power and Light (PSPL) Co,, Bellevue, Washington, since the inception of this work in 1981. We sincerely thank Mr. John Postforoosh of PSPL for educating us in the art and science of power system protection and for providing us all the assistance in developing and testing the RELAY software. This work could not have been successfully completed, but for his invaluable support. CONTENTS ‘Section 1 INTRODUCTION 12 Structure of RELAY 13. Test Systems 14 Capabilities of RELAY 1.5 Limitations of RELAY 1.6 Organization of the Report 17 References 2 DATABASE STRUCTURE 21 Database Basics 22 Fundamentals of RIM 2.2.1 RIM Access Through Applications Using the FORTRAN Interface 22.2. Direct Access Mode for User Entry and Query 23 Interaction of Code Modules with RIM Relations 24 Relations in the User Model 2.4.1 Topological Information 242 Relay Information 243° Fault Information 25 Relations in the Software Model 2.6 References 3 TOPOLOGICAL ANALYSIS 3.1 Introduction 32 Sparse Data Scheme 3.2.1 System Description 3.3. Algorithm for Loop Enumeration vil 1 12 15 19 110 1410 Ll 2 24 23 24 27 241 21 212 2-16 219 2-22 31 34 32 33 Section 3.4 Enumeration of BP, RSV and SSP 3.5 Comparison Between Matrix and LINKNET Methods 3.6 Use of SSP in Relay Coordination 3.6.1 An Expression for the Number of P/B Relay Pairs 3.7 Further Enhancements 3.7.1 Parallel Lines 3.8 Test Results 3.9 Implementation of the SETUP & TAP 3.10 Summary 3.11 References 4 OVERCURRENT RELAY COORDINATION 4.1 Coordination of Overcurrent Relays 42 Relay Settings 42.1 Instantaneous Tap Setting 4.2.2. Contingency of Instantaneous Unit Failure 42.3. Time Delay Pickup Tap Setting 4.2.4 Inclusion of Radial Lines 425 Time Dial Tap Setting 43 Enhancements to Overcurrent Relay Coordination Algorithm 43.1 Data Reduction in Overcurrent Relay Coordination 432 Data in Main Memory 44 Man-Machine Dialog in Overcurrent Relay Coordination 45 Coordination Review and System Performance Evaluation 46 — Test Results 4.6.1 Review and Analysis of Setting 4.7 Implementation of Algorithms 48 — References 5 DISTANCE RELAY COORDINATION 5.1 Coordination of Distance Relays 52 Relay Modeling 53 Zone 1 Setting 54 — Successive Zone Coordination Algorithm 5.4.1 Zone 2 Setting 542 Zone 3 Setting 5.5 Man-Machnine Dialog in Distance Relay Coordination 56 Test Results viii 3-10 31 313 343 3:16 3:16 3:27 3:29 3:29 44 44 44 42 42 42 43 44 44 45 46 49 49 49 4-21 4-22 Sl 52 52 53 54 5-12 5-15 Section 37 58 Implementation of Algorithms References 6 SUBSYSTEM COORDINATION 61 62 63 64 65 66 Definition of Problem [1] 6.1.1 Terminology Preliminary Investigation of Relay Response to ‘System Changes Subsystem Coordination Procedure Algorithms for Subsystem Identification and Coordination 64.1 Subsystem Identification 64.2, Subsystem Database Setup 64.3 Subsystem Coordination ‘Test System and Results Reference 7 ADAPTIVE TRANSMISSION PROTECTION TA 72 73 14 18 16 1 18 Definition of Adaptive Protection [1,1a] 7.1.1 Basis for Adaptive Protection ‘Why Adaptive Protection? Description of Adaptive Protection Concept ‘Hardware Communication and Control Software Human Factors Illustration of the Concept Parallelism in Relay Coordination 7.4.1 Parallelism Based on SSPs 742. Distributed Approach Distributed Computing Approach 75.1 Partitioning ‘Supercomputing Approach Results 7.71 Summary References S21 5:22 G1 Gl 62 65 19 Ta eld 72 72 74 7-26 7:24 7-26 7:16 Ta 1-28 Section 8 FUTURE DIRECTIONS OF ADAPTIVE TRANSMISSION PROTECTION 81 82 83 84 Introduction. Levels of Complexity in Adaptive Protection University of Washington Approach to Adaptive Protection References APPENDIX A INTERACTIVE COMPUTER GRAPHICS RELAY Al A2 A3 A4 AS AG Al GRAPH, a Program for Creating One-Line Diagrams AI Drawing a BUS 12. Drawing a LINE A113 Drawinga BREAKER A.14. Drawinga GENERATOR ALLS. Additional Remarks A.L6 Attributes of the Components A.L7 Input to the Graphics Programs ALB Cursor(s) GRAPH Installation and Execution A2.1 Program Execution Output of GRAPH A3.1 Relation ETCETERA A32 Relation BUSCORD A33_ Relation LINECORD A34 Relation BKRCORD A35 Relation GENCORD A36_ Limitations and Future Extensions GOCCORD, Graphics Version of OCCORD A4.1 Installing GOCCORD GDSCORD, Graphics Version of DSCORD AS5.1 Installing GDSCORD Graphics Reference APPENDIXB FAULT STUDY INTERFACE, Bi B2 Fault Study Fault Study Interface B2.1 Structure of Fault Study Interface B22 Preparation of Input Data &L bt B41 AS A10 Ad Al AB Al Al A16 AG A16 Al AClT AdT AB BA BA B22 B22 B23 Section B23 Limitations of Fault Study B24 Available User Options B25. Interactive Execution of TRAN and Results B26 Creation of Software Model APPENDIXC ANNOTATED BIBLIOGRAPHY ON DIGITAL RELAYING ca c2 c3 c4 cs co c7 Introduction Annotated Bibliography System Concepts, C3.1_ Advanced Substation Relaying C32. Unified System Relaying C33. Adaptive Transmission Protection Protected Components C4 Lines C4ad Algorithms for Line Protection CA12 Field Tests C42 Transformers C43. Generators Related Developments CS.1 Transducers C52 Communications C53. Fault Locators C54 Frequency-Related Measurements C55. Simulation and Modeling Automatic Switching Miscellaneous Articles Addendum to the Literature Summary Chronological iing of the Literature Page B27 B27 B28 B32 ci ci C1 C2 cs cs cu C2 CB C3 fost) cu cu C2 C2 C2 cu cas C25 C26 cn C27 C29 C30 Ll 12 13 14 15 21 22 23 Ba 32 33 34 3S 36 37 38 39 3.10 3a 3.12 41 ILLUSTRATIONS RELAY, Computer-Aided Engineering Protection Software Organization Test System 1 (TS 1) Test System 2 (TS 2) ‘Test System 3 (TS 3) ‘Test System 4 (TS 4) Overview of RIM Organization and Links to RELAY and User ‘Use of the Relations as Input and Output to the Programs in RELAY ° Condensed Version of Figure 2.2 Example System Example System with Phantom Bus and Relays LINENET Structure-Bus and Breaker Links LINKNET Structure-Remote Links Algorithms for Topological Analysis Loop Enumeration Algorithm Using DFS/BT Example System forAnalytical Determination of P/B Relay Pairs Ilustration of Enhancements to Topological Analysis Program Test System 4 (TS4) ‘Computer Output of TAP on Test System 4 (TS4) Structure of SETUP Structure of TAP Selection of Pickup Settings for Overcurrent Relays 13 15 16 17 18 22 28 210 4a 42 43 44 45 46 47 48 49 Sa 52 53 sa 5S 56 87 58 61 62 63 64 65 66 67 TA Selection of Pickup Settings for Overcurrent Relays (Continued) Warning Messages During Overcurrent Relay Coordination (Phase 11) Graphical Display of Warning Messages During Overcurrent Relay Coordination Final Settings of Overcurrent Relay (Output Phase) ‘Sample Output of Overcurrent Relay Coordination Program Fault Currents and Relaying Times for Fault Near O'Brien Bus Fault Currents and Relaying Times for Fault Near O'Brien with Breaker #34 Fault Currents and Relaying Times for Fault on Line T Structure of OCCORD Example System for Zones 1 and 2 Coordination Flow Chart for Zone 2 Coordination Example System for Zone 3 Coordination Zone 1 Reach on Three-Teminal Line log During Zone 2 Coordination Warning Message During Zone 3 Coordination Computer Output of DSCORD for Test System 4 (TS 4) Structure of DSCORD An Example System for Definitions of Subsystem Terminology Flow Chart for the Subsystem Coordination Procedure Flow Chart for the Subsystem Coordination Procedure Depth-First Search and Backtracking for Window Relays Identification Setting and Coordiantion Review at a Bus Computer Output of Subsystem Coordination Subsystem Identified by the Identification Algorithm Signal Flow in Power System Operation xiv age 47 47 4 4-10 419 4.20 4.20 42 53 58 59 5-13 54 S14 5-16 5-21 63 66 68 69 6-10 6-15 622 12 73 14 75 16 7a) 7b) 716) 71a) 71) 78 A2 AS B1 Digital Relays at the Substation Control Center Environment Mlustration of Parallelism Based on Set of Sequential Pairs Computational Schedule for TS 1 Tlustration of Distributed Computing Conceptual View of the Four Subsystems of TS4 Description of WS Subsystem Description of SS Subsystem Description of NC/SS Subsystem Description of NS Subsystem Illustration of Shared Memory Approach LEVEL 1 of GRAPH Execution LEVEL 2 of GRAPH Execution LEVEL 3 of GRAPH Execution Input Data and Output Details of Fault Study for a Sample System Structure of Fault Study and Interface ‘Sample Interactive Session for TRAN Using TS1 1-6 a 73 114 TAS a7 718 719 7:20 7a 72 Aq Ad AAl0 B10 B2Q B29 Table 1 24 3a 32 33 34 35 36 36 37 3.8 39 4a 42 43 44 45 Sa 52 61 62 ma 72 13 TABLES Description of Test Systems Data in LINES relation for ts 1 BUSLINK Relation for Example System LINELINK Relation for Example System ‘Loops of the System A Part of SSP Comparison of CPU Times between Matrix and LINKNET Methods Number of P/B Relay Pairs for TS 4 ‘Number of P/B Relay Pairs for TS 4 (Continued) Execution Times (S) for TAP and NEWTAP Program Execution Times (S) for Test Systems on IBM 4341 Computer Execution Times for Test Systems on P.C. Comparison of Fault Current Pairs for Test Systems Comparison of Execution Times (S) for OCCORD Summary of Overcurrent Relays’ Settings Performance Measures of Overcurrent Relays Execution Times (S) for Test Systems on IBM 4341 Computer Execution Times (S) for OCCORD on IBM 4341 Computer Execution Times (S) for Test Systems on Personal Computer Comparison of Relay Settings by Full and Subsystem Methods Comparison of Execution Times (S) on IBM 4341 Computer Performance Analysis of Overcurrent Relay Settings Characteristics of the Susbsystems of TS 4 Comparison of Execution Times (S) for TS 4 417 418 421 5-15 SS 62 6-25 72 7-16 1:28 14 75 16 1 ‘Comparison of Execution Times (S) for TS 4 (Three Processors Case) Comparison of Execution Times (5) for Test Systems on IBM 4341 and CRAY XMP-24 Computers Comparison of Relay Settings Performance of Relay Settings (Primary Relay Operation) xviii g 7.25 7-26 120 7-27 EXECUTIVE SUMMARY ‘This is the final report on a project to provide protection engineers with interactive tools, for coordination of overcurrent and distance relays. The initial efforts of this project resulted in the EPRI report EL 3337 and in the first version of a set of computer programs to accomplish the coordination task. This report completes the documentation of that work. Two final versions of computer code have been developed and are distributed by EPRI, one for IBM mainframes and one for PC's, Using the protection code, an engineer can compute the fault currents for both ground and phase faults and can coordinate both overcurrent and distance relays. Both types of relay coordination depend on an efficient ordering of the primary/backup relay pairs that come from analysis of the network topology. Hence, the code consists of individual software modules for each task. An important feature of the code is that these modules are all integrated with a relational database management system (DBMS). The use of a DBMS at the center of computer aided engineering (CAE) tools is emerging asa standard, very powerful approach for modern CAE development. With this approach, the engineer maintains a clear, conceptual understanding of the data involved as well as the ability to ‘manipulate and display that data for individual needs. The software can access the data through a "program interface.” The basic rule in code integration using the DBMS is that each module acquires the data it needs and returns its results to the DBMS. Then any subsequent need for these results can be met by the database. ‘This report documents all the enhancements of the CAE code beyond the results reported in EL 3337. These enhancements include further development of the database, a more efficient S-1 approach to the topological analysis and more efficient algorithms for the coordination of overcurrent and distance relays, The report also contains a discussion of the four test systems used in the code development and validation. Complete results are given for the largest test system, TS4, a 38 bus and 61 line system from the Puget Sound Power and Light Co. (PSPL). This CAE tool has proven to be very useful in engineering practice. PSPL uses it on a regular basis for their coordination needs and it has proven to give results that are at least as good, and in many respects superior to, those achieved "manually." Of course, it does so with a great savings in engineering effort. The CAE tool has also proven to handle the full complexity of the coordination problems faced by the PSPL engineers. No additional manual coordination is required to obtain a completely satisfactory solution. Major Accomplishments 1. The use of modern database management systems, RIM for IBM main-frame computers and R:Base for IBM compatible personal computers, played a central role in the development of the RELAY software in a Computer-Aided Engineering environment. 2. Topological Analysis Programs have been enlanced by the use of sparse matrix tediniques for generating the sequential set of relay pairs via LINKNET structure. ‘The enhanced algorithms also handle three-terminal lines and radial ines. 3. The overcurrent relay coordination programs have been extended to accommodate three- terminal, radial and parallel lines. The review and analysis of existing settings feature has been added. Both a non-graphics version (OCCORD) and a graphics version (GOCCORD) are available. The programs have been sucessfully applied to the entire 115-kV transmission system of PSPL, called TS 4. 4, Anew Successive Zone Coordination algorithm has been developed to coordinate zones 2 and 3 of distance relays. Both a non-graphics version (DSCORD) and a graphics version (GDSCORD) are available. The programs have also been sucessfully applied to TS 4, 5S. An advanced concept entitled "Subsystem Coordination" has been developed to identify the smallest portion of a system needing re-coordination for a change in the topology or loading conditions. The implementation of the algorithm for the TS 4 system is demonstrated. $2 6. A second advanced concept entitled "Adaptive Transmission Protection’, aimed at achieving real-time coordination of relays in an Energy Management System environment, has been developed. The the computational issues are also addressed in detail in this report. 7. Finally, several future directions for the project, particularly for adaptive transmission protection, are identified. 83 SECTION 1 INTRODUCTION LLIntroduction This report describes the work accomplished in research project RP 2444-2 performed Curing the period from July 1, 1983 to July 31, 1988, in terms of enhancements, extensions, additions and modifications accorded to the Computer Aided Transmission Protection System software, called RELAY, developed at the University of Washington (UW) under EPRI sponsorship. In addition, two novel concepts, Subsystem Coordination and Adaptive Protection are fully described. RELAY software carries out the relay coordination process for power transmission systems which use directional overcurrent relays and directional distance relays. Refer to EPRI Report No, EL-3337 entitled "Specifications of Computer-Aided Design of Transmission Protection’ for the details on the previous work performed during June 16, 1981 to June 30, 1983 under EPRI Contract No. RP 1764-6 [1] and to [2-8] for details about the theory and logic of the implemented software. ‘The RELAY software is written in FORTRAN 66 and implemented for IBM (VM/CMS and MVS operating systems) main-frame computers. A similar package is available for IBM-PC compatible micro-computers. The program execution takes place in an interactive mode, where the user furnishes required parameters/factors for the coordination process, upon being prompted by the software. This interactive process enables the user to exercise various options as the coordination process proceeds, and to assist the program in making decisions when coordiration problems arise, ‘Two separate user’s manuals, one for the IBM main-frame version [9] and another for PC versions [10], describe the details required for installing and carrying out relay coordination for power systems. 14 12 Structure of RELAY RELAY software has been designed to be "modular". Each program acts as a separate module and the interaction between modules is achieved through the central database. There is no direct data communication between any two modules. This concept facilitates adding user's own fault-study software, or additional modules such as power flow or stability analysis to the software at a future date, ‘An overview of the structure of RELAY is shown in Figure 1.1. A brief summary of the functions of each block is given below: 1. RIMData Base: A relational database management system called Relational Infermation Management (RIM) is used, A concise description of RIM and the additional capabilities of the database used for the protection system are given in Section 2 of this report. For PC software, a compatible data base called R:Base is used. Refer to [11] for further details about RIM and reference [12] for R:Base 5000. Before executing any of the programs in RELAY, the user loads the database with the required data, This is achieved through an interactive s jon, As the individual program execution proceeds, the required input data for the program is obtained trom the database through the FORTRAN interface. Upon the completion of the program execution, results, are stored back in the database through this interface, 2, Topological Analysis: This process is divided into two steps. SETUP program creates a linked list data structure called LINKNET [4] which describes the system connectivity. It also complements the RIM software by adding the relational algebra manipulation UNION, which is not available in the present version of RIM. More details about SETUP are available in Section 3, ‘Topological Analysis Program (TAP) enumerates the Set of Sequential Pairs (SSP), an optimal sequence of primary/backup relay pairs of the system. The SSP set is optimal in the sense that if overcurrent and distance relays are coordinated using this sequence, the convergence of the coordination process is assured and is rapid. More details about TAP are furnished in Section 3 of this report. 12 2 3 Fault Topological ean iy Analysis ‘Translator USER T Database G 3 Overcurrent Distance Relay Relay Coordination Coordination Figure 1.1 RELAY, Computer-Aided Engineering Protection Software Organization Fault Study Translator: A fault study made available by Puget Sound Power and Light Co., (PSPL) is integrated imo RELAY. This program loads the fault data in appropriate relations into the database for further use by the overcurrent and distance relay coordination programs, The details of this module are covered in Appendix-B. Overcurrent Relay Coordination Program: performs the coordination process of all the overcurrent relays in the system. ‘This is generally an iterative process due to the inherent loop structure of the power system [1]. A main portion of input needed for the execution of this program is the fault current values which are obtained from the database. This program execution takes place in an interactive mode where the user furnishes various parameters/factors/options upon being prompted by the program. ‘The user also guides ‘the program in making decisions whenever coordination problems arise. The final coordinated relay settings resulting from the execution of this program are stored beck in the database. Further details about this program are covered in Section 4 of this report. A graphics version is also available for IBM 4341 VM/CMS system, 5. Distance Relay Coordination Program: achieves the coordination of all the distance relays of the given power system, Again, the loop structure of the system calls for an iterative process. The required apparent fault impedances to this program for consideration in the coordination process are retrieved from the database. This interactive version obtains other needed coordination parameters/factors/option from the user and stores all the final coordinated setting values in the database. Other details required to load the input and execute the program are presented in Section 5. ‘The maximum size of a system that can be coordinated using RELAY is limited only by the available main memory space. However, based on the protection engineer's normal practice of considering only a subsystem at a time, the software is designed to handle systems having a maximum size of 50 buses/100 lines. A larger system can be analyzed by properly modifying the array dimensions of the software. Guidelines for these types of modifications are indicated in the internal documentation of the programs. However, itis anticipated that a typical system of about 10 buses and 20 lines may be representative of the protection engineer's domain of interest. The sequence in which RELAY carries out the coordination process is summarized in the following four steps: 1. Enter required data into database. 2a, Create LINKNET using SETUP. 2b. Perform a topological analysis of the given system to identify an optimum sequence of relays (SSP) using TAP. 3. Performa fault analysis to obtain the fault currents and impedances. 4. Coordinate all the directional overcurrent relays of the system. 5. Coordinate all the distance relays of the system. with the typical utility practice, the overcurrent relays perform the ground fault protection and the distance relays perform the phase fault protection However, as detailed in Section 4, overcurrent relays for phase fault protection can also be considered by giving the appropriate inputs. 14 1.3 Test Systems ‘The early versions of the software were tested on a small, 6-bus, 7-line system called TS 1 described in detail in [1]. Later the enhanced versions of the program were tested on a 10-bus, 15-line system termed as TS 2, which includes two sets of parallel lines and a three-terminal line. This second system is of the typical size which a protection engineer often tries to coordinate. Puget Sound Power & Light Company (PSPL) engineers, who have been experimenting with this tool in their protection system operations, developed a more practical 20-bus, 33-line system designated as TS 3 system. PSPL's entire 115-KV transmission network consisting of 38-bus, 61- line system, called TS 4, is the largest system coordinated using this software package. The one- line diagrams of these four systems are illustrated in Figures 1.2. to 1.5. Note that TS 1, TS 2, and ‘TS 3 are part of TS 4. The salient features of these systems are summarized in Table 1.1. Table 1.1 Description of Test Systems Test Buses Lines Parallel/3-Terminal Relays System Lines TS1 6 7 None/1 4 TS2 10 15 2 31 Ts3 20 33 "” 69 TS4 38 6 u/s 126 oS ok Oude igure 1.2 TEST SYSTEM 1 (TS 1) 1s (CSL) INALSAS LSAL €1 emndty reenmena song = © TL Tro Tr ar] er] er] [i JE a | C1 TT 1 a a H ft . st] fr or] fe] Ee me aa © ae O ag -O aa oz | jet | [st i ro eS ve Se vel ce Ww N da a aA s We 3 cs =] Be] Fe] Fe] Be] Ee) De] foe DTT tet aa Oma &] [re] [i] oe seeseee iene © i) AED 16 a r Figure 1.4 Test System 3 (TS 3) 17 Figure 15 Test System 4 (TS 4) 18 1.4 Capabilities of RELAY ‘A summary of the capabilities of the software is given below: Topologies: = Two-terminal lines - Three-terminal tines - Parallel lines - Any number of adjacent or parallel three-terminal lines - Three-terminal lines with any two branches in Parallel Radial lines - Loops Overcurrent Relays: - Both instantaneous and time-delayed units - Settings and coordination - performance review of settings - Review and comparison of two different sets of settings - Mathematical models for Westinghouse CO-9 RELAY Distance Relays: - Three zones - Pilot for zone 1 = Setting and coordination - Mathematical models for Westinghouse KD RELAY raph - Single line diagram in color - Windows - Graphics interface for overcurrent relay coordination = Graphics interface for distance relay coordination 19 .5 Limitations of RELAY The software considers only overcurrent and distance relays for system protection and these are considered independent of each other. As detailed in Section 5, the user cen opt to choose pilot schemes at certain breakers, if distance relays are found inadequate. - The overcurrent coordination program can be used for both ground and phase protection while the distance coordination program is applicable only for phase protection. = Consideration of multi-terminal lines is limited only to three-terminal lines. = Only one level of backup protection is considered. - Distance relays are provided with only three zones of operation. 1,6 Organization of the Report Section 2 presents the RIM database management system structure and the details on the database requirements for overcurrent and distance relay coordination. Section 3 describes the SETUP and Topological Analysis Program (TAP) including details, about the input, a sample session and the output for the test system TS 4. The use of sparse matrix technique for generating the sequential set of relay pairs via LINKNET structure is demonstrated. Section 4 describes the overcurrent coordination program enhancements to accommodate ‘three-terminal, radial and parallel lines. Both a non-graphies version (OCCORD) and a graphies version (GOCCORD) are included. Results including the performance evaluation for the TS 4 system is displayed. Section 5 deals with the distance coordination program enhancements for both the non- graphics version (DSCORD) and the graphics version (GDSCORD), including details about the input, a sample session and the output results for TS 4, Section 6 is entirely devoted to the development of an advanced concept entitled "Subsystem Coordination", Implementation of the algorithm for the TS 4 system is described in this section. Section 7 delves into a second advanced concept for achieving real-time coordination of relays in an Energy Management System environment. The concept and the computational issues are addressed in this section. Section & outlines several future directions for the project, particularly for adaptive protection, Appendix A provides the necessary background for the generation of system diagrams and other graphics. It is only applicable for the mainframe version with IBM computers only. Appendix B describes the fault study interface details. Appendix C annotates the literature on digital relaying needed to understand the adaptive protection concept. 17 References 1. M4. Damborg, S.S.Venkata, Specification of Computer-Aided Design of Transmission Protection Systems, Final Report EL-3337, RP 1764-6, EPRI, Jan. 1984, 2. M.J. Damborg, R. Ramaswami, et al., "Computer-Aided Transmission Protection System Design, Part I Algorithms", IEEE Trans, on PAS, Vol. PAS-103, pp. 51-9, Jan. 1984, R. Ramaswami, S.S. Venkata, et al., "Computer-Aided Transmission Protection System Design, Part II: Implementation and Results’, Ibid , pp. 60-5. 4, R. Ramaswami, MJ. Damborg, et al., "Enhanced Algorithms for Transmission Protective Relay Coordination", IEEE Trans, on Power Delivery, Vol. PWRD-I, Jan. 1986, pp. 280-7. 5. MJ. Damborg, R. Ramaswami, et al., "Application of Relational Database to Computer Aided-Engineering of Transmission Protection Systems’, IEEE Trans, on Power Systems, Vol. PWRS-1, No. 2, May 1986, pp. 187-93. 6 SS. Venkata, AK, Jampala, et al, "C.A.E. of Transmission Protection Coordination: Puget Power Experience’, IEEE Trans.on Power Delivery, Vol. PWRD-2, No. 3, July 1987, pp. 7. John Postforgosh, "Computer Program Coordinates Relay Operations, Transmission & Distribution, Vol. 39, No. 6, June 1987, pp. 50-3 8. A. K. Jampala S. S. Venkata, M, J. Damborg, “Adaptive Transmission Protection - donal Issues" A paper presented at the 1988 IEEE /PES Summer Power Meeting, 88 SM 528-2, (to appear in IEEE Trans. on Power Delivery). 9. RELAY IBM MVS/TSO VM/CMS User's Manual, EPRI, To be published, 10, RELAY PC User's Manual, EPRI, To be published. 11. User Guide: RIM 5.0, Boeing Commercial Airplane Co., Seattle, Wa., 1982. 12, R:Base Series $000 User's Manual & Tutorial, Microrim Inc., Redmond, WA., 1985. Lat SECTION 2 DATA BASE STRUCTURE. 2.1 Database Basics As Figure 1.1 suggests, 2 DataBase Management System (DBMS) is an integral part of the RELAY software system. A DBMS is extremely useful when developing a package such as RELAY because it provides a stable data repository which serves to integrate the different software applications programs or "modules". More importantly, the DBMS serves the user by providing an organization for the data and a manipulation capability which permits the user to understand and modify the data easily once the DBMS interface is mastered, These comments would be true for most engineering tools but are especially valid when the volume of data becomes large as it does in relay coordination [1]. A database management software package called Relational Information Management (RIM) is used for RELAY. The details about the capabilities and guidelines for users can be found in the RIM User Guide [2] for the mainframe version and R:Base 5000 User's Manuel [3] for the PC version. The basic concepts involved in using a DBMS with an application package like RELAY are illustrated in Figure 2.1. As this figure shows, the DBMS stands between the user (including the applications software) and the disk containing the actual data. Refer to Chapter 4 of [1] for a detailed discussion of database concepts, Only an abreviated summary is given here. ‘The DBMS can be thought of as a series of models or mappings of the data from one form into another. At the machine level is the "internal model" which is the interface to the actual storage on the disk. The user generally does not concern himself or herself with this model. 24 USER |.» SOFTWARE : ‘| [ sormware USER : : CEXTERNAL) [-O(CONCEPTUAL}@-O TNTERNAL |} : ‘MODEL MODEL : RIM-FORTRAN INTERFACE, ‘DIRECT: RIM INTERACTIVE SESSION ‘USER TERMINAL ‘STORAGE DEVICE Figure 2.1 Overview of RIM Organization and Links to RELAY and User At the center of the DBMS is the “user model", This is probably the most important concept in a DBMS. The user model is the basic organization tool and consists of structures containing all the data. In relational DBMS's such as RIM, the user model is a set of relations or tables. Each table consists of columns labeled by data item or “attribute” and rows containing the occurances of the data items. An example of such a relation is that labeled LINES in Table 2. This relation contains the data for test system number 1 (TS 1) and will be described in more detail later. For now it is enough to observe that each row indicates which bus and breaker occurs on the ends of some line. In cases of parallel lines, a circuit number distinguishes between them. Hence, this relation provides the basic structural information on the system, Table 2.1 Data in LINES Relation for TS 1 LINENO —FROMBUS TOBUS-FROMBKR © TOBKR = CKTNO D 1 4 5 0 E 6 2 9 0 c 1 6 7 2 Hq 4 4 10 ° 1 5 uv 45 0 K 6 3 16 o L 6 n 8 ° 22 ‘The complete user model consists of many such relations. All data items (attributes) used by RELAY must be assigned to a column in at least one such relation. In fact, the organization of the relations (the assignment of attributes to columns) must satisfy basic principles which make the relations easy to maintain (modify, update) and easy for the user to understand while conveying the necessary information [1,4]. The “software models" also consist of sets of relations and contain a subset of the attributes contained in the user model. These relations are organized to enhance the performance of the application programs which depend upon them. Normally more than one software model exists with each being designed for the specific needs of a particular software program. In [1], as in the database literature, the terms "conceptual model" and "external model’ are used in place of “user model" and "software model” respectively. However, we will use the later terms in this report in the hope that they are more intuitive. Following this introductory material on DBMS‘s, this section will provide basic information ‘on RIM, specifically on distinguishing the direct interactive mode from access through application programs, Then a summary view shows how the different code modules of RELAY depend on specific relations in the database, Finally, the relations in the user and software models are defined. 2.2. Fundamentals of RIM There are two modes for accessing data from the RIM DBMS: by the direct (stand-alone) mode and by interacting with applications which access data through the FORTRAN interface, wugh applications using the FORTRAN interface ‘When one is performing a relay coordination, one is interacting with the RELAY software as indicated in Figure 2.1, ‘This software, in turn, interacts with the software model using the RIM-FORTRAN interface. The software models are extracted as necessary from the user model using additional code segments (or procedures, as we call them). Since these "extraction" code segments must be executed by the user at the appropriate stage in a coordination session, the user must understand how data "flows" through the models. However, when the user model extracts the data from the disk through the internal model no user awareness is necessary. 23 ‘The RIM-FORTRAN interface, which allows an application program to access and modify a RIM database, consists of subroutines contained in the RIM library, RIMLIB. These subroutines are the counterparts of various RIM commands in the interactive mode discussed below. Some of the subroutines normally used are listed below with a brief description of their functions. Subroutines Functions RMOPEN (db) Open the data base db RMCLOS Close the data base RMUSER (pw) Password specification RMFIND Access a particular relation RMWHER Qualify a set of rows for retrieval RMGET Get a row of data from the relation RMLOAD Load a row of data into the relation RMDEL Delete a row of data from the relation 2.2.2 Direct Access Mode for User Entry and Query ‘The direct mode permits the user to manipulate the basic relations using the Data Manipulation Language (DML) provided as a part of RIM (Figure 2.1). Here data can be entered, deleted and reorganized directly from the user terminal. Much of the reorganization capability depends on the relational algebra which permits new relations to be formed through logical operations like PROJECT, JOIN and INTERSECT. These operators manipulate the tables as sets and provide the user with great power to modify the data organization. Refer to the RIM User Guide [2] , or the R:Base Manual [3] , for a discussion of these and other relational operators. Itis the direct mode that the protection engineer uses to enter basic data about his system. in preparation for a relay coordination session. However, the interaction used for this purpose is quite simple. The basic relations are all defined for the user automatically by the RELAY software and the user simply needs to enter the system data necessary to get started. Consequently, one need not be conversant with all features of the DML to get started with 24 RELAY. However, we suggest one will find the direct mode for accessing data useful and will ‘want to develop that capability. For this purpose, one should refer to the RIM User Guide [2] or R:Base 5000 [3] as the case may be. The direct mode of RIM is entered through the command RIM. Two further submodes are available, one for the beginner (called Menu Mode) and the other for the experienced user (called Command Mode). A new database can be created by the DEFINE submodule. This submodule creates the “schema,” the definition of the data base, ‘Then the user enters the LOAD submodule where the data is loaded into the relations. Once data entry is completed, the user can query the database to exhibit the structure of the relations (the schema) and the content of the relations (the data). RIM also provides for modifications of existing data through a number of modification commands. The creation of new relations from existing relations is made possible through the relational algebra commands. A HELP module is provided in RIM which presents a description of the available RIM commands. A set of RIM commands normally used is presented below ( Similar commands are used with R:Base). RIM ‘Access Interactive Standalone RIM. FINE" submodule DEFINE dbname _Start creating a new data base “dbname” OWNER password Define a password for “dbname” ATTRIBUTES Start definition of attributes atl REAL att2 INT att3 TEXT RELATIONS Define the relations by grouping the attributes rell WITH att] att2 END 25 LOAD rel Start loading rel1 with data ‘Valuel Value2 END List List all relations in the database LIST rel List the schema of rel SELECT ALLFROMrell Display all the data from rell Modifications CHANGE att! to value IN rel1 RENAME RELATION rel8 TO rel9 REMOVE rel6 Relational Algebra Commands INTERSECT rell WITH rel2 FORMING rel3 Form a new relation rel3 by intersecting rell with rel2 (ie. based ‘on equal values of common attributes in rell and rel2). JOIN rell USING att! WITH rel2 USING att2 FORMING rel3 Form a new relation rel3 by comparing att! of rel with att2 of rel2. PROJECT rel3 FROM rel2 USING att! att2 Form rel3, a subset of rel2. Most of the above commands can be made more selective by adding a conditional WHERE clause which selects only the set of rows that satisfy the condition. Other General Commands OPEN dbname Open an existing data base "dbname" CLOSE Close the database INPUT fn Read commands that follow from a file fn 26 OUTPUT fn2 Route all outputs that follow to a file fn2 UNLOAD ALL Create a RIM-readable file of the database EXIT or QUIT Save the database and quit RIM session. Each database creates three RIM-generated files named by suffixing the database name with 1,2, and 3, For example, a database named "PROTDB" will be stored in the three files PROTDBI, PROTDB?2 and PROTDB3. Figures 2.2 and 2.3 show the “flow” of data between the various application programs and procedures of the RELAY database, Figure 2.2 is the most complete where the names of the programs such as STRLBLD and SETUP appear accross the top and the individual relation names appear down the left side and in the middle of the table. For example, this table indicates that the relation BUSLINK is an output of the module SETUP and an input to the module TAP. Figure 2.3 is an abrievated form of this table where the names in the interior are replaced by the incidence indicator "X". ‘The information in the two tables is the same. The order of the programs across the top of these tables, from left to right, indicates the order in which they must be executed. This is evident from examining the tables. For example, LINESBD must be created by STRLBLD before it can be used as an input to SETUP. Note that some of these programs basically reorganize data into new relations. These new relations tend to be the software models. For example, STRLBLD is a procedure that must be used at the outset to take the data that one entered when first defining a new system and prepares the three relations OCRLPARA, DSRLPARA and LINESBD. This last relation is then used as input to the module SETUP. After programs TAP and TRAN have been executed, the procedure FLTBLD is run which reorganizes the data into the relations OCPRIFLT, OCFLTDAT, DSPRIFLT and DSFLTDAT. AV TAY ut suresB01g aun o1 mding pu yedoy se suoR Dy 2Mp Jo.98717'7 ans AINIGHIZ avastasa isd sd, ISd swmueRg ins wea Wa sor ssa sed Ssd | = vaveRD0 vavaTioo veing my nding rmdoy nding) adap av dnas qraTyis TS aeryresoe RnR Oy andy syne peo (Cpiu09) A.V Tay Ut surexBo4g axp 01 ndinG pu Induy se suonEjay a1p $0 9871 Tz aUNL ANNI, ANIANIZ, war ysa awaresa ‘Tuniasa ansd. AVGLEDO LVALEDO LvaIADO ‘TTAADO 7ATEIO vavanisd vavaTisa vaveRD0 vayeTD0 wor waz ‘Za wa, TOL antanirz avarisa T1aniasa meq “Avaziig supe zauag ane Ta1Ed eq Perret] ALOLTE = maim aval want 4 wea SENT —SBoqodoy, nant EngNI _*womeN vuvaTisa ‘SLASEZ SSa sum, SAVL190 ss9memg SIdOWD0 Aa LodOW0 wanma349 ——— mea RS abugtey— redone wopmey momo 29 ZZ ainhy Jo wojsi9, pastapmag ez amir NEI mow ayoosa nm MO TO a mf MO MO aVL_— -dnlas aTaTULs 0200 TAIT NVUL 2-10 24 Relations in the User Model ‘A user model consisting of twenty-seven relations has been designed for the protection system. The structure of these relations is consistent with the protection engineer's intuition about the system and are designed in such a way that the data entry by the user is natural and minimal, ‘The relations in the user model can be divided into the following three categories: ‘Topological Information Relay Information Fault Information: A summary of these twenty seven relations follows. 24, pological information ‘These relations describe the topological details of the system. ‘These relations along with their attribute details are given below: Relation: LINES This relation conveys the connectivity information between lines, buses and breakers. Attributes Description LINENO Line Designation FROMBUS Emanating Bus Number TOBUS Terminating Bus Number FROMBKR Emanating Breaker TOBKR Terminating Breaker CKTNO Circuit Number of the Line Relation: BUSES ‘This relation assigns names to all the buses in the system. 2Al Attributes — Description BUSNO Bus Number BUSNAME. Bus Name Relation: INPUT Details about phantom breakers are included here. Phantom breakers are imaginary breakers at the junction points of three-terminal lines. Attributes Deseription NBPSSP —_ Number of Set of Sequential Pairs (SSP) corresponding to Break-Point Set. NPHBKRS Number of Phantom Breakers PHBKRS __List of Phantom Breakers Relation: CTPTLN This relation includes data about the CT's and VT's associated with a breaker, line parameters and load current values. Attributes Description BKRNO _ Breaker Designation CIR CT Ratio VIR VT Ratio LINANG __Line Angle (degrees) AILDMX — Maximum Load Current (amps) ANLDMN Minimum Load Angle (degrees) 242 Relay information ‘These relations contain the parameters of all overcurrent and distance relays, Relation: OCMODO7 This relation gives a seven coefficient polynomial model for the overcurrent relay, Descint RLYTYP Relay Type MODCO7 = Model Coefficients 212 Relation: OCMOD1S ‘This relation gives a fifteen coefficient polynomial model for the overcurrent relay. Attributes Description RLYTYP Relay Type MODCOIS Model Coefficients Relation: OCTTAPS ‘This relation contains information about the pickup taps available on the time-delayed unit of the overcurrent relay. Attributes — Description TRANGE — Range Designation TUTAPS Available Taps Relation: OCITAPS This relation contains information about the pickup taps available on the instantaneous unit of the overcurrent relay. Attributes Description IRANGE Range Designation TTAPS Available Taps Relation: OCRLYID ‘This relation lists the specifications of all the overcurrent relays. Attributes Description BKRNO Breaker Designation RLYTYP Relay Type TRANGE Range of Time-Delayed Unit IRANGE Range of Instantaneous Unit Relation: OCSETS This relation contains the breaker numbers and "dummy" initial settings of all overcurrent relays. 213 Attributes Description BKRNO _ Breaker Designation PU Pickup Current Setting of Time-Delayed Unit TDs Time Dial Setting moc Instantaneous Unit Setting Relation: OCRLPARA ‘This relation contains the overcurrent relay parameters. Some of these parameters appear in other relations but the final relay settings also appear here. ribute Description BKRNO Breaker Designation 1PU Pickup Current Setting of Time-Delayed Unit, Final Value TDS Time Dial Setting, Final Value moc Instantaneous Unit Setting, Final Value CIR CT Ratio AILDMX Maximum Load Current (amps) TUTAPS Available Pickup Taps, Time-delay Unit ITAPS Avi ible Taps, Instantaneous Unit MODCO7 Model Coefficients, 7 Term Model MODCO1S Model Coefficients, 15 Term Model Relation: DSS ‘This relation lists the available impedance taps (S taps) on the distance relays. Attributes Description RLYTYP Relay Type STAPS Available S Taps Relation: DSM ‘This relation lists the available impedance taps (M taps)on the distance relays. ; oe RLYTYP Relay Type MTAPS Available M Taps 214 Relation: DST ‘This relation lists the available impedance taps (T taps) on the distance relays. Attributes Description TRNG Range Designation TTAPS Available T Taps Relation: DSRLYID This relation lists the specifications of all the distance relays. BKRNO Breaker Designation RLYTYP Relay Type TIRNG Range of Tfor Zone | T2RNG Range of Tfor Zone 2 T3RNG Range of Tfor Zone 3 TORANGI1 Relay Torque Angle for Zone | (degrees) TORANG2 Relay Torque Angle for Zone 2 (degrees) TORANG3 Relay Torque Angle for Zone 3 (degrees) Relations: ZISETS, Z2SETS and Z3SETS ‘These relations contain the breaker numbers and "dummy! initial values for all distance relay settings, Here Attributes BKRNO. ZnPRI Zn SSETn TSETn MSETa Tn 3 and represents the zones. Description Breaker Designation Impedance Setting Value for Z in p.u, Line Values Impedance Setting Value for Z in Secondary Relay Values Setting of Tap $ for Zone-n Setting of Tap T for Zone-n Setting of Tap M for Zone-n Time Delay for Zone-n, n = 2,3 245 Relation: DSRLPARA This relation contains the distance relay parameters including parameters appearing in some of the other relations. It also contains the final values of the distance relay settings. As in the previous cases, n=1,2,3 representing the three zones so Zn below represents three attributes. Attributes Description BKRNO _ Breaker Designation ZnPRI—_Final Impedance Setting Value for Z in p.u. Line Values Za Final Impedance Setting Value for Z, Secondary Relay Values SSETn _ Setting of Tap S for Zone-n, Final Values TSETn _ Setting of Tap T for Zone-n, Final Values MSETn _ Setting of Tap M for Zone-n, Final Values Tm Time Delay for Zone-n, n = 2,3, Final Values cIR CT Ratio PIR VT Ratio TORANGn Relay Torque Angle, Zone n (degrees) LINANG Line Angle (degrees) AILDMX — Maximum Load Current (amps) ANLDMN Minimum Load Angle (degrees) STAPS Available S Taps MTAPS Available M Taps TTAPSn Available T Taps, Zone n 2.4.3 Fault information Alll the fault study results which are to be considered for relay coordination are stored in the following relations: Relation: FLTPAR This relation designates faults by fault type and fault impedance. 2-16 F : FLTDES Fault Designation FLITYPE Fault Type FLTIMP Fault Impedance Relation: ELYTOTY ‘This relation indicates the number of fault conditions for overcurrent and distance relays coordination, Attributes Description IFLTNO Number of Fault Conditions for Overcurrent Relays ZFLTNO Number of Fault Conditions for Distance Relays Relations: ELTIDI and FLTIDZ These two relations have similar structure as given below. They describe the various faults considered. The relation FLTIDI concerns overcurrent relays and FLTIDZ concerns distance relays. Attributes Description FLTNO Fault Number FLTLOC — Fault Location FLTDES Fault Designation FLTCLS Fault Class LNOUT Line Out Relation: ELTIDAT This relation contains all the fault current data for overcurrent relay coordination. Attributes Description FLTNO Fault Number SNSRLY Sensing Relay SNSCUR _ Sensed Current RFLAG Relay Flag: Primary Relay, B = Backup Relay 2.17 Relation: OCFLTDAT. This relation contains overcurrent relay fault data for primary and backup pairs. It also contains some data that appears in other relations, but it is the only relation in which primary and backup fault current pairs are given. Attributes FLTCLS FLTLOC FLTTYPE LNOUT FLTIMP PRLY PRLYCR BRLY BRLYCR Description Fault Class Fault Location Fault Type Line Out Fault Impedance Primary Relay Primary Relay Current Backup Relay Backup Relay Current Relation: FLIZDAT ‘This relation contains all the fault impedance data for distance relay coordination. Attributes FLTNO. SNSRLY ‘SNSIMP RFLAG Deaintl Fault Number Sensing Relay Sensed Impedance Relay Flag: P = Primary Relay, B = Backup Relay Relation: DSFLTDAT This relation contains the fault impedance data for primary and backup relay pairs. It also contains some relay data that appears in other relations. Attributes FLTCLS FLTLOC. FLTTYPE LNOUT. Description Fault Class Fault Location Fault Type Line Out 218 FLTIMP Fault Impedance PRLY Primary Relay PRLYZ Apparent Impedance Seen by Primary Relay BRLY Backup Relay BRLYZ Apparent Impedance Seen by Backup Relay 2.5 Relations in the Software Mode} The nine additional relations below comprise the software models. As in the original definition of the software model, these relations are constructed from data already in the database and organized for the specific use of one or more software modules. Whereas there can certainly be some ambigiuity as to how to class a specific relation (software or user model), we consider the software model to be the relations which do not exist until organized by one of the three modules STRLBLD, SETUP and FLTBLD. ‘These modules all have the role of taking data and reorganizing it as opposed to solving a portion of the coordination problem. A further requirement is that the user is not expected to want to view any information in the relations in the software model directly. When the software model was first defined, it was described as a reorganization of data in the user model. That is, only data already in the user model would appear. Here we modify that concept a bit. The software model in RELAY consists of relations which contain data in the user model organized for convenience but also some data of an "internal" nature which the user is not interested in, For example, the relation LINESBD below contains the names of "from" and "to" ‘buses on a line (rather than line numbers as in LINES). Technically these are new attributes even though the names of all buses appear in the relation BUSES in the user model. ‘The nine software model relations are described below in a slightly different format. With each relation is a simple list of its attributes. Any attributes not defined as a part of the user model are defined at the end of the Relation Purpose LINESBD BUSLINK LINELINK, FLTRLY PAIRS Same as 'LINES' with bus names indicated Used to describe system connectivity Used to describe system connectivity Relay identification by end buses Set of sequential pairs Information on parallel lines 2-20 LINENO FBNAME TBNAME, FROMBKR TOBKR CKTNO NODE List BUSNO DEGREE END NEXT FAR BKRNO. LINENO FBNAME. TBNAME CKTNO BKRNO. PRLY BRLY LINENO. FROMBUS TOBUS FROMBKR TOBKR CKTNO OCPRIFLT —_ Overcurrent primary relay fault data FLTCLS FLTLOC FLTTYPE LNOUT FLTIMP PRLY PRLYCR DSPRIFLT _Distance primary relay fault data FLTCLS FLTLOC FLTTYPE LNOUT FLTIMP PRLY PRLYZ ‘ZIMPINT Intermediate impedances for PRLY distance relay coordination BRLY LNOUT ZRBUP ZBUP ‘ZPRIM ‘A description of those attributes which were not defined in the user model is as follows: DEGREE Degree of Bus (Number of branches connected to bus) END Internal Designation of a Breaker FAR Remote Bus of END FBNAME Name of the From-Bus LsT First Breaker Incident at BUSNO NEXT Next Breaker Incident at a Bus NODE Node Number 2.21 ‘TBNAME ZRBUP ZPRIM 26 References MJ. Damborg and S.S. Nenkata, Specification of Computer-Aided Design of Trammission Projection Systems, Final Report EL-3337, RP 1764-6, EPRI, January 1984, Jser Guide: RIM 5.0, Boeing Commercial Airplane Co., Seattle, WA, 1982. a Name of the To-Bus Apparent Impedance Seen by Backup for Fault at the Intermediate Bus ‘Apparent Impedance Seen by Backup Relay for Fault at the Remote Bus Apparent Impedance Seen by Primary Relay for Fault at the Remote Bus R:Base Series 5000 User's Manual & Tutorial, Microrim Inc., Redmond, WA., 1985. MJ. Damborg , R. Ramaswami , et al., "Application of Relational Database to Computer- ‘Aided-Engineering of Transmission Protection Systems", IEEE Trans. on Power Systems, Vol. PWRS-1, No. 2, May 1986, pp. 187-93. 2-22 SECTION 3 TOPOLOGICAL ANALYSIS 3.1 Introduction ‘The process of coordinating a. system of directional relays (either overcurrent or distance) involves setting relays one by one so that at each stage the relay being set performs a backup operation which coordinates with all its primary relays, i.e, those relays located in the downstream direction. When this process is carried out on a transmission system with loops, itis apparent that an iterative scheme is required. As explained in [1], the system-wide coordination may necessitate a large number of iterations through all the relays or, at times, may even be impossible to achieve if the relays were considered in an arbitrary order. An approach called topological analysis which yields an efficient sequence for setting relays was developed. The coordination process of a system of directional relays will converge rapidly to the final solution if the relays are set using this sequence. The details of this topological analysis were presented initially using the full matrix methods [1,2] and recently applying sparse techniques [3]. This section describes the topological analysis process and presents the results obtained through this analysis for the test system. The main problem faced by the protection engineer at the start of the coordination process of a system is to determine the starting points for this activity. Due to the loops in the system, these starting points are revisited in the coordination process. Hence, it is very important that the number of such starting points is minimized to ensure the fast convergence of this iterative process. The topological analysis process finds this minimum number of starting point locations called the break point (BP) set. This set spans all the loops in the network, that is, removal of all the relays in the BP set will destroy all the loops. Then an efficient relay sequence called the relative sequence vector (RSV) to set all other relays is obtained. This process ensures that whenever any relay beyond the BP relays is set, all its primary 31 relays have already been set in the previous steps and, hence, the subject relay can be set to coordinate with all its primary relays. Setting relays in this sequence also ensures that each relay is visited only once during an iteration through all the relays. The absence of such a sequence may necessitate visiting each relay many times during each iteration. Finally, since the relay coordination is centered around the primary/backup (P/B) relay pairs concept, this algorithm enumerates the set of sequential pairs (SSP), which is the ordered sequence of all P/B pairs in the system, The order is such that the backup relays appear according to the RSV. It has been verified that significant amounts of memory and computation time are saved by adopting sparsity techniques to this topological analysis when compared to the full matrix methods used earlier [3]. Hence, emphasis is placed only on the sparsity oriented topological analysis process in this section, The major components of this process are summarized in the following subsections. ‘A. data structure based on the LINKNET scheme [4] is used to represent the system topology. LINKNET was developed as a general purpose structure for representing networks in a computer. It uses a linked-list type of data structure, High storage efficiency is achieved by using vectors containing pointers which are used to describe the connectivity of the given network, Three vectors containing links, described below, are sufficient to describe any system configuration, ‘These vectors facilitate various network scanning operations to be performed very efficiently. 1. Bus Links: A vector called ‘LIST is used to store all the bus links. For any given BUS, the element LIST [BUS] points to the first breaker incident at this bus. 2. Breaker Links: A vector called ‘NEXT is used to store the links between breakers incident at a given bus. For any given BREAKER, the element NEXT[BREAKER] Points to the next breaker incident at this bus. When all the breakers incident at this bus are linked by this NEXT vector, NEXT [BREAKER] assumes a zero value. 32 ‘Remote Links: A vector called ‘FAR’ is used to link any breaker with its remote bus. For any given BREAKER, the element FAR [BREAKER] points to the remote bus at the end of the line on which BREAKER is located, The LIST and NEXT vectors facilitate finding the breakers at any bus. The FAR vector aids in systematically travelling from one bus to any other bus in the network. Thus these vectors enable various network scanning operations to be performed very effectively. Another important attribute of the LINKNET structure is the ease with which this data structure can be modified to reflect the addition or removal of lines, AS-bus / 7-line system shown in Figure 3.1 is taken as an example system to illustrate the steps involved in the topological analysis. This is a part of Puget Sound Power and Light (PSPL) Co's 115-kV transmission system and is a sub-system of Test System 2 (TS 2). 3.2.1 System Description To carry out the topological analysis , first, buses and lines in the system are assigned Gesignations. Buses are denoted by integer numbers and lines are assigned letters in our example. Each line is assigned an arbitrary direction. At this initial stage, the three-terminal line junction point is also indicated as a bus which is termed a phantom bus. Also included are phantom relays at this phantom bus. However all these phantom quantities will be removed during the final part of this algorithm to reflect the actual conditions. The modified diagram for the example system is shown in Figure 3.2. Figures 3.3 and 3.4 show the LINKNET data structure for our example system illustrating the bus, breaker and remote links. Tables 3.1 and 3.2 show the BUSLINK and LINELINK relations which describe the system. ‘The program SETUP, whose algorithm is shown in Figure 3.5 (A), creates LINKNET. ‘An algorithm based on the Depth-First Search (DFS) and Back-Tracking (BT) technique [5] is developed for the enumeration of all the loops in the system. ‘These loops are then used to compute the Break-Point (BP) set which contains a minimum number of starting relays. This set is further used in enumerating all the P/B relay pairs in an "optimally" ordered sequence. ‘The Topological Analysis Program (TAP) carries out the topological analysis of the given malti- loop system and arrives at an “optimal” sequence of relays. A flow chart indicating the major steps involved in TAP is shown in Figure 3.5 (B). Midway Asbury OBrien 25| [24 18] [19] [20 Starwood White River Je) , IE), &) BBs) Bl & C+T T+ > sh 2 « AN YM P > + R ¥ ae 25 | 24 22] | 23) | 20 18] [| 19] | 20 Phantom TL S Relays ae Phantom Bus Figure 3.2 Example System with Phantom Bus and Relays 34 Breaker Link Bus Link Figure 3.3 LINKNET Siructure-Bus and Breaker Links Remote Linke | nna Figure 3.4 LINKNET Structure- Remote Links Table 3.1 BUSLINK Relation for Example System 1 8 } 5 2 18 5 3 3 16 6 3 4 5 1 3 5 i 2 2 6 2 4 2 Note: 1. Node is an internal number, starting from 1 to number of buses 2. The node numbers are assigned in the descending order of degree. Table 32. LINELINK Relation for Example System END NEXT FAR BKRNO 1 0 6 26 2 15 4 25, 3 1 1 2B 4 9 4 33 5 3 5 29 6 0 4 30 7 6 i 31 8g 4 5 32 9 i 3 35 10 0 1 23 1 13 2 36 2 14 1 19 B 0 2 37 4 0 1 20 15 0 3 24 16 7 6 22 7 10 2 21 18 12 3 18 Note: 1. Under FAR, node numbers are listed and not BUS numbers. 2. END number has one to one correspondence with BRNO. 36 stsK(euy jeotPojodoy, 205 suNpLORLY ¢'g amnBi unpuodiy dV. (€) (ass) Suva TVLLNaNDaS: 4O Jas ALVWaNNA (asa) ¥OIDIA TONENOaS BALLV TY CNEL a (aa) unpuodty an.tas v) SLNIOd NVI¥a GNI + asvaviva NI AJANYNITAYOLS ‘SNDINHOAL * (L@) ONDIOVAL Ova ‘NV (Sq) HOUVAS: ‘1SMLrHLda WAISAS HOI DNISN S400 MINN Viva “TIV ALVaEWONA AANDNIT ALVES * + ‘aSVaVLVG aSVaVVa WOUd WORE STIVISC XDOTOIOL JANSINIT LAID WALSAS 139, 34 3.3, Algorithm for Loop Enumeration A. prerequisite for determining the BP set is the enumeration of all the loops in the system, It is known from graph theory concepts that the number of fundamental loops in a network of V buses and E lines is given by the number of tree links L where L is given by, L=E-V+1 All the loops of the network are obtained by taking all possible combinations of the fundamental loops. This gives rise to a maximum possible of 2/ - 1 loops. However, it is necessary to exclude from this collection all the multiple loops which are the union of two or more edge-disjoint fundamental loops. Hence in general, the total number of valid loops NL is bounded as follows: 2h >NL>L Our earlier matrix method of loop enumeration was based on determining the fundamental loops first and then explicitly enumerating all the loops by combining the fundamental loops [1,2]. However, this approach results in exponentially growing computational effort as the system gets larger. The present approach using the sparse technique reduces this computational burden by adopting an efficient network scanning algorithm (3]. The loop enumeration is achieved using the LINKNET data structure and a standard search technique. The search technique is a modified form of the depth-first search and back-tracking (DFS/BT) procedure suggested by Tarjan [5]. Also note that since the systems analyzed consist of directional relays at both ends of each line, one need to find loops in both directions. For each physical loop, there are two directional loops, one by traversing the loop in the clockwise direction and the other in the counter-clockwise direction. ‘A detailed flow chart indicating the loop enumeration procedure using DFS/BT is shown in Figure 3.6. The main steps involved in this process are summarized below: 1, Start from a bus and travel deep into the network until one loop is found. 2. Back track to the previous bus and look for other possible loops. 3, If the process is back tracked to the starting bus, eliminate this bus from the system, Consider the next bus and go back to step 1 until all buses are exhausted. Consider first bus as| ‘START bus, many ‘Time (sec.) 1 rating Time (sec. Mean 0.524 Standard Deviation 0.655 3.2 # Pairs Operating Slowly 133 (> 10sec. ) 33 # Pairs Relatively Faster 1223 4 Backup Relays 4.1 # Pairs with No-Operation 18011483 42 — # Pairs Operating > 10sec. 44 29 43 # Pairs Operating < 10sec. 31793512 44 — Operating Time (Sec.) ‘based on 43) lean 1264 1.455 Standard Deviation 2.042 2.280 45 # Pairs Relatively Faster i747 “1756 ‘These results are discussed below: 1 The computer solution aims at minimizing the number of miscoordinations (item 2.2), For the test system, there are no such cases while PSPL engineers experienced difficulties in coordinating 237 cases manually. This is because the overcurrent coordination algorithm is based on both "Enhanced" and "Desired! criteria [1,2], which are stringent. PSPL engineers chose to adopt "Minimum" criteria for those fault situations where manual settings could not ensure even the desired criteria. One of these situations is explained later. ‘The performance indices of the primary relays in Table 4.4 show hardly any difference in the operating time statistics listed under 3.1. The item 3.2 indicates that for 203 fault current pairs, the primary relay operated slowly in the PSPL version, where as the UW solution had only 133 of such cases. The item 3.3 indicates that for a total of 1470 current pairs, PSPL settings resulted in faster operation when compared to UW and for 1223 current pairs UW settings resulted in faster operation than PSPL settings. Many of the cases of faster operation by the manual solution occur because some of the primary relays 418 overreach the respective remote buses. These problems are identified by the computer algorithm. 3. For backup relays, UW settings provide more sensitive operations than PSPL settings (items 4.1 to 4.3). The operating time figures are almost identical. A higher number of fast acting situations (tem 4.5) for UW settings can also be observed from Table 4.4. Figures 4.6, 4.7 and 48 illustrate two specific cases where the program is successful in coordinating fault current pairs. In these figures, the time of operation shown in parantheses is for the UW's computer solution. For the fault conditions shown in Figure 4.6, the manual settings have not provided the coordination between the primary relay #27 and its backup relays #25 and #30 whereas the computer settings have ensured coordination, However, if the minimum criteria of "sequential tripping" is assumed as shown in Figure 4.7, both UW and PSPL settings provide proper coordination. Relay #34 in Figure 4.7 trips instantaneously so that the fault becomes a Jine-end (FLE) fault for the primary relay #27 with its remote breaker open. For this new fault current distribution, both UW and PSPL settings provide proper coordination. The scenario of Figure 48 illustrates a fault beyond the instantaneous reach (FIR) of primary relay #28. The protection engineer considers this type of fault to be critical for coordination. Notice that the UW settings provide coordination for this critical case where as the PSPL settings do not. 1.428 t Y 9 30] 438, [ai 32 _ Midway @ Ls TH vir 439A 88 (0.538) S# 1282.54 24 @ ‘Siarwood @ White River = Figure 4.6 Fault Currents and Relaying Times for Fault Near OBrien Bus 419 v Y 1.378 30] (4378) [31 32 ® Asbury OBrien 33] Baja [as ra ve 00 SA 396A P ® ae 7 @ : o ee White River Figure 4.7 Fault Currents and Relaying Times for Fault near O'Brien with Breaker #34 i ; 29 30] 2338, [ar 32 Midway ® TL Asbury ® L_oBrien =) GE) Bais, 3] BB T#eL 7.1994 Ver S41,687A 5 a a 0 =e (0.768)| 25. 24 Q 7 Ola== qame_— Figure 4.8 Fault Currents and Relaying Times for Fault on Line T 4-20 ‘The execution times for all the test systems for both the mainframe and the PC's are documented in Table 4.5 and Table 4.6 respectively. Table 4.5. Execution Times (S) for OCCORD On IBM 4341 Computer RAM DISK 16 MHZ, Ts1 00:00:54 TS3 00:33:46 Note: The times are in Hours:Minutes:Seconds format and they are wall clock times ( not cpu times ). 4.7 Implementation of Algorithms The FORTRAN program OCCORD sets and coordinates all the overcurrent relays in the system. Figure 4.9 shows the structure of OCCORD. The purpose of the subroutines are as follows: READIN: GRDATA: SETPUP: SETINS: FLCRIR: SETTDS: CooRD: PRDATA: reads in all the parameters/factors needed for coordination gets data from database, selects the pickup tap settings of all relays ‘computes the instantaneous settings of all relays computes additional fault current pairs for faults just beyond the instantaneous reach point of all relays carries out the iterative process of computing the time dial settings of all relays coordinates a given relay pair by considering all relevant fault current pairs stores data back into the database. 4.21 RLYCHA: models the inverse characteristics of overcurrent relays OCCHK: reviews and evaluates the performance of relay settings ‘Main ogc] jreapmy| Jorpata| | ereur || serivs || ricer |] serms cert caveat || ant ccoorp | frroata] [atycxia| founceta| laroaral | anaxt [coors | facvcr| fava Figure 4.9 Structure of OCCORD OCCORD obtains the data corresponding to faults, efficient sequence of relay pairs and ‘models and parameters of the overcurrent relays from the database. Once the final settings are computed, OCCORD stores these settings back in the database. 8 References 1 2 MJ. Damborg and SS. Venkata, Speci = All ign_of ‘Transmission Protection Systems, Final Report EL-3S37, RP 1764-6, EPRI, January 1988, MJ. Damborg, et al,"Computer Aided Transmission Protection System Design, Part I: Algorithms’, IEEE Trans, on_PAS, Vol. PAS-103, January 1984, pp.5-57. R. Ramaswami, MJ. Damborg, et al., "Enhanced Algorithms for Transmission Protective Relay Coordination", IEEE Trans, on Power Delivery, Vol. PWRD-1, Jan. 1986, pp. 280-7. RELAY IBM MVA/TSO VM/CMS User's Manual, EPRI, To be published. RELAY PC User's Manual, EPRI, To be published. 4-22 SECTION 5 DISTANCE RELAY COORDINATION dination of Dis Reli Directional ‘ance relays with three zones of operation are considered. The setting and coordination process of a system of distance relays involves determining the impedance tap settings for all the three zones and the time delays associated with zones 2 and 3. Zone 1 is intended for instantaneous primary protection for any fault on the line where the relay is located. Since this zone does not perform any backup protection, it is not constrained by any other relay in the system, Zone 1 for all the relays in the system can therefore be determined directly. On the other hand, zones 2 and 3 both perform the backup operation. Zone 2 also provides primary protection to a portion of the line on which the relay is located. These zones need to be properly coordinated with a number of primary relays for faults on adjacent lines. The coordination issue is that the second or third zones of any P/B relay pair must never intersect, or else the time delay of the backup relay must exceed that of the primary relay by a coordination time interval TDMC. A typical value for TDMC is 0.3 S. See the determination of the settings for zones 2 and 3 is complicated due to the presence of adjacent lines of greatly different lengths and infeeds in the system, The coordination process is also iterative due to the loops in the system. Similar to the coordination of the overcurrent relays, the SSP is utilized to ensure fast convergence of the distance relay coordination process. Juded setting and coordinating relays on two terminal lines. The previous work [1,2] i However, a complete coordination of all the third zones was not considered at that time. In this section, the following enhancements which ensure the complete coordination of all the three zones of distance relays for both two and three terminal lines are reported: 1, Procedure for setting zone 1 for three terminal lines. Sa 2. A Successive Zone Coordination Algorithm (SZCA) which performs complete coordination of zones 2 and 3 on both two and three-terminal lines. This algorithm also ensures that maximum backup coverage for all the lines be accorded without sacrificing coordination, These two aspects have not been covered by the previous studies [3-5] and the theoretical development reported here is a significant contribution to the distance relays coordination process. 5.2 Relay Modeling Distance relays of the Mho type [2] are modeled in this work. Specifically, models for the circular characteristics of Westinghouse KD relays have been developed. The impedance setting is specified in terms of a set of impedance taps. For example, these taps for the KD-10 relay are termed as S, M and T taps. The S and T taps provide coarse adjustment while the M tap provides the fine adjustment needed to get the desired impedance setting. All these taps have been suitably modeled so that the final impedance of the distance relay can be given in terms of these taps. A similar procedure can be applied to other types of distance relays. 5.3 Zone 1 Setting As described earlier, zone 1 is set to provide instantaneous protection for any fault on the “primary line”, It is set short of the line length to ensure that it does not over-reach the remote bus. Since zone 1 is intended only for the primary protection, there are no coordination issues associated with it, Hence the relays can be considered in any arbitrary order and assigned proper zone 1 settings. It may be noted that for a relay on a two-terminal line, the zone 1 setting is purely based on the ohmic impedance of the line. However, in the case of a relay on a three-terminal line, the setting depends on the fault current profiles on the line segments of the three-terminal line in order to account for the infeed and/or outfeed at the junction of the three-terminal line. Consider the three terminal line ABC in Figure 5.1. The following criteria are to be satisfied while setting zone 1 of relay 11: 1. Zone 1 of relay 11 should cover as much of the three-terminal line ABC as possible. 2, It should not overreach beyond the buses B or C. 52 3. Both infeed and/or outfeed at the junction point J [2] are to be taken into account. Let, Zn(m) = Zone''n' setting of relay 'm' ,n = 1,2 and3 ‘ZA(m,p) = Apparent impedance seen by relay 'm' for fault at'p’ ‘ZMN = Actual impedance of line between buses M and N Zone 1is set to be the minimum of actual or apparent impedances for faults at B or C. Z:(11)=(MDZ1)*MIN [ZAB,ZAC,ZA(11,B),ZA(11,C)] where MDZ1 = Reach Factor (typically 0.9) to prevent overreach. '© Figure 5.1 Example System for Zones 1 and 2 Coordination 54 Successive Zone Coordination Algorithm Zones 2 and 3 are employed to provide backup protection for faults on transmission lines. ‘These zones of a relay should be set so that maximum backup coverage is provided for all the adjacent lines and also to ensure that the subject relay coordinates with all of its primary relays for faults on these adjacent lines. These two objectives are not fully met by the previously existing methodologies [2-5] of coordinating a system of distance relays. A new approach termed the Successive Zone Coordination Algorithm (SZCA) to ensure maximum backup coverage and complete coordination of zones 2 and 3 of all the distance relays is presented here, 53 The Successive Zone Coordination Algorithm (SZCA) has been developed to ensure complete coordination of all the zones of distance relays. In this algorithm, the limiting values for zone 2 setting of any backup relay is computed using the zone 1 settings of all its primary relays. Similarly, the limiting zone 3 setting value of any backup relay is found from the zone 2 settings of all its primary relays. ‘Thus the zones of the distance relays are set successively to ensure proper coordination as well as provide maximum coverage of the lines being protected. A general analysis procedure to compute these limiting impedance values for zones 2 and 3 is described below. SA.1 Zone 2 Setting Zone 2 operation has a time delay associated with it and the impedance value must be selected to complete the primary protection for that portion of the primary line which is not covered by zone 1. Hence this zone must be set to include the remote bus (or buses) under both normal and one-line-out conditions. This zone should also provide backup protection for as much of the adjacent lines as possible subject to a coordinated operation with the relays on these adjacent lines. Consider the general case of two, three-terminal lines in tandem as shown in Figure 5.1. Normally fault studies yield apparent impedances seen by relays for faults only at the buses. ‘These bus fault apparent impedance values in conjunction with already computed zone 1 settings can be used to compute the limiting values for zone 2 settings. Consider setting zone 2 of relay 11 and coordinating it with relay 12. For proper reach coordination, one has to ensure that zone 2 of relay 11 does not overlap that of relay 12, Let F be the zone 1 reach point of relay 12. Then, it must be ensured that zone 2 of relay 11 does not extend beyond point F. The limiting value of zone 2 setting of relay 11 can be determined by computing the apparent impedance seen by relay 11 for a fault at F. It may be recalled that the apparent impedance seen by a relay is equal to the voltage at the relay divided by the current through that relay. ZAQLF) — = (1/Iq) [1g ZAJ + (ig+ls) ZIB + (Iy+1s+1g) ZBG + (ly + Is + 1g + 17) ZGF] So = ZAJ + ZIB (1g+1s)/Iq + ZBG (1g+15+1g)/Ig + ZGF(g +15 +15 + IM (1) Now since F is the reach point of zone 1 of relay 12 and if Z1(12) is the zone 1 setting of relay 12 we get, ZA(12) = ZA(12,F) = [ZBG(I4+15+1g) + ZGF(1y+15+1g+17)] HMg+Is+1) (62) Equations (5.1) and (5.2) yield, ZA(ILF) = ZAJ + ZIB (I4+15)/Ig + Z1(12) (Ig +1g+1g)/Ig (5.3) ‘The following observation may be made from equation (5.3): For a given Z1(12), the zone 1 setting of the primary relay, ZA(11,F) depends only on infeeds Is and Ig and does not depend on infeed Ip. The fault point F can be anywhere on the line BDE. If only apparent impedances are available from the fault study, one can express the current values in equation (5.3) in terms of apparent impedances. This simplification assumes that the ratio of fault currents do not change appreciably with fault locations. It can be seen that, for a fault at bus B, ZA(11,B) = ZAI + ZIB (Ig+1s)/Iq (4) Further, consider a fault at bus G ZA(11,G) = ZA(11,B) + ZBG (Ig+15+1g)/Ig (5.5) Equations (5.3), (5.4) and (5.5) together yield, ZA(ILF) = ZA(11,B) + [Z1(12)/ZBG]ZA(11,G)-ZA(11B)} (5.6) Equation (5.6) expresses the apparent impedance seen by relay 11 for a fault at the zone 1 Teach point of relay 12 (point F) in terms of the various apparent impedances for bus faults (available from a fault study) and the zone 1 setting of the primary relay 12, ZA(11,F) gives the limiting value for zone 2 setting of relay 11. Expressions for other special cases are derived below: 1. Line ABC replaced by a two-terminal line AB Ig = 0; ZA(11,B) = ZAB ZA(LLF) = ZAB + [Z1(12)/ZBG] [ZA(11,G) - ZAB) 2. Line BDE replaced by a two-terminal line BE 1, = 0; Z1(12) = ZBF Equation (5.5) for a fault at bus E can be written as ZA(LLF) = ZA(11B) + [Z1(12)/ZBE][ZA(11,E) - ZA(11,B)] 3. Line ABC replaced by line AB and line BDE replaced by line BE, I5=1,=0 ZA(1L,B) = ZAB; Z1(12) = ZBF ZA(LLF) = ZAB + [ZBF)/ZBE][ZA(11,E) - ZAB] Further, ZA(ILF) = ZAB + [ (ZBF/ZBE) ZBE (Iy + 1g)/Ig] = ZAB + [ZBF (Ig + Ig) /1] ‘This is the normally encountered expression where only two-terminal lines are involved. ‘The limiting value obtained in equation (5.6) is based on normal conditions (no lines out) and for the relay pair 12/11. The minimum of such limiting values for relay 11 can be found in the following manner: 1. Forrelay pair 12/11, find ZA(11,F) with the maximum infeed line at bus B out. 2. Find corresponding values for all other P/B relay pairs where relay 11 is the backup. Let the minimum of these values be Z2m, It is recommended that a factor of safety Z2SF be included to account for errors in line impedance or CT and VT values. A typical value for Z2SF is 0.9. Thus, the maximum allowable zone 2 setting is: Z2max = Z2m* Z2SF 672) 56 The minimum value of zone 2 setting for relay 11 is obtained from the remote bus coverage consideration. It is to be ensured that zone 2 of relay 11 covers remote buses B and C. Hence, its minimum setting required is, Z2min = CBZ2 * MAX[ZAB,ZAC,ZA(11,B),ZA(11,C)] where, CBZ2 = Remote bus coverage factor (typically 1.2). If Z2max is equal to or greater than Z2min, then zone 2 is set at Z2max. If Z2max is less than Z2min, one of the following three ac Ms are to be taken for proper coordination of relay 11 with all its primary relays. 1. Accept a reduced remote bus coverage and set zone 2 at Z2max. 2, Set zone 2 at Z2min and increase the zone 2 time delay of relay 11 one time step higher than for zone 2 of all its primary relays. 3. Choose a pilot scheme for the primary relay. ‘The above mentioned procedure is for setting zone 2 of one backup relay and coordinating this zone with all its primary relays. For a system of distance relays, the backup relays are considered in the order they appear in the SSP. A detailed flow chart indicating the iterative coordination process is given in Figure 5.2. The impedance setting of all the distance relays is completed at the end of one pass through all the relays. One has to go through a second pass only if the time delay of any of the backup relays has been increased from the minimum value TDMN to solve a zone overlap problem (that is, if option 2 mentioned above is selected for any backup relay). In this case, a second pass through the SSP is made and during this pass, only the time delays are suitably adjusted to obtain the coordination. Therefore, for any system, a maximum of two passes through the SSP are needed and hence there is no problem with convergence. Had the relays been considered in an arbitrary order for setting zone 2, many more passes would probbly be needed before coordination is achieved. 542 Zone 3 Setting Zone 3 of a distance relay is intended to provide backup protection for faults on the primary line as well as all the adjacent lines. Since it is usually desirable that all adjacent lines be fully covered in zone 3, this zone is set to reach the farthest second remote bus. However, this Tali TOP forall elas to he minimum vallabl time delay (nero by wer) z aa aig ingen wey chy “fora falt aeons bus. ‘ctor (CBZ2) tod wore ita Z2PRL, ¥ "Assess ZIMPINT, Get fire ow of faa impedance dat Tone Teg “logan” Sisdaabase, Get next jo gaube. sro SINT. + + Taner cteat od ah ory setzimn 28 (Compt Ko ite tga i Teccminaton ae impedates Naapy i Fan roomie (azo ach scones) sna dt tie es peat lpia at ie aytomdanton Miisaezmars) | va Miavenbop sZPRiMt “Ter corinon poem cron refacedeoverge rsd Sine iy or pte or mary. Commens: ‘Objective: Compute reach and time delay for zone 2 oral relays. ‘Reach is stored in Z2PRI of DSRLPARA and time delay is stored in T2P of DSRLPARA ZIMPINT contains the following information: primary relay (PRLY3); backup relay (BRLY3); ZBUP, ZRBUP, ZPRIM ‘ZBUP: Apparent Impedance seen by BRLY3 fora fault at remote bus of PRLY3 ‘ZRBUP: Apparent Impedance seen by BRLY3 for a fault tits remote bus. ‘ZPRIM: Apparent Impedance seen by PRLY3 for a fault at its remote bus. Figure 5.2. Flow chart for zone 2 coordination 58 zone must never operate on a load current. Further, the impedance and the timer settings of zone 3 of a backup relay should be so chosen that it coordinates with zones 3 of all its primary relays. Analytical expressions for the limiting values of zone 3 setting similar to that of zone 2 described in Section 5.4.1 are presented here. Consider the general structure of three, three- terminal lines in tandem as shown in Figure 53. Consider setting zone 3 of relay 11 and coordinating with relay 12, For proper coordination, it is necessary to ensure that zone 3 of relay 11 does not overlap that of relay 12. Let F be the zone 2 reach point of relay 12. Then it must be ensured that zone 3 of relay 11 does not extend beyond F. ‘The limiting value of the zone 3 setting of relay 11 is found by computing the apparent impedance seen by 11 for a fault at F. Figure 5.3 Example System for Zone 3 Coordination ZACILF) = (1/Iq) [1g ZAI + (1g+Is) ZIB + (Ig +15+1g) ZBG + + Is +g + 17) ZGE + (ly + Is + Ig + Ty + Ig) ZEF Is +1g + 17 iy +15 +16 + 7 + Ig) ZAI + ZIB (Ig+s)/Iy + (1/Ig)IZBG (1g+15+1g) + ZGE (Ig + Is +16 +1q) + ZEF (Ig+ls+1g+17+Ig) ] (8) 59 Now since F is the reach point of zone 2 of relay 12 and if Z2(12) is its setting, then, 2212) = ZA(12,F) = [1/g+15+1g)] [ZBG(1y +15 +1g) + ZGE (Ig+15+1g+1) + ZEF (Ig+15+16+17+1g)] (69) ‘Combining equations (5.8) and (5.9) yield, ZAQLF) = ZAJ + ZB [(1g+T5)/I4] + Z212)[(ig + 15 +16)/Ig) (6.10) ‘The following observations can be made from equation (5.10): 1. Fora given Z2(12), the zone 2 setting of the primary relay, ZA(11,F) depends only on infeeds Is and Ig and not on any other infeeds, such as Ty and Ig. 2. Fis a moving point depending on various infeed conditions 3. The result is valid for any location of F on line EKL; infeeds from bus L have no effect 4. Lines BDE and EKL can be either two or three-terminal lines. Since infeeds from buses D and L do not appear explicitly in this equation, one need not be concerned about the type of these lines. 5. The limiting values of zone 3 setting of relay 11 from the zone 2 setting of relay 12 and infeeds in the line ABC can be computed. However, if only apparent impedances are available from the fault study, one can express the current values in equation (5.10) in terms of apparent impedances, Note that equations (5.4) and (5.5) are valid for Figure 5.3 also. Equations (5.4), (5.5) and (5.10) together yield, ‘ZA(LLF) = ZA(11,B) + [Z2(12)/ZBG] [ZA(11,G)-ZA(11,B)]_— (5.11) 5-10 This equation can be simplified in the foll two special cases: 1. Line ABC replaced by a two-terminal line AB Is = 0; ZA(LLB) = ZAB ZA(1LF) = ZAB + [Z2(12)/ZBG] [ ZA(11,G) - ZAB ] Line BDE replaced by a two-terminal line BE y=05 ‘ZA(ILF) = ZA(L,B) + (Z2(12)/ZBE] [ ZA(11E) - ZA(11,B) ] To determine the maximum allowed zone 3 setting for relay 11, the following steps are to be performed: 1. For the relay pair 12/11, find ZA(11,F) with the maximum infeed line at bus B out. 2. Find corresponding values for all other P/B relay pairs where relay 11 is backup. Let the minimum of these values be Z3m. Considering a safety factor MZ3S (typically 0.9), then the maximum allowable zone 3 setting is, Z3max = Z3m * MZ3S (6.12) It is desired to cover all the lines going out of buses B and C in zone 3 of relay 11. Hence the preferred zone 3 setting is the maximum of the apparent impedances seen by 11 for faults at the second remote buses such as E and D. However, to avoid nuisance tripping on load currents, this setting is to be limited to the worst load impedance which is computed as a safety factor MDLD times the sensed minimum load impedance. ‘The minimum load impedance is determined with a knowledge of the maximum load current through the relay and the maximum load angle {2}. Let Z3min be the minimum desired zone 3 setting from these two considerations. If the desired setting is less than the upper limit (Z3max), there is no coordination problem. Zone 3 impedance is then set at the upper limit and the associated timer is set equal to the maximum of the zone 2 time delays of all the primary relays plus TDMN. A coordination problem is detected if the desired value is higher than the upper limit. In this case, choose one of the following three options: Sl 1, Zone 3is set at the upper limit, The reach of the zone is less than desired but there are no zone overlaps and hence no miscoordinations. 2. Zone 3 is set at the desired value thus allowing an overlap of successive zones; but coordination is achieved by increasing the time delay of the backup relay suitably. 3. Zone 3 is set at the desired value without ineres ig its time delay; miscoordination is accepted. Zone 3 of all the distance relays are set following the order suggested by the SSP as when coordinating zone 2. Again, a maximum of only two passes through all the relay pairs are needed to get complete zone 3 coordination, 5.5. Man-Machine Dialog in Distance Relay Coordination Graphics appear in the graphics version of distance relay coordination program (see Appendix-A). As described in Section 5.3, the determination of zone 1 settings for relays on two- terminal lines is a straight forward process. For relays on three-terminal lines, due :o infeed and/or outfeed conditions, the zone 1 reach may not cover the desired portion of the line. A graphics display, as shown in Figure 5.4, will appear when such a situation occurs. The line is 108) # Pairs Relatively Faster o 588 Backup Relays 4# Pairs operating < 10.08 958 965 Operating Time (S) Peres ean 1.696 1457 Standard Deviation 2548 2320 Pairs Relatively Fi ‘When contingencies are also included, there are 5,024 fault current pairs for coordination of the relays. However, the comparison is based on the same 1,376 pairs which result for normal operations, 72 ‘These results demonstrate that setting the relays for existing network conditions on an on- line and real-time basis results in speedier operation of the relays. However, the relay settings need to be computed more often because of possible changes that may occur in the state of the network. Then, a natural question that arises is: Under what circumstances and how often do the relay settings need to be changed ? The answer is: either on an operator's request or on a periodic basis when the relay settings are reviewed with the forecasted network state. The relay settings will be changed at least twice, one for peak conditions and the other for off-peak conditions during a day. In practice, it may be done more often, e.g. once in a few hours. ‘The next question is what if a contingency such as a permanent fault occurs ? Or if theze is 1 localized change in generation or load? The “subsystem coordination” approach for dealing with such changes from planning point-of-view was described in Section 6. In this approach, a "window" is identified around the disturbed region. The relays in this region need to be re coordinated whereas the relays outside the window retain their existing settings. This is an appropriate approach, even on real-time basis, if the entire process can be achieved within a few minutes in an automated mode, The entire process means fault detection and identification, on- line computation of new settings, communication and decision times. However, if the window identified is too large to fit real-time needs then further speeding of the computational process is warranted. In the case of slowly varying network conditions, all the relays in the network need to be re-coordinated, Based on the investigators’ experience, existing techniques cannot handle large networks in real-time, In order to improve existing tools, enhanced algorithms described in Sections 3 and 4 were developed. Also inherent parallelism in the problem is exploited so that multi-processing techniques can be utilized. The details of this latter development are explained later in this section. Adaptive protection can also offer new benefits such as enhancing the reliability of relays. When a relay operates, all of its backup relays will be asked to check whether they have sensed a fault current and if so how long would each of them take to operate. By doing this offline simulation, one can ensure that the relays are operating properly. Perhaps, some of the proposed expert system tools, to be discussed later, may be used for this purpose. Having discussed how an adaptive protection scheme can be of value under various network operating conditions, some of the benefits offered by such a scheme to utilities are summarized. 1. Better transmission line loading due to significantly improved speed of relaying, 2. Improved life expectancy of transmission lines and switchgear because they are exposed to extreme fault conditions for shorter times, 3. Better relays due to their self-checking capabilities and thus increasing system availability and attendant savings in cost, Permissive over-loading of transmission tines by increasing the pickup setting of the overcurrent relays to prevent tripping when service is restored following an outage, 5. Verification of data obtained from multiple sources to detect errors, thus permitting prompt action to be taken, The existing protection schemes are not fully adaptive in nature and the system performance is not optimum (for example, the various components are exposed to a fault condition longer than required, the loading of the transmission lines can not be fully exploited). In the next section, after identifying the various components required to realize the adaptive protection concept, an example is given to illustrate how it works. 13 Description of Adaptive Protection Concept In order to realize the adaptive protection concept the following four main components need to be addressed: 1) Hardware 2) Communication and Control 3) Software, and 4) Human factors, ‘The relationship among these components is conceptualized in Figures 7.1 to 7.3. TF} conrcicener | _—__ Yoo. 100, Sits” || OpentCose Positions ad ¥ "Switching rss2 [eee] T95n Staion voto f Porno fT 4 Power System Figure 7.1. Signal Flow in Power System Operation 15 Central Computer (EMS) Rest of the Power System Figure 7.2 Digital Relays at the Substation 16 Central Computer(s) EMS SOFTWARE. State Estimation AGC Optimal Power Flow Contingency Analysis Console Proposed Protection Software Console ; ; CONTROL, CENTER Operators Incoming Data Control Decisions ‘Figure 7.3 Control Center Environment Wd 13.1 Hardware ‘The term hardware, in the adaptive context, refers to relay hardware and is identified in Appendix-C. Several possible hardware architectures are: i) Assingle computer performing all the relaying functions in a substation, A set of relays that implement a specified protection function such as line protection, or fii) A relay with multiple processors to realize a single protection scheme. One can recall that the first alternative is the one proposed by Rockefeller [2]. However, this will be in sharp contrast with the existing protection schemes in which there is a separate and independent relay for each protective function. Some experts did not prefer this alternative (see discussion offered by Lewis in reference [3}). Its hard for protection engineers to be convinced of this alternative unless itis implemented for a sufficiently long time. In the second alternative, a given protection scheme may have several relays working on different principles. For example, the protection of a single transmission line may consist of overcurrent, distance and travelling-wave based relays. This will be in close conformation with the existing protection practices and may gain acceptance much more easily than the first one, In the third alternative, a given relay may be realized by multiple processors. Several examples of this type are mentioned in Appendix-C. To cite one such example, Girgis and Brown discussed how the distance relay they described could be implemented with multiple microprocessors (see the closure to discussions of reference [4]).. ‘A combination of the above is an attractive proposition. Consider the following. Each protective function will have more than one relay (each of these relays may be implemented by using more than one processor). A station computer oversees the operation of these relays and may provide backup operation in case any relay malfunctions. 13.2 Communication and Control A power system is a clear example of a totally distributed system. The generating units and the loads are usually far apart and the transmission system interconnects them. However, the control is centralized and many control decisions require system-wide knowledge. Each substation has complete information on its current status, but not on any other substation. Data is 18 gathered from major substations and is sent to a central control center for processing and further action. At any given time, only the control center has the up-to-date performance data of the system and the computing power to process it. It is believed that this trend in control centers will continue despite the fact that cheaper and powerful computers may start appearing at each substation. Control and communications issues are inseparable. In order to take control decisions data needs to be communicated, from substations to the control center. On the other hand, the control action is to be communicated to the respective devices. Traditionally, utilities use telephone, microwave and carrier communications schemes between substations and the control center. In future, these will coexist with fiber optic systems, Communication between substations is used for protective relaying purposes. In the future, this communication may be completely based on fiber optic systems, particularly if ground or static wires are present. Communications within a substation will change dramatically in the future. For example, computer based relays acquire information every 1 ms (16 samples in a cycle based on 60 Hz system frequency) which could be used for data acquisition purposes. In other words, the seme data will be compressed and sent to the control center. Further, some protection schemes, such as bus differential protection, need sharing of data among processors. ‘Computer communications is becoming increasingly important. The future developments in utilities will be incorporating the International Standards Organization (ISO) Open Systems Interconnection (OSI) model [5] between the central computer and substation computers. At each substation, a local area network will be commonplace. 133 Software ‘The software issue is addressed in the context of the proposed concept. The software may be a part of the Energy Management System (EMS) software, as shown in Figure 7.3. It has :wo major components: on-line relay coordinations program and protection-related dispatcher aids. On-line relay coordination programs: These should be able to encompass scenarios such as those described in section 7.2. The software should be able to - review existing settings, - _re-compute the settings in case of a contingency or of localized changes in generation or load, - _re-compute the settings to accommodate the slowly varying network conditions, and - check the backup relay operation for improving reliability. ‘The computation should be extremely fast so that it can be done “almost instantaneously" in response to a change in network condition. ‘The principal tool that will be used is the C.A.B. tool RELAY. Later in this section, various issues involved in making this an on-line tool are addressed. Dispatcher aids: The aim of these tools is to help the dispatcher make intelligent operational decisions including those concerning protection. These tools are likely to include an expert system for restoration of service to customers when contingencies occur and an expert system for analyzing the historical data. These tools will help in analyzing the type and location of a fault that has occurred, the action to be taken, whether a similar fault has occurred in recent history so that appropriate remedial action can be taken. The work being done in this area by other researchers is described, ‘Tomsovic and his co-workers [6] described an expert system, developed under EPRI sponsorship. To quote: "Between power circuit breakers at the two ends of transmission line, automatic switches have been installed in utility systems to sectionalize the line in case of a fault. Often the operation of automatic switches is not able to isolate the faulted section exactly In this situation, sytem dispatchers need to apply reasoning and some heuristics to determine a set of actions which will isolate the faulted section precisely. An expert system to aid decision-making in an operating center environment is developed." Talukdar, et al [7], described two knowledge-based programs. The first_ program "Discrete Event Simulator’ knows how protection schemes work. Given the initial configuration of a power network and a disturbance, the simulator predicts the train of events that would be precipitated by the disturbance and the final configuration of the network. The second program "Diagnostician’ is an expert system for trouble analysis. Given the initial and final configurations of a network, it 7-10 hypothesizes the causes of the transition. In a related work, Talukdar and his co-workers [8] described an operator's assistant called TOAST and an environment called COPS (COncurrent Production System). TOAST contains two blackboards and a library of programs such as the ones mentioned in reference [7]. ‘The two expert system aids mentioned above can be used in conjunction with the fourth feature mentioned in subsection 7.3.3. For example, consider the disturbance in the form of removal of a line. The events that actually take place should match with the events that are predicted by the Discrete Event Simulator for the given disturbance. The operator can make sure that this is the case. Similarly, the Diagnostician program can be invoked when the network configuration changes due to a fault. The operator can verify whether the event has happened or ‘not based on the hypothesis predicted by the Diagnostician. 134 Human Factors ‘The issue of human factors is one of the important issues which is not addressed in detail in this report. Besides the man-machine interaction provided by the EMS software, the tools mentioned in section 7.3.3 will be beneficial to the operator. In future, the term operator may also ‘mean a protection engineer in the control room. For example, Horowitz expressed doubts whether the dispatcher was the right person to make decisions about protection (see discussion offered by Horowitz in reference [9]). All these points are mentioned to underscore the importance of an experienced operator to achieve the proposed adaptive protection concept. str In order to better understand the adaptive protection concept, consider the following two examples. 1. The existing relay settings will be periodically reviewed. If there are any miscoordinations, the operator can determine whether a complete recoordination is warranted. If the settings are to be computed, then the programs mentioned earlier will be run and the new settings are transmitted to the relays. 2, Ifa permanent fault occurs on the transmission line connecting substations 1 and 2. as shown in Figure 7.2, the fault should have been identified by relays #1 and #2 within a cycle (16.67 ms on a 60 Hz system frequency basis) after the occurrence of the fault. After the line is removed from service, the first action would be to determine whether service needs to be restored to customers (not shown in the figure) affected by the line removal. For this purpose, the expert system proposed by Tomsovic and his associates can be used. Concurrently, a window can be identified around the disturbance to identify the region affected and if necessary the new relay settings can be computed and sent to the affected relays through the communication system. Next, with the help of the Discrete Event Simulator, the sequence of events, which took place from the moment the line is removed, can be verified, Also, from the initial and final states of the system, the Diagnostician can hypothesize the cause of the disturbance which needs to be verified by the operator. In the following sub-sections, the results of different approaches proposed and investigated with the ultimate aim of developing a fast, on-line tool for computing relay settings for the adaptive protection of transmission systems are presented. Two approaches that significantly improve the execution times of relay coordination studies are discussed. These approaches make the adaptive protection concept begin to appear feasible. A Paralleli In se ions 3 and 4, efficient modifications to existing algorithms, which make the computation of relay settings very fast, are presented. But, even this speed-up is not sufficient for adaptive protection where settings need to be computed "almost instantaneously", Hence, the possibility of exploiting the natural parallelism in solving the problem was investigated. Two kinds of parallelism are discussed in the following. 14,1_Parallelism based on SSPs Three levels of parallelism exist in coordination of relays. At the highest level, there is normally more than one backup relay at any stage of the computation for which settings can next be determined, The second level results because for each of these backup relays, usually there is usually more than one primary relay (for example P1 and P2 as shown in Figure 7.4) and for each of these pairs, the backup relay’s settings can be computed. At the lowest level, each primary/backup relay pair has more than one current pair (typically four or more as indicated by F1, F2, F3, Fé in Figure 7.4) for which computation can be done in parallel. 712 PI F2 3 FT F4 P2 Figure 7.4 Ilustration of Parallelism Based on Set of Sequential Pairs ‘The Set of Sequential Pairs (SSPs), described in section 3, have two interesting properties: 1, Bach relay is set only once, when it appears as a backup relay. 2. Once a relay is set an in 1. above, it can appear as a primary relay for other backup relays. ‘These properties suggest that a simple scheduling of computation can be done in a multi- processor environment. The strategy that can be used is : at i th step, set those relays whose primary relays have already appeared as backup relays in steps 1 to (i-1). Based on this strategy, the schedule obtained for TS 1 is shown in Figure 7.5. Interestingly, the schedule turned out to be the same as Relative Sequence Matrix (RSM) used in the early work [10]. 713 Primary Backup Schedule of Computati Relay Relay Step 15 10 1 14, 6, 12 4 7 2 5,17 a 9 3 11, 13 B 9 4 8,16 5 4,15 7 4 6 10,7,9 9 4 (Break point relays) 10 6 9 6 10 2 7 2 6 5 5 i 4 7 7 B B 8 2 8 iW 16 12 16 8 4 16 15 (a) Primary/Backup relays b) Scheduling of TS 1 Computation Figure 7.5 Computational Schedule for TS 1 42 ited ‘The second kind of parallelism is illustrated using Figure 7.6 in which two systems A and B are connected by a single transmission line. Relay # 1 acts as backup relay for relays in system B and hence, its settings are determined by the relays in system B. However, the settings of relays in system A will be influenced by those of relay # 1. Relay # 2 is also in a similar position. Instead of solving a composite system, formed by combining the above two systems and the transmission line, a distributed computing approach is proposed here in which each system is solved on a separate Processor and the processors communicate to exchange the settings of the boundary relays. The emphasis is on testing whether such a concept works and if so, how to implement it. Two approaches, not necessarily mutually exclusive, are proposed: + Distributed Computing + Supercomputing 14 (b) Relay 2 setting determined by its primary relays in System A (©) Relay 1 settings determined by its Primary relays in System B Figure 7.6 Ilustration of Distributed Computing Approach 718 15 Distributed Computing Approach In this sub-section, distributed computing is investigated with the intent to demonstrate the feasibility of the concept. Further, the necessary modifications to the existing algorithms to realize this approach will also be addressed, Supercomputing is considered in the next sub-section, Consider the test system 4 (TS 4). Figure 7.7 shows the TS 4 system divided into four subsystems, which can be identified with the four operating divisions of PSPL. Figure 7.7 (a) gives the conceptual view of the subsystems and the boundary relays. Note that each boundary relay appears exactly in two subsystems, Figures 7.7 (b)-(e) show each subsystem separately. The characteristics of these are given in Table 7.2. For each subsystem, the database is created. Table 7.2 Characteristics of the Subsystems of TS 4 Test Buses Lines Parallel/3-Terminal # oF System _______Lines___Relays__SSPs_ m. ws 6 1 None/1 15 26 ss 13 B af 47 185 Ne/sc 13, 19 PA 39 115 To demonstrate the distributed computing concept,a shared memory option, available on IBM 4341 mainframe computer through a software package (Pascal Shared Memory) was chosen, which allows multiple virtual processors to share a segment of memory. In this scheme, each processor has its own memory, disk space, console and access to a shared memory. Each processor has limited read/write access and exclusive write access on request. The complete details are covered in reference [11]. ‘The fist test case has four processors sharing the memory as shown in Figure 7.8 (a). The shared memory holds a PASCAL array (of record variant type) data structure consisting of 256 elements as shown in Figure 7.8 (b). The data structure is given below. 7-16 NS Figure 7.7(a) Conceptual View of the Four Subsystems of TS4 TAT Figure 7.7 (b) Description of WS Subsystem 7-18 ‘wawsksqng gg Jo wondussacr (2) 1-1 aun3ig, 7-19 WHITE RIVER @ @ Figure 7.7 (4) Description of NC/SS Subsystem 7-20 warsssqns $n Jo vonduos9q (9) £1 ami 721 Processor 2 Processor ‘Shared Memory Processor 8 #1 Processor #4 (a) Conceptual view of four processors sharing memory 128 192 255 (b) 64-elements of each processor in the shared data structure Figure 7.8 Illustration of Shared Memory Approach 122 array_general array [0 ..255 ] of new_general ; new Felates (stat, comm ) ; new"general = record case new_relates OF stat’ ( status: status-data ) 5 comm : (commun : commun_data ); end; status_data = record proc_id, pass, convergence, numbkr + integer ; eibkr_numbers : array [1 .. max_ei_list ] of integer 5 end; record Tw flag a For each boundary relay, each processor updates the settings in the shared memory only Commun_data p ocripara_rel ; when r_w_flag is 0 and sets it to 1. When these settings are read by the required processor then that processor will set the flag to zero. For each subsystem, the sequential steps involved are: Step la: After reading the list of boundary relays, keep the list in the shared memory. Get the data about all relays’ parameters Step 1b: From the shared memory, read the boundary relays (stored by other processors) and match them with the sub-systems’ own boundary relays, From now onwards, only those processors of interest will communicate, In other words, not every processor talks to every other processor. (For clarification, note that WS is connected to only SS and not to the other two subsystems.) Step 2a: Determine pickup and instantaneous settings of all the relays in each subsystem. Step 2b: For each of the boundary relays, if the corresponding settings determined in both the systems are different, choose the lower of the two. This is consistent with the criteria used for relay settings. Step ‘The time consuming, iterative process of determining time-dials start. Compute the time-dials of each relay. Store the settings of boundary relays in shared memory. Get the settings of the boundary relays from other subsystems. For each of the boundary relays, if the time-dials computed by both the subsystems are not the same, choose the maximum of the two. This will avoid any miscoordination problems. Step 3c: Check the convergence criterion. If the settings of break point relays and boundary relays do not change in this iteration, convergence has been achieved and execution can be stopped. Otherwise, step 3 is repeated. 15.1 Partitioning Earlier, it was mentioned that partitioning is done without any consideration to the size of ‘each subsystem, In fact, network partitioning has been studied by both power engineers and computer scientists [12, 13]. Three considerations go into this decision-making process. 1. The inter-processor communication should be minimized in order to reduce communication overhead. This suggests that the ideal connection between two subsystems isa single transmission line. 2. If three-terminal lines are present, they may not Jink the two given subsystems. 3. For the same network size (ie. the number of buses, the number of lines and the number of relays), the number of pairs in the SSP could be different. For example, compare the sub-systems NC/SC and NS in Table 7.2. This suggest number of pairs in SSP should be the deciding criterion. This may violate criterion 1. Three possible approaches are: 1. As provided by the user, which is adopted here. The problem with this approach is that each subsystem may be of different size, 2. Use of an algorithm such as given by Kernighan [14]. This may not significantly alleviate the problem. The reason is that only the maximum size of each subsystem could be specified but the actual size may vary. 3. Acombination of the above two approaches. Note that the relay settings as well as the execution time taken for a solution is a complex function of number of terms in the SSP, the order of SSP and the fault current data. Any network partitioning approach may at best be an educated guess and may need some experimentation. For a given network, the partitioning may not be done as often as the relay settings, particularly if full system studies are to be done. Table 7.3 compares the execution times obtained by the distributed computing approach with the existing uni-processor (main-frame) approach, Relay settings obtained with the distributed approach will be discussed along with those obtained by the supercomputing approach in section 7.7. Table 7.3 Comparison of Execution Times (S) for TS 4 T WS Subsystem 871 SS Subsystem S741 NC/SC’ Subsystem 36.03 NS Subsystem 48.77 TS4 System __145.0 ‘The following remarks are made about the time taken for the solutions: 1. With 4 processors, the distributed approach requires 57.4 S for completion. 2. The overall speed-up is less than three. As can be seen from Table 7.3, the partitioning (based on divisional basis) is not adequate. 3. A consistent pattern exist between the number of terms in the SSP and the execution time taken, 4. Subsystems NC/SC and NS are of the same size in terms of buses, lines, and the number of relays, but the number of terms in the SSPs are different because of topological differences (see Table 7.2). Another case is tested in which subsystems WS and SC are combined as one. The corresponding results are listed in Table 7.4, ‘Table 7.4 Comparison of Execution Times (S) for TS 4 (Three Processors case) i $5 Subsystem S147 NS Subsystem 4450 TS 4 System Note that the speed-up in this case is closer to 3 thus suggesting that the earlier partitioning is not optimal. 6 Supercomputing Approach Another alternative to achieve better computational times is to utilize faster hardware such as a CRAY type computer. Supercomputing in power engineering is not often attempted and the only work known to us is related to sparse matrices [15] and the load-flow problem [16, 17}. The RELAY software was tested on a CRAY-XMP Supercomputer. The availability of a compatible RIM database simplified the testing. The programs and the data (unloaded from the database) were easily transported. No modifications were needed to compile the programs. The data was loaded into the database using the interactive mode of the database software. Three test systems were studied using the supercomputing approach. The comparison between the execution times ona CRAY-XMP and IBM 4341 computers is presented below. The important conclusion is that the systems about the size of TS 2 can be studied in less than a second of CRAY-XMP CPU time. Note that a speed-up greater than 20 is realized. Further speed-up is possible by optimizing the programs. Table 75 Comparison of Execution Times (S) for Test Systems on TBM 4341 and CRAY XMP-24 Computers rest CRAY — Speed-Up System XMP 447 0.1560 28.65 1 2 1640 0.7765 (21.12 4 145.0 6.2482, 23.21 11 Results In this section, the results related to relay settings for TS 4 by both the distributed and supercomputing approaches are discussed. The time-dial of a relay can be adjusted to a precision of 0.1 only. In general, the solutions obtained by both the approaches are in good agreement and within the tolerance of 0.1. However, the settings of 12 relays are in disagreement and these are listed in Table 7.6. 7-26 Table 7.6 Comparison of Relay Settings 226 2.94 2.94 3.20 228 3:20 2.95 2.94 25 4.24 425 436 227 499 458 4.65 822 5.92 5.68 5.92 3932 5:50 5.82 5.50 882, 297 2.67 297 625, 515 5.44 5.15 307 550 535 535 657 2.02 1.89 139 688 242 229 229 800 __3.65 3,88 BR ‘The following remarks are made about the quality ofthe solutions: 1. Each isa valid solution and each satisfied the coordination criteria, 2. Making use of the “review and performance measurement” feature available for overcurrent relays, the solutions were analyzed. In statistical sense, they are close to each other. See Table 7.7 3. There are minor differences, similar to the ones mentioned in the above table, when the order of fault current data is changed. Table 7.7 Performance of Relay Settings imary Relay Operation) Syren Muli-Pocesor Anpioaeh ‘UniProcessor Approach WS 0.6983 0.7443, 0.6981 0.7443 ss 0.4765 0.5063 oa71s 05074 NC/SC 0.5686 0.6735, 0.5685, 0.6735, 560. 141: 4851. 0.7411 111_Summary It is demonstrated that the distributed computing concept does work for relay coordination. The implementation details are not given because in real life, they depend on the 720 particular computer system used. Consider for example a CRAY-XMP computer with four processors. The same approach demonstrated by the investigators can be implemented without any problem by using the primitives provided on that system. By so doing and by further optimizing the programs the time for computation of relay settings can be reduced to the order of a second of CPU time for TS 4 network, Indeed, such a speed-up can be achieved with the availability of the faster hardware. 18 References 1. A.K. Jampala, iss ion - E Ph, D, Dissertation, University of Washington, Seattle, Wa, 1986. 1a A K, Jampala S, S. Venkata, M, J; Damborg, "Adgotive Transmission Protection - mncepts and Computational Issues", A paper presented at the 1988 IEEE/PES Summer Power Meeting, 8 SM 528-2, (to appear In Power Delivery). 2. G.D. Rockefeller, "Fault Protection with a Digital Computer", IEEE Trans, on PAS, Vol. PAS-88, pp. 438-64, Apr. 1969, 3. A.G. Phadke, T. Hlibka, et al, "A Digital Computer System for EHV Substations: Analysis and Field Tests IEEE ‘rans. on PAS, Vol. PAS-95, pp. 291-301, Jan,/Feb. 1976, 4. A.A. Girgis, R. G. Brown, "Application of Kalman Filtering in Computer Relaying’, IEEE Trans. on PAS, Vol. PAS-100, pp. 3387-97, July 1981. 5. J.D. Day, H. Zimmermann, "The OSI Reference Model’, Proc, of IEEE, Vol. 71, No. 12, December 1983, pp 1334-40. 6. K, Tomsovie, C.C. Liu, et al, "An Expert System as a Dispatcher's Aid for the Isolation of Line Section Faults’, A paper presented at the 1986 TEI ssi istributi Conference and Exposition, Anaheim, CA, Sept. 1986. 7. $.N, Talukdar, et al, "The Operator's Assistant - An Intelligent Expandable Program for Power System ‘Trouble Anais, Bro. of 1985 IEEE PICA Conference, San Francisco, May 1985. 8. S..N, Talukdar, et al, "Toast: The Power System Operator's Assistant’, IEEE Computer Journal, pp 53-60, July 1986, 9. T.E, Dy Liacco, "The Adaptive Reliability Control System’, IEEE Trans, on PAS, Vol. PAS-86, pp. 517-31, Feb. 1967. 10. Mt. Damborg, and SS. _ Venkata, Specification of Computer- Aided Design of hapsmision Prot , Final Report EL-3337, RP 1764-6, EPRI, January 1984. 11. L, Lyon, PSM: A Pascal/VS Interface to R/W Shared Memory, IBM Scientific Center,Palo Alto, CA, 1983. 2 F, Aboytes, A. M, Sasson, "A Power Systems Decomposition Algorithm’, Proc, of IEEE PICA Conference, pp 48°52. 1-28 2B. 4 15. 16. 17. N. Deo Theory with Applications to Engineering an 1 Science, Prentice- Hall, Englewood Cliffs, NJ., 1974, B, Kernighan, "Optimal Sequential Partitions of Graphs", Journal of the ACM, Vol. 18, No. 1, Jan, 1971, ip Ba : B, Dembart, K, W, Neeves, "Sparse Triangular Factorization on Veetor Computers’ in lications of Parallel Pr , EPRI Scat port, EL-S66SR, EPRI, Palo Alto, Oct. 1971, pp. $1-101. Calahan, "Vectorized Solution of Load Flow Problems", Ibid, pp. 113-27. K. A. Wirgau, “Power System Simulation Using Vector Processors’, in B Parallel Pi r » EPRI EL3775, EPRL Palo Alto, CA, Nov, 1984, 129 SECTION 8 FUTURE DIRECTIONS OF ADAPTIVE TRANSMISSION PROTECTION 8.1 Introduction As one scans the adaptive protection literature, many different concepts emerge. The first is that there is no agreement on the definition of the term “adaptive protection’. Some papers [1,2] contain a very broad interpretation of the term, However the term is accorded a narrow interpretation in this work. It is meant as adapting relay performance as a result of changing network conditions, e.g. changes in system load or topology. Another concept that emerges is a number of different levels of complexity due to adaptive protection. In this section , five levels of use of computer relaying are identified. This subdivision of the literature is certainly subjective and open for discussion. However, it is useful to think on ‘expanding on traditional protection concepts. Finally, it is clear that all of adaptive protection has been motivated by the appearance of igital relays and solid state or static relays. A simplistic view is that a digital relay performs tradi mnal relaying operations, but is managed by an electronic rather than a mechanical device. However, as explained later, traditional relaying operations are not a part of some of the more advance concepts of adaptive protection. Levels ymplexity in A Protection Five hierarchical levels of complexity are proposed for this new concept. Level: A primary advantage of digital relays is that the settings are very easy to change. It is an easier, more reliable process to alter relay action by changing data in a memory unit than to alter a setting on a mechanical device. As a result, engineers can consider changing the settings more frequently than is now the case even though field personnel is required. For example, changing 81 relay settings could be a standard feature of major maintenance operations or response to seasonal load changes. Level 2: Digital relay settings can be changed remotely since only transmission of data is required. With a communication link, the engineer can think of changing settings more often, perhaps in response to weekly load changes or standard maintenance changes. Level 3; If all relays in a system can be changed remotely from a single central site, then the time between changes could become much shorter still. In fact, this time is limited only by the time required to calculate new settings. Since computer software exists for coordinating all relays in a system, one can think of arbitrarily frequent changes if the software will operate fast enough. A logical goal in speed would be a few seconds which would be fast enough to respond to even unexpected switching actions with new settings. The concept is elaborated further in section 83. Level 4; The traditional role of relays may not serve the desired goals at this level. Here, the idea is that a substation could have a unified relaying subsystem in which a single substation computer controls all switches, ie. a central decision process for the substation rather than local decisions at cach relay. If each pair of adjacent substation computers communicate they could function comparably to pilot relays. If not, a traditional concept of coordination must be retained where local decisions depend upon stored data which was determined from a "total system’ perspective assuring that individual substation actions will be best for the entire system. Of course, this coordination would not use traditional relay parameters but it would be guided by the traditional concepts that relays should disturb as little of the network as possible while switching as rapidly as possible. Level 5; In the final stage of computer control, one central computer could conceivably manage all switching operations by gathering all relevant data from the system. This concept is fundamentally appealing since central management normally seems desirable in control problems. Of course, the heavy burden on communications is a major concern since a complete communication system is 82 increasingly difficult to sustain as the physical scale of the power system becomes large. In power systems, size approaches the extreme. Leaving these problems aside, having a single computer detect all system faults, and initiate appropriate switching actions in response is an appealing concept. 83 University of Washington Approach to Adaptive Protection ‘The proposed approach starts at level 3 and requires the use of the RELAY code developed as an off-line, planning tool [3-9]. This code has been tested and verified on a variety of actual systems chosen from the Puget Sound Power and Light Company's 115 kV transmission network. This code has met the Puget Power requirements and they now use it in their normal practice. ‘A goal of any protection system is to switch as rapidly as possible in response to faults. Another is to switch selectively to disturb as little of the network as possible. The goals of rapid and selective switching are in conflict, however, when they are based upon a single collection of settings that accommodate a wide variety of network conditions (contingencies). That is, if the relay settings are to respond appropriately for many different cases of fault location, for single- line-out contingencies or for changes in system loading, this appropriate switching is managed at the expense of speed. ‘Then, an appropriate approach to adaptive protection is 10 reduce the number of contingencies that settings are designed for and achieve faster switching. When a contingency occurs calling for new settings, they are rapidly changed before another switching action is needed. The fastest switching action would be achieved when the settings are set for only the existing network conditions (loading and configuration or topology). ‘Two experimental investigations were carried out to test this concept. One determined what gains in switching speed could be realized if relay settings were determined for only existing network conditions rather than for all single line out contingencies. The details were presented in Section 7 and no doubt depend on the network studied. However, not only did the average response time of the primary and backup relays decline significantly, but also the number of relay operations classified as "slow" was greatly reduced. 83 The other experiment was to see how fast a full collection of relay settings could be computed. The coordinated settings were computed for all overcurrent relays in the PSPL system in a few seconds on a CRAY X-MP computer. Since today's CRAY is probably representative of future with reasonably priced hardware, the concept is feasible. ‘A modest investigation of this adaptive protection concept is in order so that its potential as an on-line operational tool is understood better. The following three steps might form the basis for such an investigation in the future. 1. For faults that are actually recorded on a system, determine the response of the system relays as set conventionally and compare it to the response if the relays were set to the existing network conditions only. This study could be done “off-line” using utility data and does not require special relay equipment. A realistic assessment is to evaluate performance improvements that can be achieved for faults that are actually recorded. 2. Refine the coordination code to speed up the computation of settings. Two refinements are desirable: (i) increase the basic computation speed through changes in the algorithms and the database management system and (ii) implement the ability to identify the smallest subsystem of the network whose relays must be reset so the coordination problem remains as small as possible. 3. Develop some simple on-line tests to begin the process of phasing into the operating environment. Alarm data could be acquired from a SCADA computer and fed to a computer which would compute the necessary new settings to test the compatational response in an actual setting. New settings could be transmitted to a few computer controlled relays on a trial basis to further test the concept. 4 Refe 1. S. H. Horowitz, A. G. Phadke, et al, “Adaptive Transmission System Relaying", 87 SM 625- 7, IEEE PES Summer Meeting, San Francisco, July 1987. 2 G. D. Rockefeller, C. L. Wagner, et al, "Adaptive Transmission Relay Concepts for Improved Performance’ 87 SM €323, IEEE PES Summer Meeting, San Francseo, July 3. M. J. Damborg, S. S. Venkata, ‘ification of r-Aic Desig Protection Systems, Final Report EL-3337, RP 1764-6, EPRI, Jan. 1984. M. J. Damborg, R. Ramaswami, et al., "Computer-Aided Transmission Protection System Design, Part I: Algorithms’, IEEE Trans. on PAS, Vol. PAS-103, pp. 51-9, Jan. 1984, R. Ramaswami, S, S. Venkata, et aly “Computer-Aided Transmission Protection System. Design, Part II: Implementation and Results", Ibid , pp. 60-5. R. Ramaswami, M. J. Damborg, et al., "Enhanced Algorithms for Transmission Protective Relay Coordination’, IEEE Trans, on Power Delivery, Vol. PWRD-1, Jan. 1986, pp. 280-7. M. J. Damborg, R. Ramaswami, et al, "Application of Relational Database to Computer- Aided-Engineering of Transmission Protection Systems’, IEEE Trans, on Power Systems, Vol. PWRS-1, No. 2, May 1986, pp. 187-93. S. S. Venkata, A. K. Jampala, et al, "CAE. of Transmission Protection Coordination: Puget Power Experience’, IEBE Trans. on Power Delivery, Vol. PWRD-2, No. 3, July 1987, pp. 691-8. A. K. Jampala S. S. Venkata, M, J. Damborg, "Adaptive Transmission Protection - Concepts and Computational Issues, A paper presented af the 1988 IEEE/PES Summer Power Meeting, 88 SM 528-2, (to appear in IEEE Trans, on Power Delivery). 85 APPENDIX A INTERACTIVE COMPUTER GRAPHICS IN RELAY ‘An interactive graphics software package, GRAPH, is developed for drawing one-line diagrams of any power system. This section describes how a user can develop system diagrams using GRAPH. Since the protection engineer uses only four components - namely, buses, lines, breakers and generators - in the system diagrams only these components can be drawn at this time, As the user continues to draw different components, the graphical data will be stored in the specified database so that other programs such as overcurrent relay coordination program can use this data. Graphics versions of overcurrent and distance relay coordination programs are also briefly described. ‘The above programs require a graphics package called "Graphical Data Display Manager" (GDDM) [1], available on IBM 4341 main-frame computer. This package should have been installed on the user's computer system in order to use the graphics software. A.1 GRAPH. a program for creating One-Line Diagrams Using the GRAPH program, the user draws system diagrams which consists of buses, lines, breakers and generators. This process consists of three basic steps: 1, Selecting the component to be drawn 2 Positioning it 3. Providing the data about the component This process is repeated till the entire system diagram is drawn. Each component's general description is given below. yrawing a B The user has to specify the ori in of the bus by positioning the cursor. ‘The user will be asked to specify the width by moving the cursor. The bus width must be at least eight characters long and can be more. Once the width is specified a rectangle will appear at the chosen location. The user will be asked to enter the bus name (twelve characters long) and the bus number (an integer) in the specified fields. ‘This completes the drawing of the bus. In order to distinguish buses from lines, the former are drawn thick. The thickness of the bus will depend on the user's choice (see Figures 43 and 4.4). Note that buses can ONLY be horizontal at this time. A.L2 Drawing a LINE For representing this component, a thin line is used. Lines are to be connected to the buses at both ends by the user. Besides the starting and terminating points, the line can have up to eight breaks (implying there can be a maximum of nine segments in a given line). If there are more than nine breaks, an error message will be given and the data about that particular line will not be stored in the database, The user has to specify the starting point by positioning the curser at the required location. From then onwards, the user must indicate whether the point inputted is the terminating point or more segments are to be drawn. Appropriate instructions are given by the program and they are self-explanatory. The user will be asked to enter the line name (a maximum of eight characters). It will be helpful if the user first draws the buses even though it is not required. A.13 Drawing a BREAKER Breakers are represented by square, shaded boxes (see Figure 4.4). The radius of the circle that can be inscribed in the box is one unit in world coordinates, the center of the circle coinciding with the center of the cursor. By positioning the cursor at the required place and then pressing a key (either ENTER or PF key) the breaker can be drawn. It is recommended that second cursor position from the bus be selected and the distance between the bus and the breaker will then be sufficient. Then the user has to input the breaker number (an integer). The user will be be asked to enter the remote bus number of the breaker, The purpose of this entry explained below. Again, it will be helpful ifthe line on which the breaker is located is drawn first even though itis not required. ‘The user gives various fault locations (e.g. close in fault) by moving the cursor in response to the program. For breakers on three-terminal lines, the same breaker has to be drawn twice, each time with a different remote bus and different fault locations for FIR, FLE, FRB (refer to A2 page B-24) faults. Note that there will be two locations for FIR, FLE, FRB faults for each breaker on a three-terminal line. Remote bus number is included in this relation to effectively take care of any three-terminal lines in the system. Note that FIP fault location will make sense only for three-terminal lines. For two-terminal lines, the user can specify any location since this will not be used. A.L4 Drawing a GENERATOR A circle of standard radius (twice the cursor width) represents a generator. First, the user must position the cursor to indicate the center coordinates of the generator. When appropriate key is pressed, a circle will appear. ‘Then, following the instructions given by the program, the user must connect this circle to the bus. First the user will be asked to position the cursor on the circle. After doing this the user presses the appropriate key. ‘Then, the user will be asked to position the cursor on the bus. Note that the connecting line can have only one segment. This completes the drawing of the generator. A.LS Additional Remarks ‘When names are entered, UPPERCASE/lowercase distinction will be preserved. So, if the user wants the names entered to be in uppercase, he or she must enter them in uppercase or set the appropriate terminal switch to uppercase. Also, when integer numbers are entered, these numbers should be right justified. Sometimes, the user may want to enter CP mode (CMS mode) from the graphi environment (for example for aborting further execution). This can be done by pressing PA1 key (PA2 key), If the user wants to return to the graphics environment, he should say BEGIN (RETURN). If the execution is aborted, the user cannot return to the original environment. For detailed information, refer to page 466 of GDDM user's guide [1]. Al6 At f the Component ‘When the user creates the one-line diagrams for the first time, he or she can choose the attributes of different components such as colors. Three different kinds of bus representation are possible: a thick bus (double the hardware cursor size), a thin bus (half the hardware cursor size) and a line type of bus. A menu is provided to enter the values. The default attributes are also AS provided. These attributes will be stored in the database. Note that the attributes need to be selected only once, when the database is created for the first time, A.L7 Input to the Graphics Programs When a picture is displayed on the screen, the program expects input from the user so that it can proceed to the next step of execution, The input is given by pressing either the key labelled ENTER or one of the PF keys. The program knows which key is pressed by the user and this information is used in further execution, Hence, the user should press appropriate key as specified by the program. When the choice is left to the user, any key can be pressed. A.18 Cursor(s) ‘Two types of cursors are provided by IBM 3279 terminal hardware. One is underline type of cursor, as shown in parentheses (_) and the other is box type cursor as shown in parentheses ( X). It is recommended that the box type cursor be used while using the graphics programs because whenever the cursor position is queried, its center coordinates are returned by the rogram. So, box type cursor provides a better perspective, ‘The hardware cursor can take discrete positions only (to be more precise, the intersection of a row and a column). So, using hardware cursor the individual components can be drawn at discrete locations only. Four cursor keys are provided to move the hardware cursor. These can ‘move the cursor in up, down, left and right directions. The WINDOWS feature (mentioned in detail later) requires a software generated cursor ‘as opposed to the hardware cursor provided on the 3279 terminal. The software generated cursor ‘can move in small increments also where as the other can take only large increments, ‘The software cursor is in the form of a cross. The color can vary depending on the context. Relative to its current position, it can be moved in any direction by hitting the appropriate PF key. NW. NORTH NE. (F4) (PFS) (PF6) t LEFT <-- ome -> RIGHT (PF?) 8) (PF9) S.W. SOUTH SEL (PFio) = (PFI) (@Fi2) Ad Note that the location of these keys correspond to the direction in which the cursor would move when the appropriate key is pressed. tis important to note the effect of two keys. ENTER key: In order to move the software cursor in larger increments, position the hardware cursor (by using arrow keys) at the required location and press enter key. The software cursor will automatically appear at the new location, PFS key: Is used as a HOME key. When the software cursor is positioned at the required location, this is inputted to the program by pressing the PF8 key. A2 GRAPH installation and execution The following isa list of files related to the GRAPH program: GRAPH FORTRAN - Source code GRAPHLIB FORTRAN - Source code for the graphics library routines CONVERT FORTRAN - Source code for character conversion During installation of this package, GRAPH and GRAPHLIB programs must be compiled using a FORTRAN 66 compiler. Graphics ‘TXTLIB GEN GRAPHLIB GRAPHLIB rary is created by the following CMS command: ‘This will create a file GRAPHLIB TXTLIB on the user's default disk. Character conversion library is created by the following CMS command: ‘TXTLIB GEN CONVLIB CONVERT ‘This will create a file CONVLIB TXTLIB on the user's default disk, Then a load module is created using the GRMBUILD EXEC, which is similar to RMBUILD EXEC. GRMBUILD GRAPH (Create module) GRAPH (Run GRAPH program) A2A Program Execution When the user starts running the GRAPH program, the program asks for the database name. Then, if the user is creating the system diagram for the first time he or she can choose various attributes. After this step, a menu describing the capabilities of GRAPH appears. There AS are three levels in GRAPH execution which always begins at level 1. At each level a menu of selections is provided and the user must make a choice. Depending on the user's irput, the execution may lead to other levels; or further instructions may be provided at the same level. Note that the convention is standardized (implying PF1 will provide help, ete.) and is consistent with the host machine IBM 4341 implementation (implying that PF1 is for help, PF3 for quitting). Level 1: The functions provided at this level are shown in Figure A-1. ib 2) 3. HELP will provide help for this level. The HELP feature is not yet fully implemented, QUIT terminates the execution of GRAPH. ERASE will delete all the data of any particular component. This will be helpful when the user wants to delete all the data of a particular component. ‘The following menu will appear: HELP QUIT BUS LINE BKR GEN ALLDATA As the names imply, appropriate data or all the data can be erased. By pressing PF3, the user can quit this mode. CREATE will first delete all the graphics data in this database and will put the user in INSERT mode (level 2) so that different components can be added. If the user selects this option by mistake (ie. the user does not want to delete all the existing data), he or she can quit this mode by pressing PF3 key. In order to handle large systems, a special feature called WINDOWING is provided. When the database is created for the first time, using CREATE option, the user makes a choice of number of screens (or windows) required. This could be as small as a single screen (for test systems TS1 and TS2) and as large as 25. The choice is made by pressing the appropriate PF key and will be automatically stored in the database. INSERT will lead to level 2. First, the user has to select the window he wants to work in, ‘The following menu will appear: HELP BYR&C QUIT HOME MOVE WINDOW IN ANY DIRECTION ‘Window can be moved in the same way as the software cursor is moved, by PF keys 4 to 12 and ENTER key. It can also be moved by specifying the Row and Column, The layout for rows and columns is as follows. The keys to be pressed are given in parentheses. For AG example, to show left, lower most portion of the system in the window press ENTER key twice. Figure A-l LEVEL 1 of GRAPH Execution Row4 (PF 4) Row3 (PF 3) Row 2 (PF 2) Row1 (PF 1) Row0 (ENTER) Col 0 Colt Col2 Col3. Col 4 (ENTER) (PF 1) (PF2) (PF 3) (PF 4) AT It is suggested to use this option or ENTER key option to move the window for large increments. Once the window is positioned using these, then it can be moved in smaller increments by selecting MOVE WINDOW IN ANY DIRECTION option. Once the window is positioned as required, quit this mode by pressing PF 8 key. Now the user is ready to add any components, Using the level 2 functions different components can be ADDED. Note that no data will be deleted (unlike ERASE and CREATE) when this option is chosen, Modify will lead to level 3. Currently this is not operational. When it is ready, the user will be able to modify any element (e.g, a bus) can be deleted, relocated or modified. H.COPY will prepare a print file which the user must route to a graphics printer after quitting GRAPH. ‘The file will be of type ADMPRINT and the file name is xox. For the print command consult your IBM 4341 system manager. (The investigators used GRAF command.) BROWSE. display the picture from the existing data in the database. The user may want to browse the exis ig system before executing any one of the functions described Level 2: is reached from CREATE or INSERT options of level 1. The different components that can be added at this time, as described in Section A.1.1 are buses, lines, breakers and generators. ‘The menu, as shown in Figure A- will appear. Two more options (WINDOW and A. CUR) which are added later to the software will not appear in the figure. 1 2 HELP will provide help for this level. When WINDOW option is selected, the user can select a new window in the same way as mentioned earlier. QUIT will put the user at level 1. ‘As the names imply, different components can be added by selecting the appropriate option. For the selected component, the program provides instructions which are simple to follow. The user can add these components in any order. If more information is required, refer to Section A.1. AS ee eee aan nS aes Bir Figure A-2 LEVEL 2 of GRAPH Execution ‘When A.CUR option is selected, the software cursor (which is a CROSS at this time) will not appear until the user makes a choice for the component he or she wants to add. Note that the color of the cursor depends on the component which will be added and always appears at the center of the screen. Alternate cursor is moved using ENTER key or PF keys 4 to 12, When itis positioned at the required location, HOME (PF 8) key should be pressed. Hardware cursor is activated by selecting the A.CUR option again. Level 3: is reached from the MODIFY option at level 1. This is not implemented at this stage but, when available, it will have the features shown in Figure A-3. As in level 2, the user will select the type of component to be modified. ‘Then the user must select the element to be changed (of the particular component selected in the previous step) by positioning the cursor as follows: For buses, the cursor should be at lower left hand comer Ag For lines, the cursor should be at either end For breakers, the cursor should be positioned on it For generators, the cursor should be at the center of the circle In addition, the user will be able to select the particular element by specifying either name or number, whichever is applicable, After selection, the element can be deleted or repositioned. Both the picture on the screen and the database will reflect these changes. Any further portions may be added as the need arises. raeens 4 PES Figure A-3 LEVEL 3 of GRAPH Execution ‘An alternative to this option is to modify the graphics data using the interactive mode of RIM. After changing the data, the user can quit RIM and execute GRAPH to see the effect. A3 Output of GRAPH The output of GRAPH program affects five relations in the database in which graphics data is stored. One relation for each component to be drawn is defined, Another relation stores A-10 the attributes of the four components. To store the graphical data in a particular database, the schema for these relations should have been defined prior to usage. For example, GRAPDB database consists of the required five relations only whereas TSIDB and TS2DB databases consist of these five as well as additional relations required for protection coordination studies. ‘The schema can be defined by the following steps: RIM (Enter RIM interactive mode) OPEN TS1DB (We want to define schema for TS1DB. So open it) INPUT STDGBLD (STDGBLD DATA file contains the required RIM commands) EXIT (Schema definition is completed. So exit) ‘The five relations are: ETCETERA (To store attributes) BUSCORD (To store bus coordinates) LINECORD (To store line coordinates) BKRCORD (To store breaker coordinates) GENCORD (To store generator coordinates) Each relation is explained, the schema and the existing data for test system 1 (TSIDB) is given, A3.1 Relation ETCETERA NPARTS # of Screen Size. See Level 1 (Section A.2.1) XWINORG x coordinate of current window display YWINORG y coordinate of current window display BUSCOLOR Color used for buses LINCOLOR Color used for lines BKRCOLOR —_ Color used for breakers GENCOLOR olor used for generators BUSSIZE ‘Type of bus (Section A.1.6) All RELATION : ETCETERA LAST MoD : 86/01/14 READ PASSWORD : NONE SCHEMA : TSIDB MODIFY PASSWORD : NONE NAME, TPE LENGTH key NPARTS INT 1 XWINORG REAL 1 ‘YWINORG REAL 1 BUSCOLOR INT 1 LINCOLOR INT 1 BKRCOLOR INT 1 GENCOLOR INT 1 BUSSIZE INT 1 CURRENT NUMBER OF ROWS = 1 NPARTS XWINORG YWINORG BUSCOLOR LINCOLOR BKRCOLOR GENCOLOR BUSSIZE a0} 0. 3 1 6 4 3 A32 Relation BUSCORD ‘The graphical data about all the buses will be stored in this relation. ‘The information specified by the user when drawing the bus is: Origin (X and Y coordinates of the bus) Width Name Number ‘The schema for this relation is as follows: RELATION : BUSCORD LAST MoD : 86/01/14 READ PASSWORD : NONE SCHEMA : TSIDB MODIFY PASSWORD : NONE NAME TYPE LENGTH Key BUSNAME, TEXT 12 CHARACTERS NUMBER INT 1 YES. XORIGN REAL 1 YoRrGN REAL 1 WIDTH REAL 1 CURRENT NUMBER OF ROWS = 6 BUSNAME OLYMPIA 115 TOXO 115. ELECTRON 115 WHITE R.TL15 SAINT 115 BLUMAER 115. A33 Rs ‘This relation contains the graphical information about all the lines in the database. Note NUMBER XORIGN 3.125 31125 73.125 711875 36.875 36.875 1 2 5 4 3 6 ion LINECORD YORIGN 47.84228 12.23873 12123873 47,8428, 4784228, 12.23873 WIDTH 21 21 23 24992 124992 23. 23 23. that the following information is provided by the user: Line name Complete information about line In addition, the color of the line will also be stored in the database. This will facilitate picture manipulation. If the color of a particular line is changed to BLACK in the database, when that line is drawn on the terminal it will not be seen by the human eye: LINECORD is shown below: RELATION Last MOD : 86/01/14 SCHEMA : TSLDB NAME TveE NAME Text coLoR INT xP REAL LINECORD READ PASSWORD : MODIFY PASSWORD LENGTH 8 CHARACTERS 1 VARIABLE CURRENT NUNBER OF ROWS = conor xT 21.875, 39.375 38.125, 74.375 5.625 94.375 48.125 21.875, 39.375, 391375, 58.125 74.375 47 43 47 43 47 47 47 12 18 12 12 18 84228 39183, 184228 39183 184231 84231 184231 123873 91438 23873 23873 91438 7 21 39 38 7 875 375 1125 :375 5.625, 9% 48. a! 39. 58 % 375 1125 875 375 125 375 Ald 15 3 NONE 1 NONE key ves 39183 184228 139183 184228 23873 123873 123873 91438 123873 91438 123873 ‘The schema for the A34 Relation BERCORD ‘This relation stores the graphical information in the given database about each breaker. The information stored is: Breaker number Remote bus of the breaker Color Center coordinates of the inscribable circle X and Y coordinates of various fault locations ‘The schema for this relation is as follows: RELATION : BKRCORD LAST MOD : 86/01/14 READ PASSWORD : NONE SCHEMA: TS1DB MODIFY PASSWORD : NONE NAME, TYPE LENGTH Key NUMBER Int 1 ves REMBUS Int 1 XCEN REAL 1 YoEN REAL 1 COLOR INT 1 FRBX REAL 1 FRBY REAL a FOI REAL 1 Fery REAL 1 FIRK REAL 1 FIRY REAL, 1 FLEX REAL 1 FLEY REAL 1 BIPK REAL 1 FIPY REAL. 1 CURRENT NUMBER OF ROWS = rT Note: The data is shown on the next page. A35 Relation GENCORD ‘This relation will store the information about all the generators in the database. The information that is stored consists of: Center coordinates of the generators Coordinates of the ends of the connecting line ‘The schema of this relation is as follows: Ald serec'eyszt-ay ewtee'ey e295 ‘16esst s1ses'9t soxte'sy socto'sy snare Als RELATION : GENCORD LAST MOD : 86/01/14 READ PASSWORD : NONE SCHEMA : TS1DB MODIFY PASSWORD : NONE NAME, TRE LENGTH Key XOEN REAL 1 YCEN REAL 1 XOEN REAL 1 YGEN REAL 1 XBUS REAL 1 yBus REAL 1 CURRENT NUMBER OF ROWS — ° iitatic Presently, the help feature is not fully developed. User-friendliness will be further enhanced by providing full help facility. Modify feature has to be fully developed. A4 GOCCORD, graphics Version of OCCORD Overcurrent relay coordination program (OCCORD) has also a graphics version called GOCCORD. This program can be used only if GDDM is installed on the user's computer system. ‘Also, the user must ereate the system diagram using the GRAPH program as explained earlier. As for as relay coordination function is concerned, OCCORD and GOCCORD are identical. GOCCORD has enhanced man-machine interaction, as described in Section 4, because of graphics. Typically, the system diagram will appear whenever it is required. 4.1 Installin, RD The following is a list of files related to the graphics overcurrent relay coordination program, GOCCORD FORTRAN - Source Code RUNGOC EXEC - Routine to define 1/0 files and execute GOCCORD GOCCORD must be compiled using a FORTRAN 66 compiler. The load module is built using the GRMBUILD EXEC. GRMBUILD GOCCORD (Create Module) RUNGOC (Run GOCCORD) AS_GDSCORD, graphics Version of DSCORD Al6 Distance relay coordination program (DSCORD) has also a graphics version called GDSCORD. This program can be used only if GDDM is installed on the user's computer system, Also, the user must create the system diagram using the GRAPH program as explained earlier. ‘As for as relay coordination function is concerned, DSCORD and GDSCORD are identical. GDSCORD has enhanced man-machine interaction, as described in Section 5, because of graphics. Typi AS.L Installing GDSCORD ly, the system diagram will appear whenever it is required. ‘The following is a list of files related to the graphics distance relay coordination program. GDSCORD FORTRAN - Source Code RUNGDS EXEC = Routine to define 1/0 files and execute GDSCORD GDSCORD must be compiled using a FORTRAN 66 compiler. The load module is built using the GRMBUILD EXEC. GRMBUILD GDSCORD (Create Module) RUNGDS (Run GDSCORD) A6 Graphics Some important aspects of graphics are briefly touched upon here. Interested users may refer to books on graphics such as GDDM user's guide [1]. Viewports and windows: The being used whereas the window is associated with the logical size. ‘This distinction is somewhat analogous to referring a disk file (physical hardware) as unit 5 (logical unit) in a FORTRAN -wport is associated with the physical size of the terminal program. Each viewport is associated with a window just as we associate a file with unit 5 in the program. ‘The available picture space can be divided into as many required viewports as necessary and each viewport is associated with a window. Each window can be thought of as having an imaginary scale, usually referred to as world coordinates. In this way, the programmer can think in terms of logical quantities rather than becoming involved with physical dimensions. If the physical device is replaced, only viewport and window statements may have to be changed, thus not affecting other portions of the software. AAT In the GRAPH program, a rectangular viewport which occupies the total picture space is defined. A rectangular window is associated with the viewport so as to maintain one-to-one correspondence with it. If this correspondence is not maintained, the picture will be distorted and a circle may appear as an ellipse (sometimes it is intentionally done!) The world coordinates on X-axis are 100 units and on Y-axis they are proportional to the height of the window. All the data stored in the database is in terms of these default dimensions. Alpha-numeric fields: are positioned by rows and columns, the rows starting from the top. ‘The IBM 3279 terminal has 32 rows and 80 columns, Whether a particular field is input inhibited (protected) or not depends on its definition in the program. In the GRAPH program, only those fields where user is expected to enter data are unprotected. All others are protected, implying that the user cannot alter these fields. Output Options: The most important manipulations are briefly mentioned below: ‘The size of the picture can be changed without loosing any information. By selecting a small viewport (and obviously an appropriate window and world coordinate system) the picture ‘can be shrunk. Three different kinds of buses can be drawn by changing the bus hieght. Recall that the bus height is not a parameter in the stored data. The picture can be moved in any direction within the window. (This is known as, translation.) Data manipulation using RIM: Often, one may like to draw only the required components, such as a particular breaker pair. This is achieved by SELECTing the required components using RIM where clause ( refer to Section 2), Further, one has to distinguish from among the different remote buses of the three-terminal lines. RIM where clause is used here also. AT Reference 1. -Gaphical Data Display Manager (GDDM) User's Guide, Program Number 5748-XXH, IBM, 1983. Al8 APPENDIX B FAULT STUDY INTERFACE, A fault analysis program developed at Puget Sound Power & Light Co. (PSPL) has been adopted to obtain the fault data needed for the protection studies. An interface program called TRAN has been developed to automatically run the fault analysis code and load the fault data into appropriate relations in the data base. The following sections describe both the fault anzlysis, and the interface programs. B.1 Fault Study ‘The fault study software uses the Z-bus matrix method in calculating the three phase faults, and single-phase-to-ground faults. The positive- and negative-sequence networks are assumed to be identical. Therefore, only the positive- and zero-sequence matrices are formed and used for calculating the fault quantities. The zero-sequence mutual couplings between lines are also incorporated in the zero-sequence matrix. The output provides a detailed listing of the specified bus faults including line-out and line-end conditions. ‘This fault study software was redeveloped by PSPL in 1972 and was used by them until 1982, The majority of the code was written in Fortran and can be complied with language level 66, The code also includes some assembler subroutine. PSPL is now providing the software for use by the utilities interested in the capabilities of the RELAY. The users should be aware that the correctness of this fault study program is not guaranteed and that the results should be scrutinized before making a decision or judgments based on its output. Input Data ‘The power system components, generators, transformers and lines are represented by their equivalent sequence networks. Each branch of the network is entered on one data line showing its from-bus, to-bus, positive-sequence impedance, zero-sequence impedance, and branch or circuit number. Buses can be represented by bus names of up to twelve alphanumeric characters Bi in columns 1-12 and 13-24, The circuit number can be any integer number from zero to 15 right justified in columns 50-51. Positive- and zero-sequence impedance (per-unit) values occupy seven columns each (columns 32-38 and 39-45, respectively) with decimal points positioned where applicable. ‘The data fields are: Column 1-12 13-24 3238 39-45 50-51 Transformer Data Description From-bus, 1-12 alphanumeric characters To-bus, 1-12 alphanumeric characters Positive-sequence data (blank or large value) Zero-sequence data (blank or large value) Circuit number, right justified Although the positive and zero sequence circuits are not identical for most transformers, the equivalent circuits should be considered to have the same number of nonradial nodes; but the values of branch impedances can be different for both sequences. For example, the three-winding transformers can be represented by their equivalent circuits as follows: ‘The data for this transformer will be represented by the following four lines BUS-H BUS-M REFERENCE BUS-L BUS-X ZHI 99999, BUS-X ZM1 ZMO BUS-X 99999. ZLO BUS-X ZLI 99999, B2 Y BX ‘Transformer zm 20 zM0 H Moouke IM Zu Zo Reference L ti Equivalent Sequence Diagram BUSH | BUSX BUSM es zHO hose emeuccson BUSH 22 pus wu 0 ey th BUS L. Reference Louse ‘Sequence Branches For Data Generator Data A generator data is entered as one branch and is distinguished form other branch data by its from-bus name "REFERENCE". ‘The data line fields are: Column Description 19 REFERENCE, or can be left blank 13-24 Bus name of the generator bus (e.g. COULEE 13.8) 3238 Generator positive-sequence reactance (usually subtransient reactance) 39-45 Generator zero-sequence data or can be left blank if generator is ungrounded 5051 Circuit number or generator number B3 ‘Open circuits are represented by large enough impedance values (99999. ohms per unit) to prevent flows in the open branches. A large value of impedance can be entered as desires however, if the impedance field is left blank, a value of 99999 is assumed by the program, An impedance value of zero cannot be assigned to any line although negative values are acceptable, Mutual Data Preparation ‘Mutual data is to be prepared for couplings of the zero-sequence network. Mutual couplings are identified by their branches and corresponding circuit numbers and are entered on data lines, as follows: Column Description 112 Bus name of from-bus for circuit A 13-24 Bus name of to-bus for circuit A 27-28 Circuit number for circuit A 30-41 Bus name of from-bus for circuit B 42.53 Bus name of to-bus for circuit B 5657 Circuit number for circuit B 58-64 ‘Mutual coupling impedance in per unit When two or more lines share one right of way, mutual couplings between these lines should be entered. Furthermore, these lines may also enter and share other rights of way with ‘more lines in the system network. ‘The mutual couplings between related lines that share a number of rights-of-way form a cluster. For example, if line A is mutually coupled to line B and line B enters another right-of-way and is mutually coupled with line C, then lines A, B, and C are in one cluster, ‘The increased size of cluster hinders the speed and efficiency of computations made to arrive at the answer. The maximum cluster size allowable by the program is forty lines, although it is not recommended to have clusters of that size or, for that matter, clusters exceeding ten lines. One can reduce the size of a cluster by providing a fictitious bus to divide a line, and thus break a cluster into two subclusters. This can be repeated for each sub-cluster until an optimum of approximately ten lines per cluster is obtained. This is demonstrated in the following two diagrams: B4 BS Cluster A ClusterB Bo ‘This system network consists of 9 buses, 16 lines, and 24 mutual couplings. The lines are mutually coupled in a way that 15 of the lines form a cluster. The same system network is shown above with a fictitious bus (BUS10) inserted to divide line Busl - Bus3 which breaks the 15 line R.O.W. cluster into two subclusters with lines as follows: LINE CLUSTER A LINE CLUSTER B Bus 1 - Bus 10 Bus 10-Bus 3 Bus 1-Bus3 Bus 1 - Bus 6 Bus 1 - Bus 2 Bus 1 - Bus 9 Bus 2- Bus 4 Bus 1 - Bus 8 Bus 2- Bus 5-1 Bus 9- Bus 6 Bus 2 - Bus 5-2 Bus 9- Bus 8 Bus 4- Bus 5 Bus 7- Bus 8 Bus 6 - Bus 7-1 Bus 6 - Bus 7-2 After the clustering consideration, the data for mutual couplings should be made up with particular attention given to the sign of the mutuals. For example, the following shows three buses and three lines of a partial network or cluster: Busi BUS3 er PL sus2 ‘The mutual data can be prepared with the position of buses chosen arbitrarily, but the sign of the ‘mutual coupling will depend upon the bus arrangement, €.g.: BT LINEA LINEB COUPLING BUS1-BUS3 BUSI - BUS2 +MB BUS1-BUS2 — BUS2- BUS3 M2 BUS1-BUS3 —_BUS3- BUS2 ML ‘To enter all mutuals as positive values, one has to enter these buses in a directional way as: BUSI-BUS3 BUSI - BUS2 +M3 BUS1-BUS2 — BUS3- BUS2 +M2. BUSI-BUS3 —_ BUS2- BUS3 +M1 PROGRAM CONTROL COMMANDS ‘There are several control commands that are recognized by the program. These ‘commands enable the engineer to put the data input, specifications, and output options together in proper order. These commands should be entered starting with the first column. For example, the line data input control command is given with "LINE DATA" immediately preceding the data control command *END immediately following the data. CONTROL COMMANDS *Miscellaneou: ‘This command reads the input constants for the program and is followed by constants with fields as follows: Column Example Name Description 1-10 502.04 BMVA Base AMPS for three phase faults (502.04 at 115-kV for 100-MVA base) 11:20 502.04 = BMVB Base AMPS for single phase faults 21-30 L SCALE This constant is multiplied by phase currents - can be used to convert phase BS currents to MVA 31-40 ‘ CONST —_ Input data X1, X0 & MO are divided by this constant ~ can be used to change from per unit to percent Decimal points should be entered for all constants. 2, ‘Line Dats ‘This command reads the line data which should immediately follow. 3_End ‘This command indicates the end of input data, mutual data, etc. 4. ‘Mutual Data ‘Line mutual data are read immediately following this command, S Title One Tine with page title information (Columns 1-72) follows this command. This information is printed on the heading pages. 6, *Selected Buses This control command reads the list of buses to be faulted. Specified buses should be listed one bus per line (columns 1-12) and the number of buses back in column SO, ENDOFJOB In order to have a clean termination of the program, the following commands are required: v *END “END v “END "*/" marks the end of a system study and *END provides exit from main program, Subsequent *END, */, and *END are required for Job Termination. The example of Figure. B.1 shows the Bo order in which data and control commands are submitted in a typical job and an annotated output. @ © D. a BAKERU 13, BAKER-U 115 BAKERL 13, BAKERL 115 BAKER 57 BAKER 115 SEDRO 57 y SEDRO 115, D Example System One-Line Diagram Figure B.1 Input Data and Output Details of Fault Study for a Sample System B-10 SYSTEM DATA FOR THE FAULT STUDY BUMELE BaEEL 13 6.53960 mam-y 23 0.s9280 smn ~0008 2 muan-L iispaaR 135 0,000820.00087 sismaae-u 325 0,040470.17018, smrrun, Data sen LISMAGR 151 SEDO LUSMAKER 115.20, 25800 sumo UiSBAER 115 1 SEIRDSTMAKER 57-0. 12000 02.06 502.08 anor 15 " ” Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) Bll ‘BXELANATIONS OF EACH OUTEOT. ene ° ° ° ° SUSTDA DATA FOR TEE FAULT STUDY HAAMPLE are me: [SYSTEA DATA POR THE FAULT STUDY EUWELE [ANQAISSTON LINE DATA TERED cms ma us Kae RESISTANCE REACTANCE GE})—-REACTANCE (KO) CIRCUIT ran 0) Gon (aR oT em usr) ©. REVERENCE = MEER 13000000 o.sa063 0000 ° MEVERENCE —-«-RAKER-L. 115 0,00000 90980-00000 0.19790 ° merece == AER-U 12000000, ovss2se —_eo00e.00000, 1 REFEREE «MAKER 13———0.00000 ovsszso —_99999,00000, 2 REFERENCE —«-BOXER-U 115 0.00000 09000,00000, 0.10580 ° weremnsce «SER. _~—=«0.00000—92888.00000 34242 2 mame 57 MER 150.0000, o.s4oas —_$0909,00000, ° mR 113 SER. 150.0000, o.32aa1 46028 2 mame) 13 MARER- 115 0.00000, o.30s60 $9909. 00000, ° mua 57 SEED. 570.0000, 0.67245 2.07328 Q smo 2k SER. '57-—=—0,00000 |=. 0008 00000 ° smo 2k © SEDRD. 150.0000, 0.37801 0.17802 0 smo 2K © SER. «13,——0,0000, 0.1422 90000. 00000, ° Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) Biz + TU FOLLOWING TS THE LIST OF MUTUAL AD OTHER DATA ENTERED + MOTUAL LIME DATA sxreR=D is mee mS MAME CIRCUTE BUS KAS BUG KAME—CIRCUIT MUTUAL COUPLING cron os 0. cru 0) . wrt) sion 115 BARS smo oS MaRS 2 0.2500 seuporep wun ° ° ° o aeR-u 135 0 BUSES BACK Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) BB rr) Fotos wor 0.32800 0.00000 2.07326 THOME (H7Q) FOLLOWS WIT 3.25012 me) PoRLS HIT nis ais1 0.30768 2 anc) POLL Lamang) roLios REFERENCE -BAKER-D 115-0 Baek S7RMGR TS 0 ugk risseom is 2 moar S7sER 7-0 soko HSER MIS 0 REVERENCE MAKER-L 315-0 Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) Bad wa ea 0.34242 o.s3ase 9900, 00000 2000, 0000 95099, 00000 0.00207 30S Tomax MASE FAULT ( 1" AMES IF SPECTETED ) __ xo sequmce menione woLTace ! 1 | I 2X zo 509, CORT CORTIBUTION To, NASE-TO-cRomD AUS TANT I i I 1 1 1 I | _v0 6 covmunurin nos omen + | ro i I Ne I 1 ro rows | moras | hot OMTRIBUTION OF TOE FREH-WUS 10 TOE THREE PASE FAULT rot 1 \ boro hot \ \ oro ot 1 i 11 reat areeDnCE oF aun ra aR wT mS rot \ \ boron boy ov ov vy ow wy I vm mat tka WO smc domo uss Soon 08 aa 0 RErmusice «108.1 924.2.0.000 0.0 taennann mmmct OMERL us -us2 ins.) =u -2.8 ‘awe mes vomit mance wt Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) BAS PaULEED AT THAT FOUR, Hl N. N v ’ va \ maak ans ' my 1 1 |Lopns xo oF Lom MM wes aur eum a 1 eu 1 a igen 1 | ume 1 Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) B16 n, ; ve 1 comm 97 0. 0, os D BAGR-L 135 1055. 1288, 717,0.001 452,388,480. 0.346 Foss PECK: 1A 310. SHH O/U EMD-IA F-STO E-SER ORY o awa. 115, n47.0.003 2, o RErmenct |= «57. 172, o.teae 14s, 0, sees mask us 1A 310 32H O/U ROTA F-3T0 E-SPR OMY 2 SHR 115 65. 196. 0.0.120 65. 195.0, satan Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) BAT osu 570.6. 8..541 8, ttt RERERENCE OME L150. 0 sO, -0. =o, seen REFERENCE 0 BAKER-U 125-254. 762, -o.seene 289, -758, ‘OFEY LIME 70, APH aH aziez0 wo EIA Lsmg MS 55. ash. o.oo © BACER-L 135 1009, 1246. 727.0.001 0. 0 REFERENCE = 2450, 301. O.eDME-.ISL 0. A 310 smH of asm 1s 1. a. 00.120 fo awaR-v 135 1277. 737. 1194,0.048 REFERENCE OBMER-U 15-290, -717. -0.6 Pamtes ous Pd OPH aaez0 Wo eee enone nennennnnennnd BERT NS 2632, 2000, 0.572300 ~.132 rows Fi; At) 0 BMGR-U 13 1172.2 0.0-.044 1350.0 0.20360 o mEVmENCE 625.6 1676.9 0.000 0.0 wvesssae aR 115 0 REFERENCE 43.0 129,0 0.000 6.0 sesannnn (OPEN LINE To: MF] SR 221420 Yo E-IMH SEH EWDZZI4ZO E¥O-¥0 ener © BMER-U 19957, 670, 2,5731-0.008 0, 588. wrevewe 2,000 Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) B18 FLO FROM: TA 310. SPH Oy END-IA 1A 310 sm o/U EWO-IA Esto E-spe omy © REFERENCE 1983, 2020, 0,7595-0.468 0,0 REPEUICE 2 BAKERY 19-442, 0, 075.0704 -0, 0. Fos: TAM Figure B.1 Input Data and Output Details of Fault Study for a Sample System (Continued) BA9 37 0/0 BID-IA sta E-aPH Om om 57 120, 0,0, 340, 0.672 i Remnce 5.188 oo tenne murmncr 1 SND =O. 0,

You might also like