European Scientific Journal

UDC:519.862:510.644.4]:621.311.22

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

FUZZY LOGIC CONTROLLED GENETIC ALGORITHM TO SOLVE THE ECONOMIC LOAD DISPATCH FOR THERMAL POWER STATION
K.Rajangam, PhD1
Reserch Scholar -Anna University of Technology, Coimbatore Professor and Head, Department of Electrical and Electronics Engineering, Sasurie Academy of Engineering

V. P. Arunachalam, PhD2
Principal, SNS college of Technology

R. Subramanian, PhD3
Professor and Head of the Department of Electrical and Electronics Engineering, SNS college of Technology

Abstract This paper presents a Fuzzy Logic Controlled Genetic Algorithm approach to solve the Economic Load Dispatch (ELD) problem. The ELD problem in a power system is to determine the optimal combination of power outputs for all generating units which will minimize the total fuel cost while satisfying all practical constraints. Gathering data from a list of strict priority order the Genetic Algorithm generates different candidate solutions to the problem, whereas Fuzzy Logic Control guides the whole search process under an uncertain environment. A system consisting of 3 and 10 generating units is presented to demonstrate application of the proposed Algorithm to the Economic Load Dispatch (ELD) problem. Keywords:Economic Load Dispatch (ELD), Fuzzy Logic Controlled Genetic Algorithms (FLCGA), Lambda Iteration Method (LIM), Genetic Algorithms (GA)

172

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Introduction The ELD problem in a power system is to determine the optimal combination of power outputs for all generating units which will minimize the total fuel cost while satisfying all practical constraints. To solve the problem of ELD there are many methods (traditional) like Lambda Iterative Method (LIM), Newtons Linear Programming etc. But all those methods are based on the assumption of continuity and differentiability of cost function. Practically, the real power limits of the generators vary between minimum and maximum limits. Hence the optimization of real time ELD problem becomes more non-linear. In this, fuzzy logic has been applied in combination with Genetic Algorithm (GA) to solve various power system problems. For smooth and better convergence in GA, the crossover probability and mutation rate are adjusted by fuzzy logic strategy leading to an improved GA technique termed as Fuzzy Logic Controlled Genetic Algorithm (FLCGA). The proposed FLCGA can be applied to a wide range of optimization problem. The computational results reveal that the proposed algorithm has excellent convergence characteristics and is superior to the GA and LIM. The first is Unit Commitment or pre-dispatch problem where in it is required to select optimally out of the available generating sources to operate to meet the expected load and provide a specified margin of operating reserve over a specified period of time. The second aspect of ELD is on-line economic dispatch where in it is required to distribute the load among the generating units actually parallel with the system in such a manner as to minimize the total cost of supplying power. In case of ELD, The generations are not fixed but they are allowed to take values again within certain limits so as to meet a particular load demand with minimum fuel consumption. The efficient and optimum economic operation of electric power systems has always occupied an important position in electric power industry. In recent decades, it is becoming very important for utilities to run their power systems with minimum cost while satisfying their customer demand all the time and trying to make profit. With limited availability of generating units and the large increase in power demand, fuel cost and supply limitation, the committed units should serve the expected load demand with the changes in fuel cost and the uncertainties in the load demand forecast in all the different time intervals in an optimal manner. The basic objective of ELD of electric power generation is to schedule the committed generating unit outputs, so as to meet the load demand at minimum operating cost while satisfying all unit and system equality and inequality constraints. The ELD problem has been tackled by many researchers in the past . ELD problem involves
173

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

