Optimal Capacitor Placement for IEEE 14 bus system using Genetic Algorithm

Size: px
Start display at page:

Download "Optimal Capacitor Placement for IEEE 14 bus system using Genetic Algorithm"

Transcription

1 Optimal Capacitor Placement for IEEE 14 bus system using Genetic Algorithm 1 Dnyaneshvar Y. Watpade, 2 P. M. Sonwane 1 Maharashtra State Electricity Distribution Company Limited, Nasik 2 K. K. Wagh Institute of Engineering Education & Research, Nasik Abstract Genetic Algorithm (GA) is a non-parametric optimization technique that is frequently used in problems of combinatory nature with discrete or continuous variables. Depending on the evaluation function used this optimization technique may be applied to solve problems containing more than one objective. In treating with multi-objective evaluation functions it is important to have an adequate methodology to solve the multiple objectives problem so that each partial objective composing the evaluation function is adequately treated in the overall optimal solution. In this paper the multiobjective optimization problem is treated in details and a typical example concerning the allocation of capacitor banks in a real distribution grid is presented. The allocation of capacitor banks corresponds to one of the most important problems related to the planning of electrical distribution networks. This problem consists of determining, with the smallest possible cost, the placement and the dimension of each capacitor bank to be installed in the electrical distribution grid with the additional objectives of minimizing the voltage deviations and power losses. As many other problems of planning electrical distribution networks, the allocation of capacitor banks are characterized by the high complexity in the search of the optimum solution. In this context, the GA comes as a viable tool to obtaining practical solutions to this problem. Simulation results obtained with a electrical distribution grid are presented and demonstrate the effectiveness of the methodology used. Keywords Genetic Algorithm, Multiple Objectives, Allocation of Capacitor Banks and Electric Distribution Grid. I. INTRODUCTION This Appropriate planning and maintenance of distribution systems are crucial for an efficient operation, with high quality services being provided to consumers. In this context, power quality becomes a very important issue, since it defines the final product delivered to consumers. Voltages must be maintained within the limits specified by regulatory agencies, without introducing harmonics, and the service should not suffer any interruptions. The maintenance of power quality regarding the voltage profile is taken into effect by using several measures, including preventive, corrective and emergency tools. Substation transformers equipped with tap-changing control can limit voltage variations within a certain range, thus reducing voltage deviations. However, with the load increase (for instance, at peak hours), tap position adjustments may happen to be insufficient for maintaining the voltage within the desired range, resulting in low voltages at the secondary windings of distribution transformers. Installing capacitor banks can be an interesting strategy for decreasing reactive power flows through the network, thus reducing voltage drops and real power losses. Several other benefits can be obtained with the appropriate allocation of capacitor banks, such as released feeder capacity, released distribution substation capacity, and financial benefits due to voltage improvement and loss reduction. The majority of power systems operate at a lagging power factor due to inductive loads and delivery apparatus (lines and transformers). Power systems are inductive in nature, and require additional reactive power flow from the power grid. But excessive reactive power demands result in reduced system capacity, increased losses, and decreased voltage, as well as higher operating costs. Shunt capacitor banks are able to compensate for var requirements, but bank size, location, the capacitor control method, and cost considerations are important issues that need to be optimized during the design phase. An ideal solution would be a capacitor placement tool able to weigh all these factors and that considers load levels. This solution should also be able to place capacitors for voltage support and power factor correction, while minimizing the total cost of installation and operation , IJIRAE- All Rights Reserved Page -43

2 AS DESCRIBED IN THE IEEE STANDARD (IEEE GUIDE FOR APPLICATION OF SHUNT POWER CAPACITORS), THE PURPOSES OF SHUNT CAPACITOR APPLICATIONS ARE: PURPOSE Var support Voltage control System capacity increase System power loss reduction Billing charge reduction BENEFITS To place shunt capacitors in power systems, it is necessary to: Determine bank size in kvar Determine connection location Determine a control method Determine a connection type (wye or delta) Yields a primary benefit for transmission systems and a secondary benefit for distribution systems. Yields a primary benefit for both transmission and distribution systems. Yields a secondary benefit for transmission systems and a primary benefit for distribution systems. Yields a secondary benefit for transmission systems and a primary benefit for distribution systems. Does not apply to transmission systems, but yields a primary benefit for distribution systems. The capacitor size and the appropriate location for voltage support and power factor correction can be determined in different ways. A common method applies rules of thumb techniques, and then runs multiple load flow studies to fine-tune the size and location. This method may not yield the optimal solution. And it can also be very time consuming and impractical for large systems. It is also important to minimize cost, while mathematically determining the capacitor size and location. Because this is an optimization issue, an optimization approach should be employed. A. OBJECTIVE : In the Objective group select the capacitor placement objective. This allows the OCP module to place capacitors to perform voltage support, power factor correction, or perform both at the same time. VOLTAGE SUPPORT : The OCP module checks voltage limits and places capacitors to meet the voltage limits when minimizing the cost. POWER FACTOR CORRECTION : The OCP module checks load power factor limits and places capacitors to meet the load power factor limits when minimizing the cost. BOTH: The OCP module checks voltage limits and load power factor limits, and places capacitors to meet the voltage limits and load power factor limits when minimizing the cost. GENETIC ALGORITHM FOR OCP GA is a search algorithm based on the mechanic of natural selection. Basically, a GA makes a population that evolves through time using reproduction and mutation process. Only individuals representing good solutions of the capacitor placement problem will survive longer, and their genetic information will be present in the next generation. At the end, after several generations, the interaction between these high quality individuals will produce a final population which represent the best solutions set of the problem. Three most important aspects of using GA are: Definition of objective function Definition and implementation of genetic representation Definition and representation of genetic operators Before of the genetic algorithm procedure, the real parameters of the problem must be represented in genetic algorithm language. It means that location and size of the capacitors used are codified as a chromosome. The representation chosen for this application is a chromosome divided in two parts. First part indexes location of the capacitors. The second part indicates the size of the capacitors used. In reproduction process, first we randomly select a pair of chromosomes, with the same structure. In the next step, chromosomes are treated separately; one for binary part and another for integer part. In binary part, for a given position, if two parents share value, the chromosome produced by reproduction will keep it. If values are different, the result for new chromosome is selected at random. In integer part, for a given position, result will be the average of values found in the parents. If result is not an integer value, it will be approximated until closer value at random , IJIRAE- All Rights Reserved Page -44

