International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN 6480(Print),

, ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

ENGINEERING AND TECHNOLOGY (IJARET)

ISSN 0976 - 6480 (Print) ISSN 0976 - 6499 (Online) Volume 4, Issue 5, July August 2013, pp. 24-34 IAEME: www.iaeme.com/ijaret.asp Journal Impact Factor (2013): 5.8376 (Calculated by GISI) www.jifactor.com

IJARET
IAEME

DESIGN OF PSS USING BEES COLONY INTELLIGENCE

R.sheeba a*, Dr.M.Jayaraju a, Dr. K. Sundareswaran b
a

Department of Electrical & Electronics engineering, T.K.M.college of Engineering, Kollam, Kerala, India b Department of Electrical & Electronics engineering, National Institute of Technology, Thiruchirapalli, India

ABSTRACT This paper report the development of a new optimization technique based on the biological behaviour of a colony of honey bees. The optimization method is prepared by closely imitating the foraging pattern of bees. The development of the algorithm and their validation is well documented in this work. The optimization scheme is then applied for a classical problem of design of Power System Stabilizer (PSS). Simulation results are carried out to validate the proposed algorithm. Key words Optimization, Bees, Power System Stabilizer. I. INTRODUCTION The stable operations of a synchronous machine, its ability to maintain the quality of electrical power delivered to the consumers and the economy in the generation cost with maximum possible power transfer are some of the requirements to be considered in the design of electrical power system. One of the effective means of achieving the above requirements is by providing an efficient excitation controller for synchronous machine. The realization of power system stabilizer (PSS) is based on the idea that the use of supplementary control signal in the excitation system of the generating unit can provide extra damping for the system and thus improve the machine dynamic performance [1]. This is the easy, economical and flexible way to improve power system stability. Over the past few decades, many types of PSSs have been extensively studied and some of them have been successfully used in the field. The conventional PSS was based on a linear model of the power system at some operating point and classic control theory was employed as the design tool [2]. With the increasing demand for quality power, modern control techniques like optimal control theory [3] and high-gain control theory [4] have been proposed for supplementary excitation controllers. Power systems are dynamic systems and the operating point of the system will change with varying system load.
24

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

To improve the damping characteristics of a power system over wide operating points, adaptive stabilizers or self-tuning controllers have been proposed [5-8]. In these controllers the system model is first identified in real time using the measured system input and output variables. The gain settings are then computed based on the model and the adaptation law. Even though better dynamic response can be achieved by self-tuning controllers, the major hurdle is the need to identify system model in real time, which is very time consuming. Recently artificial neural networks (ANN) [9] and fuzzy logic principles [10] are applied for the realization of adaptive PSS. It is shown that ANN based PSS can provide good damping of the power system over a wide operating range and significantly improve the dynamic performance of the power system. Fuzzy excitation controller also improves the dynamic response of the power system at different operating points. In addition, fuzzy controller does not require model identification and thus can be easily implemented on a microcomputer. The contribution of this paper lies in the development of a new optimization algorithm developed by the authors which closely mimic the behavior of honey bees [11]. Literature survey shows that attempts have been made recently by the researchers to utilize the behavior of honey bees for a few applications [12-18]. The foraging behavior of honey bees is also used for optimization algorithms for various applications such as training of learning vector quantization networks [15], job scheduling [16], optimizing neural networks [17] etc. In this work, we have developed a algorithm which fundamentally imitate natural behavior of a colony of honey bees in nectar collection and reproduction. The first proposal mimics the foraging behavior of honey bees. The randomly generated worker bees are forced to move in the direction of the elite bee, which locates the best possible solution. The movement is made based on a probabilistic approach and the step distance of flight of bees is made as a variable parameter in the algorithm [19-25]. The algorithm is used for the design of PSS for a single machine connected to infinite bus system and the results are discussed. It is shown that the newly proposed scheme is derivative-free, efficient in locating the global optima with reduced number of iterations, independent of initial values, and are robust in their convergence characteristics. II. BRIEF DESCRIPTION ABOUT THE BIOLOGY OF HONEY BEES [11] The honey bees are believed to be originated in Tropical Africa and spread from South Africa to Northern Europe and East in to India and China. A typical small hive contains approximately 20,000 bees and the bees in a hive are divided in to three different types: Queen, Drone and Worker. The functions, sex, life span and physical size of these three categories are largely different. The sole function of the queen is re-production; it is female, and can live up to two years. The queen is the mother of all bees in the hive. The size of queen is larger with its abdomen noticeably longer than the other bees. Drone is a male bee which survives about 21-32 days in spring or 90 days in summer. Drones are medium in size and are designated for mating only. Drones eyes and antennae are specially designed for seeing, following and mating with a queen. They can fly fast to catch up with a queen. Queens and drones do not have effective body parts for harvesting honey or pollen for self feeding. Worker bees are sterile females and they have numerous functions. Worker bees make comb, clean and defend hive, gather honey and pollen, and tend queen and young drones. They are small in size and survive up to 20-40 days in summer and 140 days in winter. II. 1. Foraging behavior of honey bees The foraging behavior of honey bees is quite interesting and it is found that bees are fairly adept at effective communication of food sources. In the hive, the worker bees are responsible for food collection. A few worker bees are sent to different random directions and a single bee visits many different flowers in the morning. If there is sufficiently large food, the bee makes many transits
25

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

