ECONOMIC LOAD DISPATCH USING GENETIC ALGORITHM A.Sivagami#1, M.

Rathinakumar#2 Department of Electrical and Electronics Engineering SCSVMV University, Kanchipuram, Tamilnadu, India [email protected], [email protected] ABSTRACT: A simple method to optimize generation scheduling for thermal power plant using genetic algorithm is presented. The optimal generation of generators is achieved considering operational and load constraints. The B- Coefficients are used to evaluate transmission loss in the system. The fuel cost of each unit in a plant is computed. The effectiveness of methodology is tested with three thermal power plants. Genetic algorithms are adaptive search methods that simulate some of the natural processes: selection, information, inheritance, random mutation and population dynamics. This approach was tested for three thermal plant systems. The performance of Genetic Algorithm - intelligent approach (GAs) is observed that this method is accurate and may replace effectively the conventional practices presently performed in different central load dispatch centers. INTRODUCTION: Economic load dispatch (ELD) is a sub problem of the optimal power flow (OPF) having the objective of fuel cost minimization. The classical solutions for ELD problems have used equal incremental cost criterion for the loss-less system and use of penalty factors for considering the system losses. The lambda-iterative method has been used for ELD. Many other methods such as gradient methods, Newtons methods, linear and quadratic programming, etc have also been applied to the solution of ELD problems. However, all these methods are based

on assumption of continuity and differentiability of cost functions. Hence, the cost functions have been approximated in the differentiable form, mostly in the quadratic form. Further, these methods also suffer on two main counts. One is their inability to provide global optimal solution and getting stuck at local optima. The second problem is handling the integer or discrete variables. Genetic algorithms (GAs) have been proved to be effective and quite robust in solving the optimization problems. GAs can provide near global solutions and can also handle effectively the discrete control variables. GAs does not stick into local optima because GAs begins with many initial points and search for the most optimum in parallel. GAs considers only the pay-off information of objective function regardless whether it is differentiable or continuous. Consequently, the most realistic cost characteristic of power plants can be formulated. Discontinuity and non-differentiability of cost charecteristics can be effectively handled by GAs. This paper proposes the application of GAs to solve the economic load dispatch for three thermal plant systems and the results are compared with conventional method. CLASSIC ECONOMIC LOAD DISPATCH PROBLEM The objective of the ELD problem is to minimize the total fuel cost at thermal plants Fi=aiPGi2+biPGi+ciRs/hr i=1,2.n Where ai is a measure of losses in the system, bi is the fuel cost and ci is the salary and wages, interest and depreciation. The optimal dispatches for the thermal power plants should be such that the load demands plus line losses, which can be written as: n PGi PL PD = 0
i=1

Where, N= Total number of generating plants. PGi= Generation of ith plant. PL= Total system transmission loss. PD= System load demand The transmission losses which occur in the line when power is transferred from the generating station to the load centers increases in distance between the two. The transmission losses may vary from 5 to 13 % of the total load. If the power factor of load at each bus is assumed to remain constant the system loss PL can be shown to be a function of active power generation at each plants i.e. PL = (PG1, PG2, PG3,....PGN) One of the most important, simple but approximate method of expressing transmission loss as a function of generator power is through B- Coefficients as, n n PL= PGi Bi PGj= 0 i=1 j=1 where, PGi,& PGj are real power generation at ith and jth power unit. Bij is loss coefficients. The inequality constraints is given by PGmin PGi PGmax

The maximum active power generation PGMax of source is limited by thermal consideration and minimum active power generation PGMin is limited by the flame instability of a boiler.

GENETIC ALGORITHMS GAs is inspired from phenomena found in living nature. The phenomena incorporated so far in GA models include phenomena of natural selection as there are selection and the production of variation by means of recombination and mutation, and rarely inversion, diploid and others. Most genetic algorithms work with one large panmictic population, i.e, in the recombination step each individual may potentially choose any other individual from the population as a mate. Then GA operators are performed to obtain the new child offspring.

Brief Description of GAs Operators: There are three important GA operators which are commonly used are as follows: (i) (ii) (iii) Crossover The task of crossover is the creation of new individuals of the current population. An individual can be viewed on chromosome level as Cj = (cj1,cj2,cj3.......cjn). The child chromosome Ck = ((c1,c1),(c2,c2),..(cn,cn)) is created by recombination of its parent chromosomes pi = (c1,c2,c3,..,cn) and Pj = (c1,c2,..,cn). The recombination operation (ci,ci) is the projection to the first on second component of the parameter list, namely, P1 = ( 0 0 1 0 : 1 1 0 ) and P2 = (1 0 1 1 : 0 0 1), crossover, Mutation, and Selection.