3 In mutation process, chromosome structure is modified. This change is performed at random, but there is a difference between binary and integer part. The GA was able to improve the quality of the randomly generated population very fast, and created good solutions in a very short time. In the selection of individuals for recombination, selection of a leader uniformly at random is required. The next step is to choose which one of the three supporters will take part in the recombination. This choice is also uniformly at random. Following this selection strategy, any pair of parents will belong to the same cluster. That makes the population act similarly to a multiple-population approach with a high migration rate. After the parents were selected, following the criterion described before, they are utilized as input parameters in the recombination operator. The recombination returns a new individual the offspring. Since the chromosome is composed of two distinct parts, they should be treated separately during the recombination process. The mutation operator aims to add diversity to the population of individuals. Similarly to the crossover, the mutation is divided into two parts. The first modifies the binary portion of the chromosome by choosing a position of the individual at random. The second part acts on the integer values by adding or subtracting a unity from its value. The choice of whether to add or subtract is also decided at random. Mutation is applied to 10% of the offspring. In general, higher mutation rates may slow down evaluation speed and hence should be avoided. After recombination and mutation, GA submits all or some of the new individuals to a local search procedure for the purpose of improving their fitness function. This local search acts at the first part of the chromosome, i.e., trying to improve capacitor location. If a specific location already has a capacitor, the local search tests the possibility of dropping that capacitor ( drop ). In case of deterioration of the solution, the position returns to the original value and the local search proceeds to the next one. This local search acts on the second part of the chromosome. It adjusts the sizes of the capacitors already present in the solution, trying to find the best size for each location. Only the sizes immediately above and below the present capacitor s size are tested. For instance, if a 600 kvar capacitor is installed in a given position, the procedure tries the capacitors with sizes 400 and 800 kvar, looking for any improvement. Such tries are executed in a similar manner to the add/drop procedure, in one capacitor at a time; accepting any change that improves the fitness. The fitness function quantifies the quality of the individual. Therefore, it will keep a close relation with the objective function of the problem. The first factor to be observed is the cost of the power losses, which takes into account the maximum voltage deviation observed in the distribution network s nodes for a given solution. Calculation of the power losses requires the execution of a load-flow algorithm. The objective of optimal capacitor placement is to minimize the cost of the system. This cost is measured in four ways: 1. FIXED CAPACITOR INSTALLATION COST 2. CAPACITOR PURCHASE COST 3. CAPACITOR BANK OPERATING COST (MAINTENANCE AND DEPRECIATION) 4. COST OF REAL POWER LOSSES Figure 1 The Genetic Algorithm Procedure , IJIRAE- All Rights Reserved Page -45

4 To understand in a clear way the applied methodology for equally considering the different evaluation functions (objectives) in a multi-objective fitness function it is initially made use of the fundamental concepts of the basic GA for a single evaluation function and, subsequently, this same principles are used so that each evaluation function behaves in the selection process as if the others didn t exist. The GA processing begins with an initial population in which the genetic material for each individual of the population is established randomly. The Evaluation Process calculates the evaluation values for each chromosome (solution). To avoid problems related to super-individuals or when the evaluation values of the individuals of the population are very close amongst themselves and very distant from the reference, fitness evaluation techniques are adopted such as Linear Normalization and Windowing. For this work the Linear Normalization is used as the fitness evaluation technique. This avoids not only the two mentioned aspects as well as it allows the evaluation values to be negative. THE GA PROCEDURE IS SUMMARIZED BY THE STEPS ILLUSTRATED IN FIGURE 1. In other words, the Linear Normalization is equal to establishing fitness values uniformly distributed in an interval and linearly related with the rank of the best fit individuals. Therefore, what defines the selection frequency of each individual in the population is its position in the rank of the best fit individuals. In the end of the evaluation process, the fitness values are passed to the selection process. The selection process characterizes the most important step of the GA, because it is this process that imitates the Natural Selection. The selection process is governed by selection techniques such as the Roulette- Wheel Selection, the Tournament Selection and the Stochastic Universal Sampling. The genetic operators of crossover and mutation act after the selection process and they determine the balance among the exploitation and exploration elements during the evalution of the Genetic Algorithm. The crossover is commonly accomplished by techniques such as the crossover of One-Point, Two-Points and Uniform. After the application of the genetic operators, a new population is obtained. According to Figure 1, all of the individuals of the population are changed by their descendants. But, with the purpose of adding components of memory of previous evolutions, individuals of the old population can be added to the new population. That is accomplished through techniques such as Elitism and Stead State. The methodology proposed in this work doesn't interfere in the way of processing the phases of the basic GA, described previously. It just adds one more particularity to the process that will be presented in the next section. The Lab WASF software, used to simulate the results presented in this paper, incorporate the basic GA configuration as well as the proposed methodology. B. CALCULATION OF THE TOTAL FITNESS VALUE In general, one aspect that distinguishes an evaluation function from another is its metric, such as MW, Volts, $, among others. It is common to observe the use of constant factors to penalize the values of the different evaluation functions. However, the values of these constants must be defined by the user in a trial and error approach and may cause additional difficulty in the interaction between the user and GA. In the following analyses it is considered only the evaluation process without losing of view the impacts in the selection process. It is supposed a population with M chromosomes and that each chromosome of the population must be evaluated by N evaluation functions. The value corresponding to the evaluation function i of the chromosome k is defined as: Evaluation ik, Where 1 k M and 1 i N. In this point, no effort should be made to join the evaluation functions. It is calculated the individuals aptitudes according to the adopted fitness evaluation technique (Linear Normalization). However, to apply this technique it is necessary to establish the rank values of the most capable individuals for each evaluation function. In this context, each one of the evaluation function i is used without considering the other functions, as what happens in a GA that makes use of a single evaluation function. Then, each evaluation function i will create a rank i. Figure 2 allows to observe the classification of the individuals of a hypothetical population for each rank i. In this figure, j is the placement of the chromosomes in the rank, i indicates the evaluation function to which the rank is associated and k is the index of the chromosome. Then, Figure 2 illustrates a rank matrix whose elements are the indexes k of the chromosomes, the lines are given by j and the columns by i. Each rank i creates a fitness value for each chromosome of the population and, therefore, for the N ranks there is, for each chromosome, N fitness values. Considering the technique of Linear Normalization the aptitude value of chromosome k with placement j in the rank i is given for: Fitnesski = max-[(max-min)/(1-m)].(j-1) Where k = rank[ j][i], 1 j M and 1 i N , IJIRAE- All Rights Reserved Page -46