different problems. The first is Unit Commitment or pre-dispatch problem where in it is required to select optimally out of the available generating sources to operate to meet the expected load and provide a specified margin of operating reserve over a specified period of time. The second aspect of ELD is on-line economic dispatch where in it is required to distribute the load among the generating units actually parallel with the system in such a manner as to minimize the total cost of supplying power. In case of ELD, The generations are not fixed but they are allowed to take values again within certain limits so as to meet a particular load demand with minimum fuel consumption. Basic theory of ELD The efficient and optimum economic operation and planning of electric power generation systems have always occupied an important position in the electric power Industry. In the power system, transmission networks are interconnected through tie lines. Hence the utilities may interchange power, share reserve and render assistance to one another at the time of need. Since the sources of energy are so diverse, so the choice of the required sources is made on economic, technical and geographical basis. As there are few facilities to store electrical energy, the net production of a utility must clearly track its total load. The Economic Dispatch can be defined as the process of allocating generation levels to the generating units, so that the system load is supplied entirely and most economically. The objective of ELD is to minimize the overall cost of generation. Fuel cost function The components of the cost that fall under the category of dispatching procedures are the costs of the fuel burnt in the fossile plant because nuclear plants tend to be operated at constant output levels and hydro plants have essentially no variable operating costs. The total cost of operation includes the fuel cost, costs of labour, supplies and maintenance. Generally, costs of labour, supplies and maintenance are fixed percentages of incoming fuel costs. We assume that the variation of fuel cost of each generator (Fi) with the active power output (Pi) is given by a quadratic polynomial Fi(Pi)= Where, Fi = fuel cost of generator i.
174

) Rs/hr

(1)

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Pi = power output of generator i ai = measure of losses in the system. bi = represents the fuel cost. ci = includes salary and wages, interests and depreciation and is independent of generation ng = number of generation buses Genetic algorithm overview Genetic algorithms are one of the best ways to solve a problem for which little is known. They are a very general algorithm and so will work well in any search space. All that is to be known is what is needed in the solution to be able to do well, and a genetic algorithm will be able to create a high quality solution. Genetic algorithms use the principles of selection and evolution to produce several solutions to a given problem.Genetic algorithms tend to thrive in an environment in which there is a very large set of candidate solutions and in which the search space is uneven and has many hills and valleys. True, genetic algorithms will do well in any environment. They are one of the most powerful methods to quickly create high quality solutions to a problem. GAs operate on string structures. The string is binary digits representing a coding of control parameters for a given problem. The each parameter of the given problem is coded with strings of bits. The individual bit is called gene and the content of the each gene is called allele. The total string of such genes of all parameters written in a sequence is called a chromosome so there exists a chromosome for each point in the search space. Here we have to know about search space. In this approach, a GA candidate solution is represented as a linear string analogous to a biological chromosome. The general scheme of GAs starts from a population of randomly generated candidate solutions (chromosomes). Each chromosome is then evaluated and given a value which corresponds to a fitness level in objective function space. In each generation, chromosomes are chosen based on their fitness to reproduce offspring. Chromosomes with a high level of fitness are more likely to be retained while the ones with low fitness tend to be discarded. This process is called selection. After selection, offspring chromosomes are constructed from parent chromosomes using operators that resemble crossover and mutation mechanisms in evolutionary biology. The crossover operator, sometimes called recombination, produces new offspring chromosomes that inherit
175

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

information from both sides of parents by combining partial sets of elements from them. The mutation operator randomly changes elements of a chromosome with a low probability. Over multiple generations, chromosomes with higher fitness values are left based on the survival of the fittest. Search space: If we are solving some problem, we work towards the some solution which is the best among the others. The space for all possible feasible solution is called search space. A set of search points selected and used for processing is called population i.e. population is a set of chromosomes. The number of chromosome in a population is called population size and the number of genes in each string is called string length. The population is processed and evaluated through various operators of GA to generate a new population and this process is carried out till global optimum points are reached. The objective function is used to provide a measure of how individuals have performed in the problem domain. In the case of a minimization problem, the fit individual will have the lowest numerical value of the associated objective function. This raw measure of fitness is usually only used an intermediate stage in determining the relative performance of individuals in a GA. Another function, the fitness function is normally used to transform the objective function value into a measure of relative fitness, thus F(x) = g( f(x) ) Where f is the objective function, g transform the value of the objective function to a non-negative number and F is resulting relative fitness. In many cases, the number of offsprings that an individual can except to produce in the next generation. It involves nothing more than swapping of genes and string cloning. This allows GA to produce good results in circumstances which are hard to achieve through many conventional methods. The further attraction to such an algorithm is that it is extremely robust with respect to the complexity of the problem. Algorithm for ELD using GA The step-wise procedure is outlined below: 1. Read data, namely cost coefficients, ai, bi, ci, B-coefficients, Bij(i=1,2,.NG; and j=1,2,.NG), convergence tolerance, error, step size and max allowed iterations, length of (2)