The child strings can be obtained after the recombination or crossover are C1 = ( 0 0 1 1 : 0 0 1 ) and C2 = (1 0 1 0 : 1 1 0). Start

Create initial random population

Evaluate fitness for each population

Store best individual

Creating mating pool

Create next generation by applying crossover

Optimal or good solution

Stop Reproduce and ignore few populations

Perform mutation Basic structure of GA Basic structure of GA

Mutation Mutation is the important operator, because newly created individuals have no new inheritance information and the number of alleles is constantly decreasing. This process results in contraction of the population to one point, which is only wished at the end of the population to one point, which is only wished at the end of the convergence process, after the population works in a very promising part of the search space. Diversity is necessary to search a big part of the search space. It is on goal of the learning algorithm to search always in regions not viewed before. Therefore, it is necessary to enlarge the information contained in the population. One way to achieve this goal is mutation. The mutation operator M (chromosome) selects a gene of that chromosome and changes the allele by an amount m, the mutation variance. This happens with a mutation frequency m. the parameter m and m have major influence of the quality of the learning algorithm. Mutation can be illustrated with the help of an example, Let a string is P1 (0 0 1 0 1 0 0) after the mutation at the second position p1=(0110100) selection In the implementation of genetic algorithm, the best individuals using roulette wheel with slot sized according to fitness is selected, so that the probability of selection of best strings are more. Further more , one only accept an offspring as a new member of the population, if it differs enough from the other individuals , at least by some significant amount . After accepting a new individual, one of the worst individuals is removed,i.e. its fitness value is quite low from the population in order to hold the population size constant. In the present implementation the worst fit individual is removed because the algorithm is not sensible against this selection. The complete genetic algorithm is represented with the help of the flow chart as shown in Fig.2

To maximize the efficiency of GAs, the three inherent parameters of GAs are to be optimized, the mutation probability Pm,crossover probability Pc and the population size POPSIZE.

APPLICATION OF GAs TO ECONOMIC LOAD DISPATCH PROBLEM ENCODING AND DECODING Encoding is a process of coding a problem as a number of finite strings. It typically utilizes the binary alphabet {0,1}. The types of encoding schemes have been developed by researches, which are called series encoding and embedded encoding. The series encoding simply stacks each units output value structure in series with each other in the string. Each units output gene structure is assigned the same number of loci with in the string. The embedded encoding scheme uses the same systems for representation and decoding as the first, except the assigned gene structures are embedded with in each other through out the string. The string is made up of a series of smaller gene structures, each containing one gene locus for each unit. It has been reported that series encoding can provide a better ED solution. In this paper a binary series coding is used through out all the GAs. Decoding a binary string into an unsigned integer can play very important roles in GA implementation. The inequality power limit constraint is performed in such a way that the individual string is normalized over the units operating region. The inequality constraints are handled in this manner, which efficiently reduces the searching space, and thus enhances the performance of the system. The decoding method is formulated in Eq. (8). Value = bit 0 X x 20 + bit 1 X x 21++ bit i X x 2 i + + Bit chrom-length X x 2 chrom-length

If the optimized parameter belongs to (Pimax Pimin) decoding value of the parameter in computer by Eq. (9). [ value X (Pimax Pimin) ] Pi = Pimin +------------------------------2 chrom-length 1 Objective and Fitness Function Formulation In the ED problem, the goal is to minimize the objective function
n

Ft = Fi (Pi)
i=1

with the constraint of equality

Pi PL PD = 0
i=1

is changed to constraint optimization problem and thus forming fitness function.

Fct = Ft + PF [ Pi PL PD ]
i=1

Where PF is penalty factor. The penalty function is placed into the objective function in such a way that it penalizes any violation of constraints and forces that unconstrained optima towards the feasible region. In the ELD problem the goal is to minimize the objective function

FCT,while the objective when using GAs is to maximize a fitness function. It is therefore necessary to map the fitness function FCT in the given form.

Ftt = EXP [ - (K1* Fct) K2 ]

K1 and K2 are constants and the value is problem dependent. Considerin the evolutionary process of the GAs, the solution is improved through the generations and also to decrease the penalty function over the successive iterations can be adapted with the penalty function varying directly with the number of generations. This ensures that only the objective function is ultimately minimized with a feasible solution. SIMULATION RESULTS AND PERFORMANCE To focus on the evaluation of the proposed GA, a three-unit power system is used. F1 = 0.00156 X P12 + 7.92 X P1 + 561 Rs/hr F2 = 0.00194 X P22 + 7.85 X P2 + 310 Rs/hr F3 = 0.00482 X P32 + 7.97 X P3 + 78 Rs/hr

