Protection Of Power System By Optimal Co-ordination of Directional Overcurrent Relays Using Genetic Algorithm

Similar documents
Application of GA for Optimal Location of FACTS Devices for Steady State Voltage Stability Enhancement of Power System

A Hybrid Tabu Search Method for Assembly Line Balancing

ISSN: ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013

International Journal of Software and Web Sciences (IJSWS)

STUDY ON APPLICATION OF GENETIC ALGORITHM IN CONSTRUCTION RESOURCE LEVELLING

Alpha Cut based Novel Selection for Genetic Algorithm

Holland s GA Schema Theorem

A Fast Computational Genetic Algorithm for Economic Load Dispatch

Introduction To Genetic Algorithms

A Robust Method for Solving Transcendental Equations

Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects

ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM

SOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD

Effect of Remote Back-Up Protection System Failure on the Optimum Routine Test Time Interval of Power System Protection

Effect of Remote Back-Up Protection System Failure on the Optimum Routine Test Time Interval of Power System Protection

International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering

Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments

OVERCURRENT & EARTH FAULT RELAYS. To study the protection of equipment and system by relays in conjunction with switchgear.

Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization

Numerical Research on Distributed Genetic Algorithm with Redundant

Optimal Tuning of PID Controller Using Meta Heuristic Approach

A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0

INTRODUCTION TO SYSTEM PROTECTION. Hands-On Relay School 2012

Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

Web based Multi Product Inventory Optimization using Genetic Algorithm

Transmission Protection Overview

Parametric variation analysis of CUK converter for constant voltage applications

Simulating the Multiple Time-Period Arrival in Yield Management

CIRCUIT BREAKER INTERRUPTING CAPACITY AND SHORT-TIME CURRENT RATINGS

Electric Distribution Network Multi objective Design Using Problem Specific Genetic Algorithm

Genetic Algorithm Performance with Different Selection Strategies in Solving TSP

Phase Balancing of Distribution Systems Using a Heuristic Search Approach

Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

Interpretation of Remote Backup Protection Operation for Fault Section Estimation by a Fuzzy Expert System

CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT

Original Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes

GA as a Data Optimization Tool for Predictive Analytics

Genetic Algorithms for Multi-Objective Optimization in Dynamic Systems

OPTIMAL DISTRIBUTION PLANNING INCREASING CAPACITY AND IMPROVING EFFICIENCY AND RELIABILITY WITH MINIMAL-COST ROBUST INVESTMENT

Integer Programming: Algorithms - 3

Genetic Algorithm Based Interconnection Network Topology Optimization Analysis

New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem

LOAD BALANCING IN CLOUD COMPUTING

CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING

Application of Genetic Algorithm to Scheduling of Tour Guides for Tourism and Leisure Industry

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

PROCESS OF LOAD BALANCING IN CLOUD COMPUTING USING GENETIC ALGORITHM

An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM

IAV. Time Delay Voltage. For AC and DC circuit applications. GE Multilin 1. Protection and Control. Features and Benefits.

Background knowledge-enrichment for bottom clauses improving.

Optimal PID Controller Design for AVR System

A New Quantitative Behavioral Model for Financial Prediction

An ACO Approach to Solve a Variant of TSP

A Review And Evaluations Of Shortest Path Algorithms

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration

OPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)

Grid Interconnection of Renewable Energy Sources Using Modified One-Cycle Control Technique

Evolutionary SAT Solver (ESS)

A Non-Linear Schema Theorem for Genetic Algorithms

Nonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms

Sensors & Transducers 2015 by IFSA Publishing, S. L.

Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling

A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems

Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation

GUI Based Optimal Drumming Algorithm for Optical Ground Wire (OPGW) Cables

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3. Symmetrical Components & Faults Calculations

A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines

An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system

MLD Model of Boiler-Turbine System Based on PWA Linearization Approach

Non-Uniform Mapping in Binary-Coded Genetic Algorithms

Spare Parts Inventory Model for Auto Mobile Sector Using Genetic Algorithm