176

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

string, l, population size, pc probability of cross over, pm probability of mutations, lambda min, lambda max. 2. Generate an array of random numbers. Generate the population j (j=1,2,, l) by flipping coin. The bit is set according to the coin flip as bij= 1 0

Where, p is the probability (0.5) 3. Set generation counter, k=0, BIG (min error)=0.1, fmax=0.0, and fmin=1.0 4. Increment the generation counter k=k+1 and set population counter J=0 5. Increment population counter j=j+1 6. Decode the string using yi= 8. Calculate transmission loss. 9. Find ej and check if (ej<BIG), then set BIG= ej 10. Find fitness if (fj>fmax) then set fmax = fj and if (fj<fmin) then set fmin=fj 11. If (j<l) then GOTO step 5 and repeat 12. If (BIG _ error) then GOTO step 18 13. Find population with max fitness and average fitness of the population 14. Select the parents for crossover using stochastic remainder roulette wheel Selection method. 15. Perform single point crossover for the selected parents 16. Perform mutation 17. If (k<ITmax) then GOTO step 4 and repeat 18. STOP 2 bij

7. Using gauss elimination method, find Pi

177

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Fig 1 Typical flowchart of genetic algorithm

Fuzzy logic controlled genetic algorithm This is mainly the hybrid system. Hybrid systems are those which employ integrated technologies to effectively solve problems. Hybrid systems are classified as sequential, auxiliary and embedded hybrids. Fuzzy-Genetic Hybrid system applicable on fuzzy optimization problems. The system obtains optimal solution to problems with fuzzy constraints and fuzzy variables. The hybrid systems have been demonstrated on the problems of optimization of structures (civil/machine tool) and obtain the optimal mix for high performance concrete. The optimal solution is obtained by Genetic Algorithm which crossover and mutation adjusted by fuzzy practical rules.

178

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Membership function design The variables chosen for this controller are change in average fitness (f(t)), change in average fitness in last iteration (f(t-1)), change in crossover probability (c(t)) and change in mutation probability (m(t)). In this, f(t) and f(t-1) are the input variables and c(t) is the crossover output and m(t) is the mutation output variable. The number of linguistic variables describing the fuzzy subsets of a variable varies according to the application. Usually an odd number is used. However, increasing the number of fuzzy subsets results in a corresponding increase in the number of rules. Each linguistic variable has its fuzzy membership function. The membership function maps the crisp values into fuzzy variables. The triangular membership functions are used to define the degree of membership. It is important to note that the degree of membership plays an important role in designing a fuzzy controller. Each of the input and output fuzzy variables is assigned nine linguistic fuzzy subsets varying from negative larger (NL) to positive larger (PL). Each subset is associated with a triangular membership function to form a set of nine membership functions for each fuzzy variable given in table 1 Table 1 Membership functions for fuzzy variables NL NR NM NS ZE PS PM PR PL NEGATIVE LARGER NEGATIVE LARGE NEGATIVE MEDIUM NEGATIVE SMALL ZERO POSITIVE SMALL POSITIVE MEDIUM POSITIVE LARGE POSITIVE LARGER The inputs to the crossover fuzzy logic controller are changes in fitness at two consecutive steps, i.e. f(t - l), f(t), and the output of which is change in crossover c(t).Membership functions of fuzzy input and output linguistic variables are shown in Fig 2a&2b.f(t-1), f(t) are normalised into the range of [-1.0, 1.0], and c(t) is normalised into the range of [-0.1, 0.1] according to their corresponding maximum values.