between the flowers and its hive. The floral findings are communicated to other worker bees in the hive through a dancing. A bee which returns from an area which has many flowers producing much honey/pollen performs a dance on the comb. The orientation of her movements together with frequency of vibrations indicates the direction and distance of flowers from the hive. This dance serves as an effective way of communication among worker bees. The other worker bees waiting in the hive will observe this dance and will come to know the location and quantity of food source. All the worker bees, who had found flowers, will perform dances; but majority of worker bees will follow the elite bee- the bee which had located better and nearer food source than the remaining. This mechanism helps the colony to gather food quickly and efficiently. II. 2. Development of optimization algorithm based on foraging behavior As can bee in the previous section, worker bees perform the task of food collection in an optimized manner. This makes it possible to build an optimization algorithm. The bees can be placed initially at random locations in the solution space; the bee at the best location- the location where the objective function is minimum- can be treated as elite bee. In nature, majority of worker bees follow the elite bee, while remaining bees fly to other less attractive locations. This can be perceived as a probabilistic approach. Thus, it can be assumed that, based on a probability, some fly towards the location of the elite bee and the left out bees to other locations. The complete algorithm developed by the authors is given in the following steps: Let the optimization task is defined as follows: (1) Minimize: F ( x)
subject to, xl x xu .

(2)

In the above, F ( x) is a scalar valued objective function and xl and xu are the lower and upper bounds of the variable. Step 1: Deploying bees initially at random locations The initial step involved is deploying the bees in a feasible solution space subject to the constraints imposed on the solution variables. Here, position of a bee refers to one complete solution set to the problem. For generality, let the bees be described as B1 , B2 ,.......Bi .............Bn where n is the number of bees and can be termed as population size. For n = 4, initial random position of bees is shown in figure 1(a).

(a)
26

(b)

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

pi pt pi < pt

pi pt pi < pt

(c)

(d)

pi pt pi < pt

(e)

(f)

Figure 1. Bee movement. (a) Initial poison of bees. (b) Indication of duration of dance. (c) Probability of movement. (d) Bee flight for p i p t . (e) Bee flight for p i < p t . (f) Final position of bees

27

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

Step 2: Evaluation of objective function value The objective function value, F ( ) at each bee position is evaluated using equation 1. Step 3: Computation of duration of dance of each bee In this step, depending on the floral findings, each worker bee performs dance on the comb. The duration of dance is a measure of quantum of food and let Dd represent the duration of dance. The duration of dance of the i -th bee in the j -th location at t -th iteration is given in equation 3.

Ddi ( j ) (t ) =

1 Fi ( j ) ( ) + 1

(3)

The duration dance of bees is indicated in circles and the size of the circle is used to measure Dd . This is illustrated in figure 1(b). Step 4: Identification of elite bee. The bee, whose location gives maximum value for Dd is designated as elite bee. Thus elite bee, Be in the t -th iteration is given by equation (4).
B e (t ) =

Max (D
i, j

di ( j )

(t ) )

(4)