5 Figure 2 Ranks associated to each evaluation function. The values of min and max are defined by the user. However, if the selection method is the Roulette-Wheel Selection and the size of the population is not very big, a good choice would be min=1 and max=m. This choice gives to the less fit chromosome a chance of survival equal to the difference among the chances of two any consecutive chromosomes. However, if the selection method is the Tournament, the less fit individual will be dead for any value min. In this case a convenient value would be min=0 and max=100. SYSTEM IDENTIFICATION INTRODUCTION A new and efficient approach for optimal capacitor configuration in IEEE 14 bus system is selected as case study. Determination of optimal locations and size of capacitor with an objective function for the constraints like maintaining the voltage profile and power factor as per standard. Other benefits of optimal capacitor configuration are reduction in power loss and enhancement of reliability of the system. The solution methodology genetic algorithm is used to optimal capacitor placement using ETAP software. The Capacitor Location or Placement for low voltage systems determines capacitor size, location and control schemes. Optimal capacitor placement is generally a hard combinatorial optimization problem that can be formulated as a nonlinear multiobjective problem. Many researchers had carried out work on optimal capacitor placement including Neural Network, Partial Swarm Optimization and Fuzzy theory. This dissertation work is based on Genetic Algorithm based optimal capacitor placement and sizing. ETAP software is used to evaluate the capacitor size and place in the system network. IEEE 14 bus system is selected as test system for OCP using ETAP software. This system consist of 14 bus in addition to 20 branches and 11 Load points. It is observed that capacitor placement in this system improves voltage profile attain the marginal power factor and reduces active and reactive losses. This also supports in capacity release. CAPACITOR PLACEMENT PROBLEMS CAN BE SOLVED IN TWO STEPS: Use of load flow model and find system parameters including feeder losses Minimize the cost function-min f- subject to constraints, like practical limits of voltage and capacitor size available, power factor. OBJECTIVE FUNCTION Min COST = ni=0 KpLP + KE LE + CC Where, KpLP= Peak Power Loss, KE LE = Energy Loss,CC = Cost of capacitor, N= No. of buses For constraint <= V=<1.05; pf=>0.95 ASSUMPTIONS CONSIDERED IN THE DEVELOPMENT OF THE OBJECTIVE FUNCTION ARE (a) Balanced network considered for simplicity (b) Capacitors are available in step size and (c) Capacitor placement affects only the flow of reactive power in the feeder. II. SYSTEM DESCRIPTION OF IEEE 14 BUS Optimal capacitor placement and sizing problem is formulated based on the requirements of benefits due to reliability cost, cost of capacitor, purchase cost, operating cost, maintenance cost and savings due to transmission and distribution loss for IEEE 14 bus system. The one line diagram of an IEEE-14 bus system is shown in Fig.1. The System data is taken from IEEE PES Society and discussed in Appendix A. In this system five generators placed at bus numbers 1,2,3,6 and 8. Trans- formers are placed in between buses 4-7; 4-9; 5-9. IEEE 14 bus system is benchmark system selected for the case study. The system is also graphically represented and tabulated in Appendix A. In short, this network consists of 14 buses, 20 branches, and 12 loads , IJIRAE- All Rights Reserved Page -47

6 TABLE 1: SYSTEM DESCRIPTION BUSES 14 BRANCHES 20 GENERATORS 5 POWER GRIDS 0 LOADS 12 Figure 3: IEEE 14 bus system III. LOAD FLOW ANALYSIS FOR IEEE 14 BUS SYSTEM During load Flow study, this research work is carried out for the system as it is for evaluation of power factor, capacity of transmission line, voltage profile and other parameters. As this research is oriented for optimal capacitor placement, the existing fixed capacitors in the network is removed first and then load flow is carried out before capacitor placement as well as with capacitor placement. TABLE 2: LINE DATA FROM LOAD FLOW IN ETAP ID RATING RATE KV KW KVAR AMP % PF % LOADING V TERMAL BUS SHUNT KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA LOAD KVA , IJIRAE- All Rights Reserved Page -48

7 TABLE 3:GENERATOR DATA FOR LOAD FLOW IN ETAP ID RATING RATED KV MW MVAR AMP % PF % GENE RATION GEN_ MW GEN_2 40 MW GEN_3 0 MW GEN_6 0 MW GEN_8 0 MW LOAD FLOW OF IEEE 14 BUS ETAP based load flow study is carried out using ETAP and given in Table 2 Fig. 3 shows IEEE 14 bus system. The details of this system is also illustrated in Appendix A. OCP-PSO software initialize with ETAP based load flow data. Necessary information relating to bus and line is passed through OCP treatment in two modules. First module simulates objective function without capacitor and second module introduces PSO treatment with capacitor placement with Local and Global minima. IV. ETAP SIMULATION PROCESS FOR LOAD FLOW Figure 4: IEEE 14 bus system Load Flow Analysis Table 2 shows bus data simulations for bus voltage in per unit, rated voltage, active and reactive power loading and ampere loading on every bus. Table 3 indicates load data information regarding active and reactive power drawn by load, power factor load current, percentage loading and terminal voltage. All these information is essential in OCP simulation process which is developed in dot net framework. Table 2 shows load data without capacitor while Table 3 represents generator data. This useful data is then provided as input to OCP software module. Five generators are connected to bus 1, 2, 3,6, 8. Generator 1 is connected to swing bus and rated with MW as shown in Table 5.5. This generator is running with 100 % generation with MW, MVAr with leading power factor. Generator 2 is producing 40MW active and MVAr reactive powers. Whereas genera tors placed at buses 3,6, 8 are standby and used to absorb reactive power. IEEE 14 bus line data is shown in Table 2 with line number, active and reactive power flow, current flow, voltage drop in line and active and reactive power losses due to resistance and inductance of transmission line or transformer device. This line data is provided to OCP software for further evaluation process through two treatments in the module, one without capacitor and other with capacitor placement module. V. OCP MODULE IN ETAP Optimal Capacitor Placement module in ETAP consist, Optimal location & bank size Minimize installation & operation costs Individual source or average energy cost Voltage & power factor objectives Minimum, maximum, & average loading Branch capacity release & cost savings Review capacitor impact on the system Capacitor control method To place shunt capacitors in power systems , IJIRAE- All Rights Reserved Page -49

8 It is necessary to determine bank size in kvar, determine connection location, determine a control method and determine a connection type. The capacitor size and the appropriate location for voltage support and power factor correction can be determined in different ways. A common method applies rules of thumb techniques, and then runs multiple load flow studies to fine-tune the size and location. Unfortunately, this method may not yield the optimal solution and it can also be very time consuming and impractical for large systems. A. KEY FEATURES OF ETAP Calculate the most cost-effective installation locations and best bank size Minimize total installation and operation cost Consider voltage support and power factor correction Evaluate Capacitor control method Allow review of capacitor impact on the system Employ most advanced optimum techniques Figure 5: IEEE 14 bus system optimal capacitor placement B. FLEXIBLE OPERATION Show available locations Apply user-selected load categories Utilize individual and global constraints Handle unlimited network configurations Use only user selected installation locations Constrain maximum capacitors installed at a location to user specified quantity C. CAPABILITY OF ETAP OCP MODULE Advanced graphic user interface User friendly input and output Instantly view new capacitors Speed and precision control Integrated load flow results Standard Crystal reports D. PLOTTING IN ETAP Loss reduction savings during the planning period Capacitor operation cost during the planning period Profit during the planning period , IJIRAE- All Rights Reserved Page -50