Journal of Optimization in Industrial Engineering 13 (2013) 49-54

Inventory Optimization in Efficient Supply Chain Management

A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)

BMOA: Binary Magnetic Optimization Algorithm

Part 1 System Modeling & Studies for Existing Systems

Study on Differential Protection of Transmission Line Using Wireless Communication

ZONE SELECTIVE INTERLOCKING (ZSI) APPLICATION AND TESTING GUIDE SIEMENS WL UL489 AND UL1066 AIR CIRCUIT BREAKERS

A Strategic Capacity Planning Model: A Genetic Algorithm Approach

Hybrid Power System with A Two-Input Power Converter

Generator Stator Protection, under/over voltage, under /over frequency and unbalanced loading. Ramandeep Kaur Aujla S.NO

A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM

OPTIMIZED SENSOR NODES BY FAULT NODE RECOVERY ALGORITHM

6545(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJEET)

Network Reconfiguration for Service Restoration in Shipboard Power Distribution Systems

TA Kahraman Yumak ELK412 - Distribution of Electrical Energy Lab. Notes v Spring web.itu.edu.tr/yumakk. Distance Protection

High Intensify Interleaved Converter for Renewable Energy Resources

Keywords: Information Retrieval, Vector Space Model, Database, Similarity Measure, Genetic Algorithm.

GENERATOR DIFFERENTIAL PROTECTION RELAY STABILITY VIS-A -VIS SELECTION OF CTS MR. H. C. MEHTA & MR. JAY MEHTA Power Linker Group Co.

Optimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time

Software Project Planning and Resource Allocation Using Ant Colony Optimization with Uncertainty Handling