In figure 1(c), B4 is the identified as the elite bee. Step 5: Movement of bees Majority of bees follow the elite bee; however, few bees may fly to other flower patches too. Hence the movement of bees can be thought of based on a probability. This will make the search more probabilistic and may yield better results. A term named as threshold probability is therefore introduced and is denoted as pt . The value of pt is fixed at a suitable value between 0 and 1. In order to find the direction of flight of a particular bee, a random number between 0 and 1 is generated denoted as pi and is compared with pt . For p i p t , then the bee flies a distance of R1 towards the elite bee. The distance of flight, denoted as R1 is a variable in the problem and is to be judicially chosen. In figure 1(c), for bees B1 and B2 , p i p t and hence will move towards the elite bee. The flight of B1 and B2 is shown in figure 1(d) where B1 flies a distance of R1 towards the elite bee, B4 and reaches the point, Y. Similarly, bee B2 flies a distance of R1 towards B4 and reaches the point, X. For pi < pt , then that bee flies a distance of R1 towards any other bee location, which is randomly decided between 1 and n . This is demonstrated in figure 1(e). The bee, B3 falls in the category of
pi < pt and hence flies a distance of R1 towards any other bee location. For this, a random number between 1 and n is generated. Let the number be 1 so that B3 moves towards the past location of B1 .
Thus, B3 reaches point Z. When all bees make a flight of distance R1 , one iteration is completed. The final position of all bees after one iteration is shown in figure 1(f). Step 6: End the program, if termination criterion is reached; else go to step 2.

28

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

III. APPLICATION OF THE ALGORITHMS FOR PSS DESIGN III. 1. Single machine infinite bus system model For developing dynamic model, a single machine synchronous generator connected to infinite busbar is considered [1] and is shown in figure 3(a).

E fd
'

E q

Figure 3. Component of torque produced by voltage regulator action in response to a speed-derived signal
Figure 3 shows the effect of speed through the stabilizing function G(s) through the voltage ' regulator loops affecting E q , which produces component of torque T . In figure 3 (b) speed deviations is given as input of PSS. It produces an output, which is a voltage signal V s . The output from the PSS is given to AVR, which produces a corresponding change in torque. In other words stabilizing signal derived from machine speed is processed through a device called the power system stabilizer (PSS) with a transfer function G(S) and its output connected to an input of the exciter. Contribution of PSS to the torqueangle loop [1] is given by
T (s ) (s) = G(s) K 2 K a (1 / K 3 + K a K 6 ) + s(Ta / K 3 + Td 0 ) + s 2Td 0 Ta
' '

(6)

For the usual range of constants, this function can be approximated by

G(s)K2Ka T(s) ' (s) (1/ K3 + Ka K6 )[ 1+ s(Td0 / K6Ka )]( 1+ sT a)

For large values of K a it can be further approximated by

(7)

T (s) K 2 G(s) = ' (s) K6 [1 + s(Td 0 / K6 K a )](1 + sTa )