9 E. REPORTING Capacitor properties Capacitor locations and sizes Load flow results for maximum, average and minimum loads Branch capacity release Cost summary VI. CALCULATION METHOD ETAP currently utilizes the genetic algorithm for optimal capacitor placement. The genetic algorithm is an optimization technique based on the theory of natural selection. A genetic algorithm starts with a generation of solutions with wide diversity to represent characteristics of the whole search space. By mutation and crossover, good characteristics are selected and carried to the next generation. The optimal solution can be reached through repeated generations. OCP uses the present worth method to perform alternative comparisons. It considers initial installation and operating costs, which include maintenance, depreciation, and loss reduction savings. OBJECTIVE FUNCTION OF OCP IN ETAP The objective of optimal capacitor placement is to minimize the cost of the system. This cost is measured in four ways: Fixed capacitor installation cost Capacitor purchase cost Capacitor bank operating cost (maintenance and depreciation) Cost of real power losses Cost can be represented mathematically as: minf = xic0i + QciC1i + BiC2iT + C2 TlPLi Nbus - No of bus candidate Xi - 0/1,0 means no cap installed at bus i C0i - Installation cost C1i - per kvar cost of capacitor bank Qci - Capacitor bank size in KVAr Bi - Number of capacitor banks C2i - Operating cost of per bank, per year T - Planning period(years) C2 - Cost of each kwh loss in Rs/kWh L - Load levels, maximum, average and minimum Tl - Time duration, in hours, of load level lpli - Total system loss at load level l Constraints The main constraints for capacitor placement are to meet the load flow constraints. In addition, all voltage magnitudes of load (PQ) buses should be within the lower and upper bars. Load Power Factor (PF) should be greater than the minimum. It may be a maximum power factor bar at unity. The constraints can be represented mathematically as: Vmin < V < Vmax PFmin PF VTHD V max THD Qci Bi KVAR ETAP based optimal capacitor placement for IEEE 14 bus system is studied. VII. SIMULATION AND RESULTS For this research work, a case study of IEEE 14 bus system is selected to implement optimal capacitor placement. ETAP has different module for reliability and optimal capacitor placement. This research work is carried out for ETAP based optimal capacitor placement for IEEE 14 bus. Adding KVAr through capacitor placement can/may improve voltage profile, modify power factor, decrease losses, improve reliability indices, decrease cost associated to reliability and lot of benefits. Most importantly capacitor placement should be profit oriented in addition to above benefits. all above parameters which modifies as number of capacitor increases while placing capacitor is evaluated. All these parameters are then compared with the results when no capacitor is placed. This comparison study is required to take decision whether to place a capacitor or not. This study includes voltage constraint, power factor constraint and both constraint separately At the same time, voltage constraint is studied for two different limits (i) 0.95 < V < 1.05 and (ii) 0.9 < V < 1.1 for 10 cases for this study. In ETAP software, OCP and reliability is evaluated separately and cost function is added such that the objective function developed should match with objectives of genetic algorithm technique used in ETAP. Before optimal capacitor placement in ETAP following parameters are set as bus constraints , IJIRAE- All Rights Reserved Page -51

10 TABLE 4 CONSTRAINTS APPLIED BUS ID %VOLTAGE (MIN) %VOLTAGE (MAX) P.F. (MIN) P.F. (MAX) BUS BUS BUS BUS BUS BUS BUS After applying these constraints ETAP proposed capacitor bank at following buses TABLE 5 CAPACITOR PLACEMENT AFTER OCP BUS NO CAPCITOR SIZE NO. OF CAPACITORS PLACED BUS 4 20 KVAR 8 BUS 5 20 KVAR 2 BUS 7 20 KVAR 14 BUS KVAR 100 BUS KVAR 37 BUS KVAR 11 BUS KVAR 88 Results are compared for loss reduction, p.f. improvement, capacity release in dissertation work before and after OCP implementation TABLE 6 BRANCH/CKT LOSS COMPARISON BEFORE OCP AND AFTER OCP BRANCH LOSSES BEFORE OCP LOSSES BEFORE OCP (KVAR) LOSSES AFTER OCP LOSSES AFTER OCP (KVAR) (KW) (KW) TOTAL TABLE 7 BUS % VTG COMPARISON BEFORE OCP AND AFTER OCP BUS NO. % VOLTAGE BEFORE OCP % VOLTAGE AFTER OCP BUS BUS BUS , IJIRAE- All Rights Reserved Page -52

11 BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS TABLE 8 BUS % P.F. COMPARISON BEFORE OCP AND AFTER OCP BUS NO % P. F. BEFORE OCP % P. F. AFTER OCP BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS BUS VIII. CONCLUSION In this paper, a new method for solving capacitor placement problem was described. It can provide specific location of fixed capacitors in order to reduce energy system's losses. The load variation, the energy cost and capacitors sizes easily found in market were considered in the model. The program developed can be used in radial systems with different topologies and load variation because it has flexible parameters. Also it can be used as an analysis tool to make planning studies or to take decisions about the convenience of a specific reactive compensation plan. Then is a powerful tool in the design of an electrical distribution system.so, the work presented is possible, cheap and reliable to find the optimal capacitor placement in a radial system. REFERENCES [1] Carpinelli, G. ; Celli, G. ; Mocci, S. ; Mottola, F.; Pilo, F.; Proto, D., Optimal Integration of Distributed Energy Storage Devices in Smart Grids, Smart Grid, IEEE Transactions on Volume: 4, Issue: 2 DOI: Year: 2013, [2] Biswas, S. ; Goswami, S.K. ; Chatterjee, A., Optimal distributed generation place- ment in shuntcapacitor compensated distribution systems considering voltage sag and harmonics distortions, Generation, Transmission & Distribution, IET Volume: 8, Is- sue: 5 Publication Year: 2014, [3] Hamid Reza Esmaeilian, Omid Darijany, Mohsen Mohammadian, Optimal place- ment and sizing of DG units and capacitors simultaneously in radial distribution networks based on the voltage stability security margin, Turkish Journal of Electrical Engineering & Computer Sciences, Published Online,2014, [4] Calderaro, V. ; Galdi, V. ; Piccolo, A. ; Conio, G. ; Fusco, R., Wind farm power plant: Optimal capacitor placement for reactive power compensation, Innovative Smart Grid Technologies Europe (ISGT EUROPE), th IEEE/PES Year: 2013, [5] Sathya Siva Chandan. G, Optimal Placement of Capacitor and Sizing in a Radial Distribution Network to Reduce Real Power Losses, International Journal of Scien- tific Engineering and Research (IJSER) ISSN (Online): Volume 2 Issue 9, September , IJIRAE- All Rights Reserved Page -53

Optimal Capacitor Placement for Loss Reduction in Distribution Systems Using Fuzzy and Hybrid Genetic Algorithm

Optimal Capacitor Placement for Loss Reduction in Distribution Systems Using Fuzzy and Hybrid Genetic Algorithm Optimal Capacitor Placement for Loss Reduction in Distribution Systems Using Fuzzy and Hybrid Genetic Algorithm Dinakara Prasad Reddy P Lecturer, Department of EEE, SVU College of Engineering, Tirupati

More information

Introduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST

Introduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Introduction to Artificial Intelligence Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Chapter 9 Evolutionary Computation Introduction Intelligence can be defined as the capability of a system to

More information

J. Basic. Appl. Sci. Res., 2(12) , , TextRoad Publication

J. Basic. Appl. Sci. Res., 2(12) , , TextRoad Publication J. Basic. Appl. Sci. Res., 2(12)12714-12721, 2012 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Placement of Distributed Generation Unit and

More information

Optimal Placement of Distributed Generator in Distribution System using Fuzzy Composition

Optimal Placement of Distributed Generator in Distribution System using Fuzzy Composition Optimal Placement of Distributed Generator in Distribution using Fuzzy Composition Gursharanjit Singh Gill Student (Electrical Engg), Deptt. of Electrical Engineering Bhutta College of Engineering And

More information

CHAPTER 2 REACTIVE POWER OPTIMIZATION A REVIEW

CHAPTER 2 REACTIVE POWER OPTIMIZATION A REVIEW 14 CHAPTER 2 REACTIVE POWER OPTIMIZATION A REVIEW 2.1 INTRODUCTION Reactive power optimization is an important function both in planning for the future and day-to-day operations of power systems. It uses

