You are on page 1of 5

AbstractEconomic Load Dispatch is a great concern of interest for researchers for ove r 30 years.

Several research efforts have been made to improve its formulation a nd adopt efficient solution techniques. Economic load dispatch is an art of allocating the generation among the committe d units at a station bus, which has to a deliver real power to the particular lo ad. Optimal operation of Generator on a bus bar is one such problem, which is vi tal when one talks about Economic Load Dispatch. A method which has proved to be an asset when one is concerned with optimization problems is Genetic Algorithm. Several other methods such as the likes of Ant C olony Optimization (ACO), Genetic programming (GP), Simulated Annealing (SA), an d Particle Swarm Optimization (PSO), have been used and tried, but none could gi ve the results as fast and as accurately as Genetic Algorithm. A striking difference between Genetic Algorithm and most of traditional optimiza tion methods is that Genetic Algorithm uses a population of points at one time i n contrast to the single point approach by traditional optimization methods. A genetic algorithm is a search technique used in computing to find true or appr oximate solution to optimization and search problems. In this project, a programs has been developed in C for the Optimization of Gene ration of power using the search technique called Genetic Algorithm. The program runs satisfactorily for a four Generator Set Power System each feeding the load independently and the Incremental Cost, the Operating Cost and individual Load Sharing has been found accurately. We have tested the program with a solved problem taken from the book written by I.J. Nagrath- D.P. kothari, titled Modern Power System Analysis [1]. Introduction GENERAL POWER SYSTEM: The system consisting of generating stations, transmission lines and distribution system which provide continuous & reliable electrical energy Is called power system. Power generation optimizations provide the information about exact loading of generators having different fixed & variable cost [1]. The study and analysis of power system is a great concern for todays world due to increasing complexities and size of power system all over the world. A power sy stem engineer should always concern in adapting better mathematical models for s olving system problem more efficiently and effectively. Optimal operation of the generators on a bus bar is one such problem, which is vital for all power syste m. POWER SYSTEM OPTIMISATION Optimisation in power system generally shows the problem of economics which is t he cost of generating real power. The purpose of economic operation of power sys tem is to reduce fuel cost for the operation of the power system. Economic opera tion is achieved when the generators in a system share load to minimise overall generation cost. The main economic factor in power system operation is the cost of generating rea l power in any power system this cost has got two components FIXED COST: determine by the capital investment, interest charge on borr owed money, taxes paid labour charge etc. VARIABLE COST: a function of loading of generating units, losses, daily load requirements etc. ECONOMIC DISPATCH Economic load dispatch is an art of allocating the generation among the committe d units at a station bus, which has to deliver real power to the particular load . While solving this problem, it is necessary to consider the types of generator units, their characteristics, and generation costs per unit. Input to the unit is the fuel consumed at specific rate of unit. The output of the unit is the ele ctrical power generated by that unit. If it is assumed that the load Pr is suppl ied at the bus bar directly and transmission network losses are neglected the pr oblem can be solved while incremental cost of each generating unit will be equal .

Mathematically it is given as dCi/dPGi = where = Incremental cost of the unit. Among these methods, the classical lambda iteration method has been in use for l ong time. It has been in many software packages and used by power utilities for ED. The convergence of the iteration is affected by the initial choice of lambda . Two types of iteration are involved in this method. First lambda moves from its initial assumed value to its final optimal value iteratively. For system with ma ny generators, this movements may can be oscillatory and may increase the comput ation time. Secondly, for each trial value of lambda, the associated generations have to be obtain using subiterations. Thus subiteration have to be involved ma ny times. Therefore this method becomes very time consuming for effective real t ime implementation. GENETIC ALGORITHM: A genetic algorithm is a search technique used in computing to find true or appr oximate solutions to optimization and search problems. It is a method of simulat ing the action of evolution within a computer[4]. A population of fixed length is evolved with GA by employing crossover and mutat ion operators along with a fitness that determines how likely individuals are to reproduce[2]. Genetic Algorithm are useful in maximizing or minimizing an objective function w ithin a set of constraints. These are especially applicable when the relationshi ps are non-linear or discontinuous [2]-[4]. Genetic Algorithms find application in engineering, physics, mathematics and oth er fields. The evolution usually starts from a population of randomly generated individuals and happens in generations. In Each individual in the population is evaluated, multiple individuals are selecte d from the current population based on their fitness and modified or mutated to from a new population. The new population is then used in the next iteration of the algorithm [2-4]. Genetic Algorithm are very different from most of the traditional optimization m ethods. Genetic Algorithms need design space to be converted in to genetic spac e. So, Genetic Algorithms work with a coding of variables. The advantages of wor king with a coding of variable space is that coding discretizes the search spac e even though the function may be continuous [2]. A more striking difference between Genetic Algorithms and most of the tradition al optimization methods is that Genetic Algorithm uses a population of points at one time in contrast to the single point approach by traditional optimization m ethods. This means that Genetic Algorithm processes a number of designs at the s ame time [2]. Three most important aspects of using Genetic Algorithm are [2]: Definition of objective function. Definition and implementation of genetic representation. Definition and implementation of genetic operators. POWER GENERATION OPTIMIZATION AND GENETIC ALGORITHM: The Genetic Algorithm is a search procedure that uses random search as a tool to guide a highly exploitative search though a coding of parameters and is guided search, hence it offers advantages over other conventional optimization and sear ch procedure [2,4].Since Economic Load Dispatch problem is complicated, and uses a large and complex search space, hence genetic Algorithm is suitable for findi ng the optimum generation loadings. ECONOMIC LOAD DISPATCH INTRODUCTION: The system consisting of generating stations, transmissions lines and distributi