T (s) (s) = K2 G(s) = G(s)GEP(s) K6 [1 + s(Td 0 ' / K6 K a )](1 + sTa )

(8)

(9)

The transfer function of a PID controller is K G(s) = ( K p + i + sK d ). s

29

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

III. 2. SIMULATION RESULTS

A generalized controller structure is considered for the PSS with the objective of achieving the best dynamic response at all operating points. Let the controller structure be

G (s ) = K n s n
n

(10)

In the above equation Kn represents the controller parameters and n decides the order of the controller. For simplicity a PID controller is chosen, i.e., n =1. The task is to identify the parameters of the controller so as to obtain optimum performance at all operating points using the above mentioned method. Thus the problem is formulated as follows: Find F ( ) such that Minimize (11) F ( ) = rp + t s Subject to min max Where F ( ) is the objective function, rp and t s denotes the peak overshoot and settling time respectively. is a set of controller parameters to be determined and is denoted as [ K P , K I , K D ], the subscripts min and max represent the lower and upper bounds of the variables. The minimization of the objective function in equation (11) is now carried out using the two new optimization method described in the previous section. For this, a typical operating point given in table 1 is considered.

Table-1. Parameters of single machine system

Machine Data(p.u) Xd=0.973 X'd=0.19 Xq=0.55 T'do=7.765s D=0.0 H=4.62 Re=0.0 Xe=0.997 KA=50 TA=0.05 Vto=1.0 Po= 0.8 p.u Qo=0.4 p.u Transmission line(p.u) Exciter Operating Point

0 =72.83830

Table-2. Parameters of bee food foraging approach

Bee population size Threshold probability Step size of movement of bees, R1 15 0.7 8.2

30

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

Dedicated software Matlab is developed for the optimal design of the PSS at the above mentioned operating point using the bees algorithm. The computed results are delineated in figure 4. The parameters employed in each algorithm are tabulated through tables 2 and 3. All the parameters are obtained by trial and error and no attempt has been made to optimize them. Figure 4(a) shows the variation of objective function at each iterative step of the two novel optimization algorithms. This figure also shows objective function variation employing GA which is included for comparison. It is important to mention that for fairness of comparison the initial population is taken as same for all the three optimization methods to commence with.

Table- 3. Parameters of genetic algorithm approach

population size Crossover probability Mutation probability 15 0.8 0.06

Figure 4. Convergence characteristics

Figure 5 illustrates the convergence characteristics of two novel optimization methods. The variation of objective function of each bee against iterative step as shown in figure 5(a) is a clear indication of effective communication through waggle dance. While each bee starts at random location they all converge coherently to the best position of high quality flower batches. However such a mechanism is absent in the reproduction algorithm and this scheme relies on the survival of the fittest mechanism. For completeness, the variation of controller constants with each iterative step is also included in figure 5. At the end of iteration the optimal PSS structure identified and is given in table 4.

Table-4. Optimum PSS structure

OBF GA

KP 22.72 22.12

KI 1.11 1.782

KD 4.12 3.21

The dynamic response of single machine connected to infinite busbar with optimized PSS is now studied and is available in figure 6. Figure 6 (a) shows the variation of the machine, when subjected to 0.05 p.u. step disturbance in Tm at rated operating conditions. From this dynamic response the peak value is limited to 0.0006 and settling time is 1.6 seconds. Figure 6(b) shows the variation of terminal voltage of the generator delivering rated load when subjected to a dip in Tm of amplitude 0.05 p.u. step.

31

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

35 30 25 20 15 10 5 0 1 101 201 301

6 5 4 3 2 1 0 1 101 201 301 No of iterations

Kp

No of iterations

(a)
12 10 8 6 4 2 0 1 101 201 301 No of iterations
9 8 7 6 5 4 3 2 1 0 1 51 101

Ki

(b)

Objective function

Kd

151

201

251

301

No of iterations

(c)

(d)

Figure 5. Colony behaviour of bees. Variation of controller parameters (a) K P , (b) K I (c) K D and (d) Convergence characteristics.
The response shows that the proposed controller effectively stabilizes the machine terminal voltage with a settling time of 1.4 seconds. Also the maximum dip in machine voltage is as low as 0.06 p.u. It is evident that the proposed schemes are on a par with that of GA.

(a)

(b)

Figure 6 (a) Variation of the machine, when subjected to 0.05 p.u. step disturbance in Tm at rated operating conditions. (b) Variation of terminal voltage of the generator delivering rated load when subjected to a dip in Tm of amplitude 0.05 p.u.
32

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

V. CONCLUSION
The prospective method based on honey bees presented in this paper supplements the present wealth of recently developed optimization techniques and knowledge. The novel concept promise confirmed convergence with random initial guess, simple computational steps, derivative-free operation etc. Results obtained from computer simulations of a single machine connected to infinite busbar indicate that the bee tuned excitation controller can yield good damping characteristics over a wide range of operating conditions.

REFERENCES
[1] F.P.Demello and C.Concordia, Concepts of synchronous machine stability as affected by excitation control, IEEE Trans. Power Apparatus and Systems, vol. PAS-88, No.4, pp. 316329, Apri11969. Larsen, E.V. and D.A.Swan, Applying power system stabilizers, IEEE Trans. PowerApp. Syst., vol. PAS-100, pp. 3017-3046, 1977. Ohtsuka, K., S.Yokokama, H.Tanaka and H.Doi, A multi variable optimal control system for a generator, IEEE Trans. Energy Conversion, vol. EC-1, No. 2, pp. 88-98,1988. S.Palani and K.L.P.Mishra, Design of high-gain excitation controller of synchronous generator, Electric machines and Electro Mechanics, Vol.7, pp. 463-472, 1982. DXia and G.T.Heydt, Self-tuning controller for generation excitation, IEEE Trans. Power App. Syst., vol. PAS-102, pp.1877-1885, 1983. C.J.Wu and Y.Y.Hsu, Design of self-tuning PID power system stabilizers for multimachine power systems, IEEE Trans. Power syst., vol. PWRS-3, pp. 1056-1064,1988. Y.Y.Hsu and C.J.Wu, Adaptive control of asynchronous machine using the auto-searching method, IEEE Trans. Power Syst., vol. PWRS-3, pp. 1434-1440,1988. A.Chandra,O.P.Malik and G.S.Hope, A self-tuning controller for the control of multimachine power systems, IEEE Trans. Power Syst., vol. PWRS-3, pp. 1065-1071, 1988. Y.Zhang, G.P.Chen, O.P.Malik and G.S.Hope, An artificial neural network based adaptive power system stabilizer, IEEE Trans. Energy Conversion, vol. 8, No.1, pp. 71-77, 1993. Y. Y .Hsu and C.H.Cheng, A fuzzy controller for generator excitation control, IEEE Trans.Syst. man and cybernetics, vol. 23, No.2, pp. 532-539, 1993. The biology of honey bees, Mark.L.Winston, Hardward University Press, Cambridge, MA, 1987. Sung Hoon Jung , Queen-bee evolution for genetic algorithms, Electronic Letters, Volume 39, Issue 6, pp.575 576, Mar 2003. Qin, L.D.; Jiang, Q.Y.; Zou, Z.Y.; Cao, Y.J.; A queen-bee evolution based on genetic algorithm for economic power dispatch Proceedings of 39-th International Conference UPEC 2004, Vol. 1, pp: 453 456. H.A.Abbass, MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach Proceedings of the 2001 congress Evolutionary Computation, Vol.1, 2730, pp:207 214, May 2001. Sato, T.; Hagiwara, M, Bee System: finding solution by a concentrated search Proceedings of IEEE International Conference on Computational Cybernetics and Simulation, Volume 4, pp. 3954 3959, 1997. Pham, D.T.; Otri, S.; Ghanbarzadeh, A.; Koc, E.; Application of the Bees Algorithm to the Training of Learning Vector Quantization Networks for Control Chart Pattern Recognition Proceedings of International Conference, ICTTA, Vol.1, pp.1624 1629, 2006. C.S.Chong, M.Y.H. Low, A.I.Sivakumar, K.Leng Gay, A bee colony optimization algorithm to job scheduling Proceeings of 2006 IEEE Winter simulation conference, pp.1954-1960.
33

[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]

[14]

[15]

[16]

[17]

International Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 6480(Print), ISSN 0976 6499(Online) Volume 4, Issue 5, July August (2013), IAEME

[18] Pham, D.T.; Soroka, A.J.; Ghanbarzadeh, A.; Koc, E.; Otri, S.; Packianather, M.; Optimizing Neural Networks for Identification of Wood Defects Using the Bees Algorithm Proceedings of 2006 IEEE International Conference on Industrial Informatics, pp.1346 1351, Aug. 2006. [19] Dr.K. Sundareswaran, V.T. Sreedavi, Development of Novel Optimization Procedure Based on Honey Bee Foraging Behavior, IEEE International Conference on Systems, Man and Cybermetics ,2008, [20] J.H.Holland, Adaptation in Natural and Artificial Systems, ser. MI. Ann Arbor:Michigan Univ. Press, 1975. [21] David.E.Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley publications, 1993. [22] L.Davis, The Handbook of Genetic Algorithms, New York:Van Nostrand, 1991. [23] K.F.Man, K.S.Tang and S.Kwong, Genetic algorithms: Concepts and design," IEEE Industrial Electronics News Letter, vol.45, No.4, December 1998. [24] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd Ed. New York: Springer-Verlag, 1999. [25] T.Furuhashi, Advances in Fuzzy logic, Neural networks and Genetic Algorithms, Berlin, Germany: Springer-Verlag, 1995. [26] Lalit Kumar and Dr. Dheerendra Singh, Solving Np-Hard Problem using Artificial Bee Colony Algorithm, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 1, 2013, pp. 171 - 177, ISSN Print: 0976 6367, ISSN Online: 0976 6375. [27] G.Vasu, J. Nancy Namratha and V.Rambabu, Large Scale Linear Dynamic System Reduction using Artificial Bee Colony Optimization Algorithm, International Journal of Electrical Engineering & Technology (IJEET), Volume 3, Issue 1, 2012, pp. 145 - 155, ISSN Print : 0976-6545, ISSN Online: 0976-6553. [28] Gowrishankar Kasilingam, Effect of Genetic PID Power System Stabilizer for a Synchronous Machine, International Journal of Advanced Research in Engineering & Technology (IJARET), Volume 4, Issue 4, 2013, pp. 8 - 21, ISSN Print: 0976-6480, ISSN Online: 0976-6499.

34