More information

Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or

More information

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm)

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Numerical Example A simple example will help us to understand how a GA works. Let us find the maximum value of the function (15x - x 2

More information

Optimal Allocation and Contingency Analysis Studies of Embedded Generation in Distribution Systems

Optimal Allocation and Contingency Analysis Studies of Embedded Generation in Distribution Systems M.H. Sulaiman, O. Aliman and S.R.A. Rahim / International Energy Journal 12 (2011) 67-76 67 Optimal Allocation and Contingency Analysis Studies of Embedded Generation in Distribution Systems www.rericjournal.ait.ac.th

More information

Power Quality Improvement in Distribution System Using Distribution Static Compensator

Power Quality Improvement in Distribution System Using Distribution Static Compensator Power Quality Improvement in Distribution System Using Distribution Static Compensator Jay Kumar Sharma 1, Om Prakash Mahela 2 and Sunil Agarwal 1 1 Department of Electrical Engineering, Apex Institute

More information

Generational and steady state genetic algorithms for generator maintenance scheduling problems

Generational and steady state genetic algorithms for generator maintenance scheduling problems Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.

More information

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad. GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary

More information

Study on Oilfield Distribution Network Reconfiguration with Distributed Generation

Study on Oilfield Distribution Network Reconfiguration with Distributed Generation International Journal of Smart Grid and Clean Energy Study on Oilfield Distribution Network Reconfiguration with Distributed Generation Fan Zhang a *, Yuexi Zhang a, Xiaoni Xin a, Lu Zhang b, Li Fan a

More information

2. Genetic Algorithms - An Overview

2. Genetic Algorithms - An Overview 2. Genetic Algorithms - An Overview 2.1 GA Terminology Genetic Algorithms (GAs), which are adaptive methods used to solve search and optimization problems, are based on the genetic processes of biological

More information

Multi Objective Evolutionary Programming Based Optimal Placement of Distributed Generators

Multi Objective Evolutionary Programming Based Optimal Placement of Distributed Generators Multi Objective Evolutionary Programming Based Optimal Placement of Distributed Generators T.Hussain Basha PG Student, Department of EEE (PS), K.Meenendranath Reddy Assistant Professor, Department of EEE,

More information

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA , June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz

More information

An Assessment of Distributed Generation Impacts on Distribution Networks using Global Performance Index

An Assessment of Distributed Generation Impacts on Distribution Networks using Global Performance Index An Assessment of Distributed Generation Impacts on Distribution Networks using Global Performance Index Hussein. A. Attia, Zeinab H. Osman, M. El-Shibini, and Ahmed A. Moftah Electrical Power and Machine

More information

PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM

PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -

More information

OPTIMAL PLACEMENT OF MULTIPLE TYPE DGs IN RADIAL DISTRIBUTION SYSTEM USING SENSITIVITY BASED APPROACH

OPTIMAL PLACEMENT OF MULTIPLE TYPE DGs IN RADIAL DISTRIBUTION SYSTEM USING SENSITIVITY BASED APPROACH International Journal of Electrical Engineering & Technology (IJEET) Volume 9, Issue 3, May-June 2018, pp. 192 198, Article ID: IJEET_09_03_022 Available online at http://www.iaeme.com/ijeet/issues.asp?jtype=ijeet&vtype=9&itype=3

More information

Loss Minimization and Voltage Profile Improvement with Network Reconfiguration and Distributed Generation V Usha Rani 1, J Sridevi 2

Loss Minimization and Voltage Profile Improvement with Network Reconfiguration and Distributed Generation V Usha Rani 1, J Sridevi 2 Impact Factor Value: 4.029 ISSN: 2349-7084 International Journal of Computer Engineering In Research Trends Volume 4, Issue 10, October - 2017, pp. 449-455 www.ijcert.org Loss Minimization and Voltage

More information

Application of DG in Power System Planning and Design

Application of DG in Power System Planning and Design IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 07 (July. 2014), V2 PP 10-15 www.iosrjen.org Application of DG in Power System Planning and Design J.Moharana,

More information

Performance Improvement in Distribution Network with DG

Performance Improvement in Distribution Network with DG The 23 224 nd International 25 Power Engineering and Optimization Conference (PEOCO2008), Shah Alam, Selangor, MALAYSIA. 4-5 June 2008. Performance Improvement in Distribution Network with DG 1 Siti Rafidah

More information

Optimal Voltage Control in Distribution Network.

Optimal Voltage Control in Distribution Network. Optimal Voltage Control in Distribution Network. José Raúl Castro 1,*, Maarouf Saad.2, Serge Lefebvre 3, Dalal Asber 3 1 PHD student in the ETS, Montreal, Canada. 2 ETS Professor, Montreal, Canada 3 HydroQuebec,

More information

Optimal Voltage Control in Distribution Network.

Optimal Voltage Control in Distribution Network. Optimal Voltage Control in Distribution Network. José Raúl Castro 1,*, Maarouf Saad.2, Serge Lefebvre 3, Dalal Asber 3 1 PHD student in the ETS, Montreal, Canada. 2 ETS Professor, Montreal, Canada 3 HydroQuebec,

More information

Optimal DG Location and Size for Power Losses Minimization in Al-Najaf Distribution Network Based on Cuckoo Optimization Algorithm

Optimal DG Location and Size for Power Losses Minimization in Al-Najaf Distribution Network Based on Cuckoo Optimization Algorithm IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 11, Issue 5 Ver. III (Sep - Oct 2016), PP 97-101 www.iosrjournals.org Optimal DG Location

More information

Part 1: Motivation, Basic Concepts, Algorithms

Part 1: Motivation, Basic Concepts, Algorithms Part 1: Motivation, Basic Concepts, Algorithms 1 Review of Biological Evolution Evolution is a long time scale process that changes a population of an organism by generating better offspring through reproduction.

More information

The Effect of the Volt/Var Control of Photovoltaic Systems on the Time-Series Steady-State Analysis of a Distribution Network

The Effect of the Volt/Var Control of Photovoltaic Systems on the Time-Series Steady-State Analysis of a Distribution Network The Effect of the Volt/Var Control of Photovoltaic Systems on the Time-Series Steady-State Analysis of a Distribution Network Insu Kim, Ronald G. Harley, and Raeey Regassa Georgia Institute of Technology,

More information

ACTIVE DISTRIBUTION NETWORK PLANNING BASED ON A HYBRID GENETIC ALGORITHM-NONLINEAR PROGRAMMING METHOD

ACTIVE DISTRIBUTION NETWORK PLANNING BASED ON A HYBRID GENETIC ALGORITHM-NONLINEAR PROGRAMMING METHOD th International Conference on Electricity Distribution Glasgow, -5 June 0 Paper 0 ACTIVE DISTRIBUTION NETWORK PLANNING BASED ON A HYBRID GENETIC ALGORITHM-NONLINEAR PROGRAMMING METHOD Nikolaos KOUTSOUKIS

More information

Designing a New Particle Swarm Optimization for Make-with-Buy Inventory Model

Designing a New Particle Swarm Optimization for Make-with-Buy Inventory Model Proceedings of the 14 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 14 Designing a New Particle Swarm Optimization for Make-with-Buy Inventory

More information

Optimisation and Operations Research

Optimisation and Operations Research Optimisation and Operations Research Lecture 17: Genetic Algorithms and Evolutionary Computing Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/

More information

Journal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM

Journal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING

More information

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 5, November 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 5, November 2013 Optimal Placement of SPV based DG and Capacitor usingheuristic Search Strategies for Loss less Distribution U. Ravi Kumar G. Surya Chandra Abstract: In this paper, a method for determining the optimum

More information

Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization

Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support

More information

I. INTRODUCTION

I. INTRODUCTION GENETIC ALGORITHM FOR OPTIMAL BATTERY ENERGY STORAGE SYSTEMS CAPACITY AND SITE SELECTION FOR A DISTRIBUTION NETWORK WITH A HIGH PENETRATION OF WIND ENERGY 1 ABDULWAHAB ALHAMALI, 2 MOHAMED EMAD FARRAG,

More information

Machine Learning. Genetic Algorithms

Machine Learning. Genetic Algorithms Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:

More information

Machine Learning. Genetic Algorithms

Machine Learning. Genetic Algorithms Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:

More information

GENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH

GENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH International Journal of Engineering Research and Applications (IJERA) ISSN: 48-96 National Conference on Emerging Trends in Engineering & Technology (VNCET-30 Mar 1) GENETIC ALGORITHM A NOBLE APPROACH

More information

Ancillary Service for Transmission Systems By Tap Stagger Operation in Distribution Networks

Ancillary Service for Transmission Systems By Tap Stagger Operation in Distribution Networks 1 Ancillary Service for Transmission Systems By Tap Stagger Operation in Distribution Networks Linwei Chen, Haiyu Li, Steve Cox, and Kieran Bailey Presented by Dr Haiyu Li haiyu.li@manchester.ac.uk Senior

More information

Lecture Notes in Energy 5

Lecture Notes in Energy 5 Lecture Notes in Energy 5 For further volumes: http://www.springer.com/series/8874 . Hortensia Amaris Monica Alonso Carlos Alvarez Ortega Reactive Power Management of Power Networks with Wind Generation

More information

Intro. ANN & Fuzzy Systems. Lecture 36 GENETIC ALGORITHM (1)

Intro. ANN & Fuzzy Systems. Lecture 36 GENETIC ALGORITHM (1) Lecture 36 GENETIC ALGORITHM (1) Outline What is a Genetic Algorithm? An Example Components of a Genetic Algorithm Representation of gene Selection Criteria Reproduction Rules Cross-over Mutation Potential

More information

Cost estimation for reactive power compensation in distribution power system by using D-STATCOM

Cost estimation for reactive power compensation in distribution power system by using D-STATCOM Cost estimation for reactive power compensation in distribution power system by using D-STATCOM * Kittaya Somsai 1) and Thanatchai Kulworawanichpong 2) 1) Department of Electrical Engineering, Sakon Nakhon