179

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Fig2a. Membership functions for f(t)

Fig2b. Membership functions for f(t-1) The mutation operation is determined by the flip function with mutation probability rate, and the mutate bit is randomly performed. The mutation probability rate is automatically modified during the optimization process based on the fuzzy logic controller. The heuristic information for adjusting the mutation probability rate is if the change in average fitness is very small in consecutive generations, then the mutation probability rate should be increased until the average fitness begins to increase in consecutive generations. If the average fitness decreases the mutation probability rate should be decreased. Only the change in output of mutation operator membership function which is shown in fig 3.

Fig2c.Membership functions for c(t)

180

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

Fig3. Membership functions for m(t) The inputs to the mutation fuzzy controller are the same as those of the crossover fuzzy controller, and the output of which is the change in mutation m(t). The designs of the membership function for both input and rules base table for the fuzzy mutation controller is similar to these for the fuzzy crossover controller. Results and discussions The results of ELD after the implementation of proposed fuzzy logic controlled genetic algorithm are discussed and compared with the GA and classical method (lambda iteration). The algorithms are implemented in MATLAB to solve ELD problem. The main objective is to minimize the cost of generation of thermal plants using FLCGA, GA and Lambda Iteration Method. The performance is evaluated with losses for two set generator data, which are referred as Problem I and Problem II Length of the string, l = 16 Population of string, pop = 10 Crossover probability, pc = 0.8 Mutation probability, pm = 0.01 Table2 ELD Result using GA for three generator test system Power P2 81.0595 83.9701 80.9535

Slno 1 2 3

Fitness 0.999414 0.977177 0.999756

Losses 10.5493 11.0533 10.5314

P1 202.56 202.013 202.434

P3 27.1071 28.0775 27.0713

Total Cost 3617.15 3696.41 3615.26

181

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

4 5 6 7 8 9 10

0.999827 0.999009 0.999734 0.999827 0.999849 0.999564 0.999957

10.5402 10.5581 10.5422 10.5402 10.5331 10.5459 10.5354

202.497 202.621 202.511 202.497 202.448 202.536 202.464

81.0063 81.1108 81.0181 81.0063 80.9649 81.0398 80.9787

27.0892 27.1244 27.0932 27.0892 27.0752 27.1005 27.0799

3615.71 3618.55 3616.03 3615.71 3614.58 3616.62 3615.95

Table3 ELD Result using FLCGA for three generator test system Sln o 1 2 3 4 5 6 7 8 9 10 Power P2 80.9767 80.9984 81.0004 81.0122 81.1265 81.0004 81.0063 81.1246 80.9728 80.953

Fitness 0.999841 0.99988 0.999873 0.99978 0.998885 0.999873 0.999827 0.998901 0.999911 0.999756

Losses 10.5351 10.5388 10.5392 10.5412 10.5608 10.5392 10.5402 10.5605 10.5344 10.531

P1 202.462 202.487 202.49 202.504 202.639 202.49 202.497 202.637 202.457 202.434

P3 27.0792 27.0865 27.0872 27.0912 27.1297 27.0872 27.0892 27.129 27.0779 27.0713

Total Cost 3614.9 3615.49 3615.54 3615.87 3618.98 3615.54 3615.71 3618.93 3614.39 3614.46

Table 4 Results using LIM for three generator test system Slno 1 Losses 10.5351 P1 202.49 Power P2 81.0267 P3 27.0149 Total Cost 3615.11

Table5 ELD Result using GA for ten generator test system Slno 1 2 3 4 5 Fitness 0.999954 0.998255 0.999537 0.999254 0.999378 Losses 13.9364 13.961 13.9424 13.9465 13.9447 Total Cost 17609.1 17627.6 17613.5 17616.6 17615.3
182

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