Transcription:

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 Protection Of Power System By Optimal Co-ordination of Directional Overcurrent s Using Genetic Algorithm Dharmendra Kumar Singh *, Dr. S. Gupta ** *(M.Tech, Student, Department Of Electrical Engineering, NIT Raipur, India) ** (Department Of Electrical Engineering, NIT Raipur, India) ABSTRACT In this paper, the optimization of coordination of directional overcurrent relays in an interconnected power system is presented. The objective of protective relay coordination is to achieve selectivity without sacrificing sensitivity and quick fault clearance time. A methodology is adopted for the consideration of backup relays in the optimal coordination of directional overcurrent relays. The calculation of the Time Dial Setting (TDS) and the pickup current (Ip) setting of the relays is the core of the coordination study. The objective function to be minimized is defined as the sum of the time dial settings of all the relays. The inequality constraints guarantee the coordination margin for each primary/backup relay pair having a fault very close to the primary relay. Using this formulation, the size of the optimization problem is significantly reduced. Genetic Algorithm is the algorithm being applied to minimize the operating times of the relays. Both Linear and Non Linear Equations are framed for the test bus system used and optimized using the Genetic Algorithm in this paper. Keywords - Directional Overcurrent, Genetic Algorithm, Pickup Current, Time Dial Setting, Operating Time of s. 1. INTRODUCTION I N an interconnected power system, abnormal conditions (faults, overload, overvoltage, etc.) can frequently occur. Due to this, interruption of the supply and damage of equipments connected to the power system may occur. During these situations, the faulted components must be readily identified and isolated in order to guarantee the energy supply to the largest number of consumers possible and to maintain the system stability. Therefore a reliable protective system is required. To ensure reliability, a backup protective system should exist in-case the main protective system fails (relay fault or breaker fault). This backup protection should act as a backup either in the same station or in the neighboring lines with time delay according to the selectivity requirement. Directional over current relay(doc) are commonly used for power system protection. Optimization method are used for coordination of these relays. In these methods, at first, the coordination constraints for each main and backup relay are determined [1]- [2]. The other optimization methods that have been used for the above problems are simplex method [3] two phase simplex method [4] and dual simplex [5]. 1.1 Problems Associated With Above Techniques A protective relay should trip for a fault in its zone and should not, for a fault outside its zone, except to backup a failed relay or circuit breaker. The problem of coordinating protective relays in electric power systems consists of selecting their suitable settings such that their fundamental protective function is met under the requirements of sensitivity, selectivity, reliability and speed. 1.2 Justification for Using Genetic Algorithms This paper describes a systematic Overcurrent (OC) protection grading method based on GENETIC ALGORITHM (GA). Genetic Algorithms are computerized search and optimization algorithms based on the mechanics of natural genetics and natural selection. Professor Holland of University of Michigan envisaged the concept of these algorithms in the mid 60 s. Thereafter a number of students and other researchers have contributed to the development of this field. Genetic Algorithms are good at taking larger, potentially huge, search space and navigating them looking for optimal combinations of things and solutions which we might not find in a life time. 1.3 Solution Approach In [5], for Linear Programming, the values of Time Dial Setting (TDS) have been found for given values of pickup currents (Ip) and in [4], for Non-linear Programming, the values of pickup currents (Ip) have 326 P a g e

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 been found for given values of TDS using GA subject to the constraints and hence the operating times of the relays is minimized. 2. OPTIMAL COORDINATION PROBLEM Directional Overcurrent (DOCR) coordination problem is a parametric optimization problem, where different constraints have to be considered in solving the objective function [1]-[2]. Here the objective function to be minimized is the sum of the operating times of the relays connected to the system, subject to the following constraints. 2.1 Characterstics A typical Inverse Time Directional Over current relay consists of two elements, an instantaneous unit and a time overcurrent unit. The overcurrent unit has two values to be set: Pick up current value (I p ) and the Time Dial setting (TDS)/TMS. The pickup current value (I p ) is the minimum current value for which the relay operates[4]. The Time Dial Setting defines the operation time (T) of the device for each current value, and is normally given as a curve T vs M, where M is the ratio of relay fault current I, to the pickup current value: M=I/I p (1) In general, overcurrent relays respond to a characteristic function of the type: T=f(TDS, I p, I) (2) This Function can be approximated as: T= K 1 * TDS (3) I * K 2 CT Ratio* I p +K 3 Where K 1, K 2 and K 3 are constants that depend upon the specific device being simulated. The following two cases have been considered in this paper for obtaining the objective function and minimizing it. Case I The Linear equation is formulated in terms of TDS by taking Ip to be constant at a particular value in equation (3) Case II The Non-Linear equation is formulated in terms of Ip by taking TDS to be constant at a particular value in equation (3). 2.2 Settings The calculation of the two settings, TDS and I p, is the essence of the directional Overcurrent relay coordination study. It is very important to mention that in general, directional overcurrent relays allow for continuous time dial settings but discrete (rather than continuous) pickup current settings. Therefore this constraint can be formulated as: TDSi min TDSi TDSi max I Pimin I Pi I Pimax 2.3 Coordination Problem In any power system, a primary protection has its own backup one for guaranteeing a dependable power system. The two protective systems (primary and back-up) should be coordinated together. Coordination time interval (CTI) is the criteria to be considered for coordination. It s a predefined coordination time interval and it depends on the type of relays. For electromagnetic relays, CTI is of the order of 0.3 to 0.4 s, while for a microprocessor based relay, it is of the order of 0.1 to 0.2 s. To ensure reliability of the protective system, the back-up scheme shouldn t come into action unless the primary (main) fails to take the appropriate action. Only when CTI is exceeded, backup relay should come into action. This case is expressed as: T backup T primary CTI Where, T backup is the operating time of the backup relay relay T primary is the operating time of the primary After considering all these criteria, this problem can be formulated mathematically as: min n i=1 T i Where, n represents the number of relays. 2.4 Optimization Of TDS & I P The objective function is found and various coordination time constraints are formulated as proposed earlier. Coordination time constraints are formulated from the relay pair tabulation. 327 P a g e

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 The optimization of the functions is carried out by the GA toolbox by entering data in the appropriate fields. The objective function and constraints for the three bus and six bus systems are formulated. The proposed methodology has been applied to a 3-bus test system. The coordination time interval of 0.2 seconds is used. The TDS values ranges from 0.1 to 1.1 and I p from 0.1 to 1.1. The optimum TDS and I p values are determined using Genetic Algorithm. For Six bus systems, the P/B pairs and the fault currents for the systems are determined as per the proposed methodology. The TDS are assumed to vary between a minimum value of 0.5 to 1.1 and also I p from 0.5 to 1.1. A CTI of 0.2 is taken, while the transient changes in the network topology are not considered. The optimum TDS and I p values are determined using Genetic Algorithm. 3. GENETIC ALGORITHM Genetic algorithm (GA) is a search technique used in computing, to find exact or approximate solutions to optimization and search problems. Genetic algorithms are categorized as global search heuristics [6]-[7]. Genetic algorithms are a particular class of evolutionary algorithms (EA) that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover[8]-[9]. 3.1 Terminologies Related To Genetic Algorithm Fitness Function--A fitness function is a particular type of objective function that prescribes the optimality of a solution (that is, a chromosome) in a genetic algorithm sothat particular chromosome may be ranked against all the other chromosomes. Chromosome-- In genetic algorithms, a chromosome is a set of parameters which define a proposed solution to the problem that the genetic algorithm is trying to solve. The chromosome is often represented as a simple string, although a wide variety of other data structures are also used. Selection--During each successive generation, a proportion of the existing population is selected to breed a new generation. Individual solutions are selected through a fitness-based process, where fitter solutions are typically more likely to be selected. Reproduction--The next step is to generate a second generation population of solutions from those selected through genetic operator crossover. For each new solution to be produced, a pair of "parent" solutions is selected for breeding from the pool selected previously. By producing a "child" solution using the above methods of crossover and mutation, a new solution is created which typically shares many of the characteristics of its "parents". New parents are selected for each new child, and the process continues until a new population of solutions of appropriate size is generated. Crossover--In genetic algorithms, crossover is genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based. Mutation--In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next. It is analogous to biological mutation. 3.2 Outline Of The Genetic Algorithm It is very clear from flow chart given in Fig. 1. Fig. 1. Flow chart Create a Population of Chromosomes Determine The Fitness of Each Evaluation > n Gen. no Select Next Generation Perform Reproduction Using crossover crossovercrossover Perform Mutation yes Display Results 328 P a g e

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 4. PROPOSED ALGORITHM Step 1: Generate P/B relay pairs. The knowledge of primary/backup relay pairs is essential in the formulation of the coordination constraints. Step 2: Load flow analysis is done using Newton- Raphson method to determine line currents. This analysis can be done using any simulation softwares and here we have used ETAP simulation software. Step 3: Short circuit analysis is done using the same simulation software to find fault currents. Step 4: Pickup current is calculated based on the load current. Here it will be set at 1.5 times the maximum load current, for phase protection. Step 5: Minimization of objective function is carried out and optimum values of TDS are determined using linear programming technique in MATLAB. Step 6: The values of TDS and minimization of objective function is further optimized using Genetic Algorithm (GA) using MATLAB Toolbox. 5. SIMULATION AND RESULTS The performance of the proposed method is evaluated by, a 3-bus overcurrent relay network shown in Fig. 2. All relays have inverse characteristic and the aim is to find an optimal setting for network relays in order to minimize the final operating time and in such a way that all constraints are satisfied. The coordination time interval (CTI) is assumed to be 0.2 seconds. In order to solve the relay coordination problem first, it needs to determine the primary and backup relay pairs. For determining the primary and backup relay pairs, first select a relay then determine the relays which install in the far bus of the selected relay, then omitting the relay which is in the same line with selected relay. Now, it can say that the selected relays are the backup relays for the primary relay. Table I shows the primary/backup relays pairs and faults currents. The ratios of the current transformers (CTs) are indicated in Table II. Fig. 3. shows the convergence of the proposed method and the algorithm converge to the global solution. The result of the proposed method are shown in Table III and Table IV for linear and nonlinear function respectively. Fig. 2. Three bus system Table I Primary/Backup Pairs And Fault Currents Backup no. Fault current (KA) Table II CT Ratio Primary Fault current (KA) 5 1.457 1 2.673 4 0.327 2 1.666 1 0.543 3 1.666 6 0.765 4 2.673 3 1.005 5 1.325 2 0.670 6 2.469 CT Ratio no. CT Ratio 1 400/5 4 400/5 2 200/5 5 300/5 3 200/5 6 200/5 329 P a g e

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 Fig. 3 Convergence of the proposed method Table III Result Using GA (For Linear Function) Time dial Setting Value Obtained TDS 1 0.10001 TDS 2 0.18023 TDS 3 0.11908 TDS 4 0.12004 TDS 5 0.15236 TDS 6 0.1192 Fitness Function Value= 1.69083 sec Table IV Result Using GA(For Nonlinear Function) Pick up Current Obtained Values I p1 0.2831 I p2 0.60123 I p3 0.10091 I p4 0.42051 I p5 1.0808 I p6 0.5355 Fitness Function Value= 1.22844 sec 6. CONCLUSION In this paper, an optimization methodology is presented to solve the problem of coordinating directional overcurrent relays in an interconnected power system. The operating time of the relays was determined using GENETIC ALGORITHM for 3 bus system for both Linear Objective Functions and for Non Linear Objective Functions. The value of Time Dial setting (TDS) and Pick up current value (I p ) are found for linear and nonlinear function respectively in such a way that all constraints are satisfied. This method increases coordination and the operation speed of relays. Finding the absolute optimal point, the ability to be apply on large networks, the ability to consider both linear and non-linear characteristics of relays are some of advantages of the proposed method. The dependency of GA solution on initial condition is weaker and it requires more computing time. These are the some limitations of this method. REFERENCES Books: [1] P.M. Anderson, Power system protection. Newyork : McGraw-Hill,1999. Proceedings Papers: [2] L.Perez, A.J.Urdaneta, "Optimal Computation of Directional Overcurrent s Considering Definite Time Backup ing ", IEEE Transaction on Power Delivery, Vol. 4, No.4, October 1999, PP. 385-388 [3] L.Perez, A.J.Urdaneta, "Optimal Computation of Distance s Second Zone Timing in a Mixed Protection Scheme with Directional s", IEEE Transaction on Power Delivery, Vol. 16, No.3, July 2001, PP. 1276-1284. [4] AI. Urdaneta, R. Nadira and L.G. Perez Jimenez, "Optimal Coordination of Directional Overcurrent s in Interconnected Power Systems," IEEE Trans. Power Del, Vol 3, No. 3, PP 903-91 I, July.1988. [5] B. Chattopadhyay, M. S. Sachdev and T.S. Sidhu, "An On-Line Coordination Algorithm for Adaptive Protection Using Linear Programming Technique," IEEE Trans. Power Del, Vol 11, No. 1, PP 165-173, Jan. 1996. [6] Cheng-Hung Lee and Chao-Rong Chen - Using Genetic Algorithm for overcurrent 330 P a g e

Vol.2, Issue.1, Jan-Feb 2012 pp-326-331 ISSN: 2249-6645 Coordination in Industrial Power System - The 14 th National Conference on Intelligent Systems Applications to Power Systems, ISAP 2007 National Taipei University of Technology, Taiwan. [7] C. W. So, K. K. Li, K. T. Lai and K. Y. Fung, "Application of Genetic Algorithm to Overcurrent Grading Coordination," APSCO. 97, Vol 1, PP. 283-287,Nov. 1997. Journal Papers: [8] Farzad Razavi, Hossein Askarian Abyaneh - A new comprehensive Genetic Algorithm method for Optimal overcurrent relays coordination International Journal on Electric Power Systems Research, 78(2008) Pg: 713-720. Theses: [9] David E. Goldberg - Genetic Algorithms in Search, optimization and Machine Learning - Addison-Wesley, Reading MA, 331 P a g e