More information

FUZZY LOGIC APPROACH TO REACTIVE POWER CONTROL IN UTILITY SYSTEM

FUZZY LOGIC APPROACH TO REACTIVE POWER CONTROL IN UTILITY SYSTEM FUZZY LOGIC APPROACH TO REACTIVE POWER CONTROL IN UTILITY SYSTEM Mr. C. Ramesh Dr. M. Rajaram (Corresponding author) Vice-Chancellor, Research Scholar, Anna University of Technology, Anna University of

More information

Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science

Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science 1 GA (1/31) Introduction Based on Darwin s theory of evolution Rapidly growing area of artificial intelligence

More information

COST-EFFICIENT ENVIRONMENTALLY-FRIENDLY CONTROL OF MICRO- GRIDS USING INTELLIGENT DECISION-MAKING FOR STORAGE ENERGY MANAGEMENT

COST-EFFICIENT ENVIRONMENTALLY-FRIENDLY CONTROL OF MICRO- GRIDS USING INTELLIGENT DECISION-MAKING FOR STORAGE ENERGY MANAGEMENT Intelligent Automation and Soft Computing, Vol. 1X, No. X, pp. 1-26, 20XX Copyright 20XX, TSI Press Printed in the USA. All rights reserved COST-EFFICIENT ENVIRONMENTALLY-FRIENDLY CONTROL OF MICRO- GRIDS

More information

Determination of Smart Inverter Control Settings to Improve Distribution System Performance

Determination of Smart Inverter Control Settings to Improve Distribution System Performance 21, rue d Artois, F-75008 PARIS CIGRE US National Committee http : //www.cigre.org 2014 Grid of the Future Symposium Determination of Smart Inverter Control Settings to Improve Distribution System Performance

More information

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur... What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually

More information

Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems

Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw

More information

Daniel Feltes Phone: Fax:

Daniel Feltes Phone: Fax: Coordination of Controls of Renewable Power Plants to Meet Steady State and Dynamic Response Requirements for Voltage Control and Reactive Power Supply Dinemayer Silva Phone: 518-395-5169 Fax: 518-346-2777

More information

Genetic Programming for Symbolic Regression

Genetic Programming for Symbolic Regression Genetic Programming for Symbolic Regression Chi Zhang Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN 37996, USA Email: czhang24@utk.edu Abstract Genetic

More information

Optimal Location and Sizing of DG using Fuzzy logic

Optimal Location and Sizing of DG using Fuzzy logic International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Optimal Location and Sizing of DG using Fuzzy logic Sujata Huddar 1, B. Kantharaj 2, K. R. Mohan 3, S. B. Patil 4, Rudresh Magadum

More information

Optimal Allocation of Distributed Generation in Distribution System for Loss Reduction

Optimal Allocation of Distributed Generation in Distribution System for Loss Reduction 2012 IACSIT Coimbatore Conferences IPCSIT vol. 28 (2012) (2012) IACSIT Press, Singapore Optimal Allocation of Distributed Generation in Distribution System for Loss Reduction Gopiya Naik S. 1+, D. K. Khatod

More information

Optimal Positioning and Sizing of DG Units Using Differential Evolution Algorithm

Optimal Positioning and Sizing of DG Units Using Differential Evolution Algorithm Optimal Positioning and Sizing of DG Units using Differential Evolution Algorithm 1 Himanshu Sangwan, 2 Ravi 1,2 D C R University of Science & Technology Murthal, Sonipat 1 himanshusangwan6838@gmail.com,

More information

OBJECTIVE To design an algorithm that can be used for planning the location of distribution substations in a network.

OBJECTIVE To design an algorithm that can be used for planning the location of distribution substations in a network. SUBSTATION DESIGN PRJ 100 SAIDI FELIX JUMA F17/9366/2002 SUPERVISOR: DR.CYRUS WEKESA EXAMINER:DR. M.K. MANG OLI OBJECTIVE To design an algorithm that can be used for planning the location of distribution

More information

A Genetic Algorithm on Inventory Routing Problem

A Genetic Algorithm on Inventory Routing Problem A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract

More information

Introduction To Genetic Algorithms

Introduction To Genetic Algorithms 1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization

More information

College of information technology Department of software

College of information technology Department of software University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************

More information

A NOVEL OF PRIMARY DISTRIBUTION NETWORKS WITH MULTIPLE DISTRIBUTED GENERATOR PLACEMENT FOR LOSS REDUCTION