6 7 8 9 10

0.999839 0.999976 0.999949 0.999378 0.999254

13.9381 13.9361 13.9365 13.9447 13.9465

17610.2 17608.7 17609.2 17615.3 17616.6

Table6 ELD Result using FLCGA for ten generator test system

Slno 1 2 3 4 5 6 7 8 9 10

Fitness 0.999723 0.999365 0.999351 0.999264 0.999388 0.999939 0.999876 0.999849 0.999989 0.997615

Losses 13.9318 13.9449 13.9451 13.9462 13.9457 13.9481 13.9341 13.9375 13.9356 13.9703

Total Cost 17615.4 17616.4 17615.6 17616.2 17617.3 17612.2 17618.7 17619.2 17608.3 17634.6

Table 7 Results using LIM for three generator test system Conclusion In this paper, Fuzzy Logic Controlled Genetic Algorithm has been successfully implemented to obtain the optimum solution of economical load dispatch problem. Power system has large variation in load from time to time and it is not possible to have the load dispatch for every possible load demand. As there is no general procedure for finding out the optimum solution of economical load dispatch, this is where FLCGA plays an important role to find out the Optimum solution. In the proposed method two fuzzy controllers have been designed to adaptively adjust the crossover probability and mutation rate during the optimization process based on some heuristics. For the testing of proposed algorithm, three generators and ten generators test systems are used. The results obtained from proposed method are also compared with conventional GA and the Lambda Iteration Method. It is
183

European Scientific Journal

April edition vol. 8, No.7

ISSN: 1857 7881 (Print)

e - ISSN 1857- 7431

found that FLCGA is giving better results than GA and LIM. i.e. FLCGA proves their fast algorithm and yields true optimum generations of operating costs of the power system. References: Roa C.A-Sepulveda, Herrera M., Pavez-Lazo. B, Knight U.G., Coonick A.H., Economic Dispatch using fuzzy decision trees, Electric Power Systems Research 66 (2003) 115_/122, Dec 2002 M. Sudhakaran1, P. Ajay-D-Vimal Raj, Integrating genetic algorithms and tabu search for unit commitment problem, International Journal of Engineering, Science and Technology Vol. 2, No. 1, 2010, pp. 57-69 Hamid Bouzeboudja, AbdelkaderChaker, Ahmed Alali, BakhtaNaama., Economic Dispatch Solution Using A Real-Coded Genetic Algorithm, ActaElectrotechnicaetEnformatica No. 4, Vol. 5, 2005 Su C.T. and Lin C.T., New approach with a Hopfield modeling framework to economic dispatch, IEEE Transactions on Power Systems, vol. 15, 2000. Chandram K., Subrahmanyam N. and Sydulu M., unit commitment by improved preprepared power demand table, International Journal of Electrical Power and Energy Systems, Vol. 33, No. 1, pp. 106-114, 2011. Kazuko Y., Genetic Algorithms under Dynamic Environments, Fourth International Conference on knowledge based Intelligent Engineering Systems and Allied technologies, vol.101, no.66, pp.55-62, 2001. Yalcinoz T. and Altun H., Environmentally constrained economic dispatch via a genetic algorithm with Arithmetic crossover, IEEE 6th Africon Conference in Africa 2002, vol. 2, pp. 923 928, 2002. Benasla.L, Belmadant.A and Rahli M., Hooke-JeevesMethod Applied to a New Economic Dispatch Problem Formulation journal of information science and engineering 24, 907-917 (2008) Xiaohui Yuan Anjun Su HaoNie Yanbin Yuan Liang Wang Unit commitment problem using enhanced particle swarm optimization algorithm Soft Comput (2011) 15:139148 . LeiWu Mohammad Shahidehpour Accelerating the Benders decomposition for networkconstrained unit commitment problems Energy Syst (2010) 1: 339376

184