0.0000050 Bmn = 0.0000050 0.0000075

0.000005 0.000015 0.000010

0.0000075 0.0000100 0.0000450

The total operating ranges for this example are 100 MW < P1 < 600 MW 100 MW < P2 < 400 MW 50 MW < P3 < 200 MW

The parameters used in GA are as follows Population size Sub-Chromosome lengths Mutation Probability 2 13,12,11 0.01 Chromosome length Crossover probability 500 0.5

Total load Pd 812.57 585.33 869.00 PG1 314.381 243.450 355.524

GA PG2 383.003 257.655 395.091 PG3 128.334 91.475 134.196 PL 13.146 7.250 15.812 Cost(Rs/hr) 7986.069 5890.0947 8122.852

10

Genetic algorithm claims to provide near optimal or optimal solution for computationally intensive problems. Therefore the effectiveness of genetic algorithm solutions should always be evaluated by C Language was tested for three thermal plant systems. The performance of Genetic Algorithmic approach (GAs) is observed that this method is accurate and may replace

effectively in the conventional practices presently performed in different central load dispatch centres.

11

CONCLUSION This paper has attempted to solve economic load dispatch problem of the power system networks The results are obtained for three thermal plant systems. Future Scope This method can be extended to one plant as combined cycle cogeneration plant in multi thermal plant system. REFERENCES [1] A J Wood and B F Wollenburg power generation operation and control. John wiley and sons, 1984. [2] D E Goldberg and J H Holland , Genetic Algorithms in search optimization and Machine Learning Addison Wesley,1989. [3] Z Michealewicz Genetic Algorithms + Data structure=Evolution Programs Springer verlag,Berlin,Heidelberg,Newyork,1992. [4] Y H Song and C S V Chov.Advanced Engineered conditioning Genetic Approach to Power Economic Dispatch. IEE ProceedingsGeneration Transmission and Distribution,vol 144, no 3,May1997,p285. [5] D. E. Goldberg, Genetic algorithm in search, Optimization and Machine Learning, (Addision-Wesley, 1989) [6] D.P.Kothari and K.P.SinghParmar, A Noval Approach for Eco-friendly and Economic Power Dispatch using MATLAB,2006 [7] G. B. Sheble, K. Britting, Refined genetic algorithm-economic dispatch example, IEEE Trans. Power Syst. 10 (1) (1995), 117-124 [8] G. B. Sheble, T. T. Maifield, K. Brittig, G. Fahd, S. Fukurozaki-Coppinger, Unit commitment by genetic algorithm with penalty methods and a comparison of lagrangian search and genetic algorithm economic dispatch example, Electr. Power Energy Syst.18 (6) (1996), 339-346 [9] He Da-Kuo, Wang Fu-Li, Mao Zhi-zhong, Hybrid genetic algorithm for economic dispatch with valve-point , Electric PowerSystems Research 78(2008) 626-633 [10] J. B. Park, Y. M. Park, J. R. Won, K. Y. Lee, An improved genetic algorithm for generation expansion planning, IEEE Trans.Power Syst.15 (3) (1992), 544-589

12

[11]

J. R. Wona, Y. M. Park, Economic dispatch solution with piecewise quadratic cost function using improved genetic, Electr.Power Energy Syst. 25 (5) (2003), 355-361

[12]

Lin CE, VivianiGL.Hierarchical economic dispatch for piece-wise quadratic cost function, IEEE Trans PAS 1984, PAS-103 C. T. Su, C. T. Lin, New approach with a Hopfield modelling framework to economic dispatch, IEEE Trans. Power Systems, 15 (2000), 541-545

[13]

M. Vanitha, K. Thanushkodi, An efficient Technique for solving the Economic Dispatch problem using Biogeography Algorithm, European Journal of Scientific Reaearch.vol.50 No.2(2011),pp.165-172

[14]

N. Sinha, R. chakrabarti, P. K. Chhattopadhyay, Evolutionary programming techniques for economic load dispatch, IEEETrans. Evol. Comput. 7 (1) (2003), 83-94.

[15]

R. Naresh, J. Dubey, J. Sharma, Two-phase neural network based modelling framework of constrained economic load dispatch,IEEE Proc. Gen. Trans. and Distrib. 151 (2004), 373-378

[16]

S. Hemamalini and S. P. Simon, Emission constrained economic dispatch with valve point loading effect using particle swarm optimization , IEEE Region 10 conference TENCON 2008, pp.1-6, 2008.

13