A NOVEL OF PRIMARY DISTRIBUTION NETWORKS WITH MULTIPLE DISTRIBUTED GENERATOR PLACEMENT FOR LOSS REDUCTION A NOVEL OF PRIMARY DISTRIBUTION NETWORKS WITH MULTIPLE DISTRIBUTED GENERATOR PLACEMENT FOR LOSS REDUCTION TERLI JAHNAVI M.Tech(PE). CRR COLLEGE OF ENGINEERING, ELURU. N PAVAN KUMAR, Assistant Professor

More information

Selecting Genetic Algorithm Operators for CEM Problems

Selecting Genetic Algorithm Operators for CEM Problems Selecting Genetic Algorithm Operators for CEM Problems Randy L. Haupt Communications Science & Technology The Pennsylvania State University Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030

More information

I. RENEWABLE ENERGY SOURCES AND ENVIRONMENTAL PROTECTION

I. RENEWABLE ENERGY SOURCES AND ENVIRONMENTAL PROTECTION I. RENEWABLE ENERGY SOURCES AND ENVIRONMENTAL PROTECTION OPTIMAL INTEGRATION OF DISTRIBUTED ENERGY STORAGE AND SMALL GENERATORS INTO AN ISLANDED MICROGRID WITH RENEWABLE SOURCE Thang Vu, Xavier Le Pivert,

More information

Software Next Release Planning Approach through Exact Optimization

Software Next Release Planning Approach through Exact Optimization Software Next Release Planning Approach through Optimization Fabrício G. Freitas, Daniel P. Coutinho, Jerffeson T. Souza Optimization in Software Engineering Group (GOES) Natural and Intelligent Computation

More information

From Genetics to Genetic Algorithms

From Genetics to Genetic Algorithms From Genetics to Genetic Algorithms Solution to Optimisation Problems Using Natural Systems Jitendra R Raol and Abhijit Jalisatgi Genetic algorithms are search procedures inspired by natural selection

More information

10. Lecture Stochastic Optimization

10. Lecture Stochastic Optimization Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation

More information

A Simulation-based Multi-level Redundancy Allocation for a Multi-level System

A Simulation-based Multi-level Redundancy Allocation for a Multi-level System International Journal of Performability Engineering Vol., No. 4, July 205, pp. 357-367. RAMS Consultants Printed in India A Simulation-based Multi-level Redundancy Allocation for a Multi-level System YOUNG

More information

ISSN Vol.07,Issue.16, November-2015, Pages:

ISSN Vol.07,Issue.16, November-2015, Pages: ISSN 2348 2370 Vol.07,Issue.16, November-2015, Pages:3181-3185 www.ijatir.org Improvement of Power Quality in A Grid Connected Induction Generator Based Wind Farm using Static Compensator K. YOSHMA 1,

More information

Analyzing the Diverse Impacts of Conventional Distributed Energy Resources on Distribution System

Analyzing the Diverse Impacts of Conventional Distributed Energy Resources on Distribution System Analyzing the Diverse Impacts of Conventional Distributed Energy Resources on Distribution System Muhammad Aamir Aman 1, Sanaullah Ahmad 1, Azzam ul Asar 2, Babar Noor 1 1 Electrical Engineering Department,

More information

A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator

A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators

More information

Optimal Placement of A Heat Pump in An Integrated Power and Heat Energy System

Optimal Placement of A Heat Pump in An Integrated Power and Heat Energy System 2017 Ninth Annual IEEE Green Technologies Conference Optimal Placement of A Heat Pump in An Integrated Power and Heat Energy System Sergey Klyapovskiy, Shi You, Henrik W. Bindner, Hanmin Cai Center for

More information

Evolutionary Computation

Evolutionary Computation Evolutionary Computation Evolution and Intelligent Besides learning ability, intelligence can also be defined as the capability of a system to adapt its behaviour to ever changing environment. Evolutionary

More information

MINIMISATION OF LOSSES AND COST IN A DEREGULATED POWER SYSTEM USING PARTICLE SWARM OPTIMIZATION

MINIMISATION OF LOSSES AND COST IN A DEREGULATED POWER SYSTEM USING PARTICLE SWARM OPTIMIZATION International Journal of Electrical and Electronics Engineering Research (IJEEER) ISSN 2250-155X Vol. 3, Issue 4, Oct 2013, 107-116 TJPRC Pvt. Ltd. MINIMISATION OF LOSSES AND COST IN A DEREGULATED POWER

More information

DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION

DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION From the SelectedWorks of Liana Napalkova May, 2008 DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION Galina Merkuryeva Liana Napalkova

More information

Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3

Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3 Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3 1,2,3 Y. S. R Engineering College, Yogi Vemana University Korrapad Road, Proddatur 516360, India 1 shaikfaroq@gmail.com,

More information

Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen

Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen INF3490 - Biologically inspired computing Lecture 3: Eiben and Smith, chapter 5-6 Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen Repetition: General scheme of

More information

WIND TURBINES IN WEAK GRIDS CONSTRAINTS AND SOLUTIONS. J O G Tande and K Uhlen. SINTEF Energy Research, Norway SUMMARY

WIND TURBINES IN WEAK GRIDS CONSTRAINTS AND SOLUTIONS. J O G Tande and K Uhlen. SINTEF Energy Research, Norway SUMMARY WIND TURBINES IN WEAK GRIDS CONSTRAINTS AND SOLUTIONS J O G Tande and K Uhlen SINTEF Energy Research, Norway SUMMARY Cost efficient utilisation of the wind energy resource requires wind farms to be located

More information

Genetic Algorithm: An Optimization Technique Concept

Genetic Algorithm: An Optimization Technique Concept Genetic Algorithm: An Optimization Technique Concept 1 Uma Anand, 2 Chain Singh 1 Student M.Tech (3 rd sem) Department of Computer Science Engineering Dronacharya College of Engineering, Gurgaon-123506,

More information

Voltage Stability Assessment of a Power System Incorporating Wind Turbine Using Power System Analysis Toolbox (Psat)

Voltage Stability Assessment of a Power System Incorporating Wind Turbine Using Power System Analysis Toolbox (Psat) IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 9, Issue 2 Ver. VI (Mar Apr. 2014), PP 19-25 Voltage Stability Assessment of a Power System

More information

DETERMINATION OF PRICE OF REACTIVE POWER SERVICES IN DEREGULATED ELECTRICITY MARKET USING PARTICLE SWARM OPTIMIZATION

DETERMINATION OF PRICE OF REACTIVE POWER SERVICES IN DEREGULATED ELECTRICITY MARKET USING PARTICLE SWARM OPTIMIZATION DETERMINATION OF PRICE OF REACTIVE POWER SERVICES IN DEREGULATED ELECTRICITY MARKET USING PARTICLE SWARM OPTIMIZATION PUJA S. KATE M.E Power System P.V.G s C.O.E.T, Pune-9,India. Puja_kate@rediffmail.com

More information

Distributed Generation Penetration Impact on Distribution Networks Loss