on system which provide continuous and reliable electrical energy is called powe r system. Power generation optimizations provide the information about the exact loading of generators when there are no of generators having different fixed & variable cost [1]. Generally we use load flow method in which two variable are specified at each b us and solution is then obtained for remaining variables . the additional variab le specified at each for load flow solution are tap changing of regulating trans former . if the specified variable are allowed to vary in a region constraints b y practical consideration (I.e upper and lower limit of active & reactive compon ents of generators, bus voltage etc.) these results an infinite number of load f low solution each pertaining to one set of specified variables [1,3]. The best choice in some sense of specified variables leads to the best load flow solution. Operating economy is naturally predominant in determining the best ch oices; through there are others factors that should be given consideration. Mod ern power systems are very large and complex so to find the best values of speci fied variable is a very difficult task. So, analytical methods are used to deter mine the best operating strategy in power system to provide economic and in other words optimal loading. The optimal loading o f power system must ensure minimum standards of reliability and continuity of su pply. The main economic factor in power system operation is the cost of generating rea l power at generator buses. This problem can be partitioned in to two substation viz. optimum allocation of generation to each generating station for various lo ad levels. Optimal Operation Of generators On a Bus Bar: Generating Operating cost: The major component of generator operating cost is fuel input/hour while mainten ance contributes only a little bit.The fule cost is meaningful is case of therma l is case of thermal and nuclear stations,but for hydro station is not meaningfu l. The input-output curve of a unit can be expressed in million kilowatts per hour or directly in terms of rupees per hour versus output in megawatts.A typical cur ve is shown,(MW)max is maximum is limit.By fitting a substitute degree of polyno mial,an analytical expression for operating cost may be written as, Ci(PGi) Rs/hour at output PGI where i=1,2,3.. Ci=aiPG2I+biPGi+di Rs/hour Operating cost

Power System(MW) Fig. input output cost curve of generator The slop of cost curve i.e.dCi/dPGI is called the incremental fuel cost(IC) and expressing in units of rupees per megawatts hour(Rs/MWh). Linear appx.

Total power Incremental cost curve A typical plot of incremental fuel cost versus power output is shown in figure. If the cost curve is approximated as(IC)I= aiPGi+bi It is a linear relationship. For better accuracy incremental fuel cost may be ex pressed by a number of line segments. Alternatively, we can fit a polynomial of

suitable degree to represent IC curve in inverse form[1]. PGi=ai+bi(IC)i+ci(IC)i+. OPTIMAL OPERATION: Let us assume that it is known a prior which generators are to run station,so PGimaxPD) (1) Where PGimax is rated real power capacity of ith generator and PDi is the total power demand on the station. Further the load on each generator to be constraine d with in lower and upper limit i.e. PGiminPGiPGimax, i=1,2,3..k (2) Since the operating cost is insensitive to reactive loading of generator, the ma nner in which the reactive load station is shared along various on line generato r does not affect operating economy. The question that has now been answered is: what is the optimal manner in which the load demand PD must be shared by minimising the operating cost. C=Ci(PGi) ..(3) Under the equality constraints of meeting the demand PGi PD = 0 ..(4) Where k= total number of generators is constraint by the inequality constraint o f equation (2). Since Ci(PGi) is nonlinear and Ci is independent of PGj(ji), this is a seperable non-linear programming problem.If it is assumed at present, that inequality cons traint of equation (1) is not effective problem can be solved by method of Lagra nge multiplier as =Ci(PGi)-(PGi-PD) ..(5) Minimizing is achieved by condition d /dPGi=0 Or dCI/dPGi= I=1,2,3.k ..(6) Where dCi/dPGi is the incremental cost of ith generator units a function of gene rator loading PGi dC1/dPG1=dC2/dPG2=.dCk/dPGk= ..(7) i.e. the optimal loading of the generator corresponds to the equal increment cos t point of all the generators equation (7) is called the Coordination Equation numbering k are solved simultaneously with t he load demand equation to yield a solution for the Lagrange multiplier and the optimal loading of kth generator[1] GENETIC ALGORITHM INRODUCTION: A genetic algorithm is a search technique used in computing to find true or appr oximate solutions to optimization and search problems. It is a method of simulat ing the action of evolution within a computer [4]. A population of fixed length is evolved with GA by employing crossover and mutat ion operators along with a fitness function that determines how likely the indiv iduals are to reproduce [2]. Genetic Algorithm are useful in maximizing or minimizing an objective function w ithin a set of constraints. These are especially applicable when the relationsh ips are non-linear or discontinuous or contain many local minima [2-4,7]. Genetic Algorithms find application in engineering, physics, mathematics and oth er fields. The evolution usually starts from a population of randomly generated individuals and happens in generations. In each generation, the fitness of every individual in the population is evaluated;

You might also like