Distributed Generation Penetration Impact on Distribution Networks Loss International Conference on Renewable Energies and Power Quality (ICREPQ 13) Bilbao (Spain), 20 th to 22 th March, 2013 Renewable Energy and Power Quality Journal (RE&PQJ) ISSN 2172-038 X, No.11, March

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications Machine Learning: Algorithms and Applications Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2011-2012 Lecture 4: 19 th March 2012 Evolutionary computing These

More information

Optimal Capacity and Placement of Battery Energy Storage Systems for Integrating Renewable Energy Sources in Distribution System

Optimal Capacity and Placement of Battery Energy Storage Systems for Integrating Renewable Energy Sources in Distribution System Optimal Capacity and Placement of Battery Energy Storage Systems for Integrating Renewable Energy Sources in Distribution System Srinivas Bhaskar Karanki Member, IEEE, School of Electrical Sciences, IIT

More information

initial set of random solutions called population satisfying boundary and/or system

initial set of random solutions called population satisfying boundary and/or system CHAPTER 4 Genetic Algorithm GAs are stochastic search algorithms based on the mechanism of natural selection and natural genetics. GA, differing from conventional search techniques, start with an initial

More information

CHAPTER 3 RESEARCH METHODOLOGY

CHAPTER 3 RESEARCH METHODOLOGY 72 CHAPTER 3 RESEARCH METHODOLOGY Inventory management is considered to be an important field in Supply chain management. Once the efficient and effective management of inventory is carried out throughout

More information

Genetic Algorithms for Optimizations

Genetic Algorithms for Optimizations Genetic Algorithms for Optimizations 1. Introduction Genetic Algorithms (GAs) are developed to mimic some of the processes observed in natural evolution. GAs use the concept of Darwin's theory of evolution

More information

A MULTI-OBJECTIVE ASSESSMENT OF THE FUTURE POTENTIAL OF THE SHETLAND ISLES ACTIVE NETWORK MANAGEMENT SCHEME

A MULTI-OBJECTIVE ASSESSMENT OF THE FUTURE POTENTIAL OF THE SHETLAND ISLES ACTIVE NETWORK MANAGEMENT SCHEME A MULTI-OBJECTIVE ASSESSMENT OF THE FUTURE POTENTIAL OF THE SHETLAND ISLES ACTIVE NETWORK MANAGEMENT SCHEME Malcolm BARNACLE Simon GILL Michael J. DOLAN University of Strathclyde Scotland University of

More information

Presentation: Optimal Planning of Renewable Energy Sources Integration in Smart Distribution Networks. GCC-Cigre. By Sultan S. Alkaabi, 9 th May 2017

Presentation: Optimal Planning of Renewable Energy Sources Integration in Smart Distribution Networks. GCC-Cigre. By Sultan S. Alkaabi, 9 th May 2017 Presentation: Optimal Planning of Renewable Energy Sources Integration in Smart Distribution Networks GCC-Cigre By Sultan S. Alkaabi, 9 th May 2017 1 Presentation Preview Introduction: Renewable Energy

More information

Chronological Simulation of the Interaction between Intermittent Generation and Distribution Network. G.N. Taranto C.C.O. Hincapié

Chronological Simulation of the Interaction between Intermittent Generation and Distribution Network. G.N. Taranto C.C.O. Hincapié Chronological Simulation of the Interaction between Intermittent Generation and Distribution Network D.M. Falcão G.N. Taranto C.C.O. Hincapié Scenario and Motivation Growing presence of intermittent energy

More information

Keywords Genetic Algorithm (GA), Evolutionary, Representation, Binary, Floating Point, Operator

Keywords Genetic Algorithm (GA), Evolutionary, Representation, Binary, Floating Point, Operator Volume 5, Issue 4, 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Review on Genetic

More information

Evolutionary Computation. Lecture 3. Evolutionary Computation. X 2 example: crossover. x 2 example: selection

Evolutionary Computation. Lecture 3. Evolutionary Computation. X 2 example: crossover. x 2 example: selection Evolutionary Computation Lecture 3 Evolutionary Computation CIS 412 Artificial Intelligence Umass, Dartmouth Stochastic search (or problem solving) techniques that mimic the metaphor of natural biological

More information

Fixed vs. Self-Adaptive Crossover-First Differential Evolution

Fixed vs. Self-Adaptive Crossover-First Differential Evolution Applied Mathematical Sciences, Vol. 10, 2016, no. 32, 1603-1610 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6377 Fixed vs. Self-Adaptive Crossover-First Differential Evolution Jason

More information

The Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment

The Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci

More information

Case Study of line loss Reduction in TNEB Power Grid

Case Study of line loss Reduction in TNEB Power Grid TELKOMNIKA Indonesian Journal of Electrical Engineering Vol. 12, No. 8, August 2014, pp. 5847 ~ 5853 DOI: 10.11591/telkomnika.v12i8.6105 5847 Case Study of line loss Reduction in TNEB Power Grid S.Sambath*

More information

Parameter identification in the activated sludge process

Parameter identification in the activated sludge process Parameter identification in the activated sludge process Päivi Holck, Aki Sorsa and Kauko Leiviskä Control Engineering Laboratory, University of Oulu P.O.Box 4300, 90014 Oulun yliopisto, Finland e-mail:

More information

Genetic Algorithms and Genetic Programming Lecture 13

Genetic Algorithms and Genetic Programming Lecture 13 Genetic Algorithms and Genetic Programming Lecture 13 Gillian Hayes 10th November 2008 Pragmatics of GA Design 1 Selection methods Crossover Mutation Population model and elitism Spatial separation Maintaining

More information

IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM

IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization

More information

A Short-Term Bus Load Forecasting System

A Short-Term Bus Load Forecasting System 2 th International Conference on Hybrid Intelligent Systems A Short-Term Bus Load Forecasting System Ricardo Menezes Salgado Institute of Exact Sciences Federal University of Alfenase Alfenas-MG, Brazil

More information

Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms Fall 2008 1 Introduction Evolutionary algorithms (or EAs) are tools for solving complex problems. They were originally developed for engineering and chemistry problems. Much of

More information

Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data

Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University

More information

Distribution System Reliability: An Overview

Distribution System Reliability: An Overview Distribution System Reliability: An Overview P. M. Sonwane K.K. Wagh Institute of Engineering Education and Research, Nashik 422 003, India. B. E. Kushare Power Quality Consultant, Energy Auditor, Professor

More information

COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM

COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM 1 MANSI GANGWAR, 2 MAIYA DIN, 3 V. K. JHA 1 Information Security, 3 Associate Professor, 1,3 Dept of CSE, Birla Institute of Technology, Mesra

More information

Deterministic Crowding, Recombination And Self-Similarity

Deterministic Crowding, Recombination And Self-Similarity Deterministic Crowding, Recombination And Self-Similarity Bo Yuan School of Information Technology and Electrical Engineering The University of Queensland Brisbane, Queensland 4072 Australia E-mail: s4002283@student.uq.edu.au

More information

Supply Chain Network Design under Uncertainty

Supply Chain Network Design under Uncertainty Proceedings of the 11th Annual Conference of Asia Pacific Decision Sciences Institute Hong Kong, June 14-18, 2006, pp. 526-529. Supply Chain Network Design under Uncertainty Xiaoyu Ji 1 Xiande Zhao 2 1

More information