International Journal on Electrical Engineering and Informatics Volume 4, Number 4, December 2012

Similar documents
Multiobjective Generation Dispatch using Big-Bang and Big-Crunch (BB-BC) Optimization

The Study of Teaching-learning-based Optimization Algorithm

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions

Chapter - 2. Distribution System Power Flow Analysis

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

Population Variance Harmony Search Algorithm to Solve Optimal Power Flow with Non-Smooth Cost Function

Some modelling aspects for the Matlab implementation of MMA

Energy Conversion and Management

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization

ELE B7 Power Systems Engineering. Power Flow- Introduction

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY

Research Article Multiobjective Economic Load Dispatch Problem Solved by New PSO

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

MMA and GCMMA two methods for nonlinear optimization

arxiv: v1 [math.oc] 3 Aug 2010

Markov Chain Monte Carlo Lecture 6

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Particle Swarm Optimization Based Optimal Reactive Power Dispatch for Power Distribution Network with Distributed Generation

A Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems

Constrained Evolutionary Programming Approaches to Power System Economic Dispatch

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

Evolutionary Computational Techniques to Solve Economic Load Dispatch Problem Considering Generator Operating Constraints

Optimal Reactive Power Dispatch Using Efficient Particle Swarm Optimization Algorithm

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

Stochastic Weight Trade-Off Particle Swarm Optimization for Optimal Power Flow

Chapter Newton s Method

Optimal Reactive Power Dispatch Using Ant Colony Optimization Algorithm

Appendix B: Resampling Algorithms

Optimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement using CABC

Firefly Algorithm based Optimal Reactive Power Flow

Lecture 10 Support Vector Machines II

Evolutionary Multi-Objective Environmental/Economic Dispatch: Stochastic vs. Deterministic Approaches

Static security analysis of power system networks using soft computing techniques

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

OPTIMAL POWER FLOW USING PARTICLE SWARM OPTIMIZATION

On the Multicriteria Integer Network Flow Problem

Research Article Green s Theorem for Sign Data

Lecture 20: November 7

An Interactive Optimisation Tool for Allocation Problems

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Optimal Placement of Unified Power Flow Controllers : An Approach to Maximize the Loadability of Transmission Lines

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Experience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles

Multi-Objective Evolutionary Programming for Economic Emission Dispatch Problem

Economic dispatch solution using efficient heuristic search approach

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]

Kernel Methods and SVMs Extension

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

An Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Optimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm

The Minimum Universal Cost Flow in an Infeasible Flow Network

MODIFIED PARTICLE SWARM OPTIMIZATION FOR OPTIMIZATION PROBLEMS

A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM

A self-adaptive firefly algorithm for structural damage detection

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Optimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

Optimal choice and allocation of distributed generations using evolutionary programming

A Simple Inventory System

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business

A Modified Approach for Continuation Power Flow

Comparative Studies of Law of Conservation of Energy. and Law Clusters of Conservation of Generalized Energy

International Journal of Electronics and Electrical Engineering Vol. 4, No. 1, February 2016

Statistical Evaluation of WATFLOOD

Solving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study

Coarse-Grain MTCMOS Sleep

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Application of Gravitational Search Algorithm for Optimal Reactive Power Dispatch Problem

Thin-Walled Structures Group

Combined Economic Emission Dispatch Solution using Simulated Annealing Algorithm

A Hybrid Variational Iteration Method for Blasius Equation

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Economic Load Dispatch with Nonsmooth Cost Functions Using Evolutionary Particle Swarm Optimization

Finite Element Modelling of truss/cable structures

HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE

Study on Active Micro-vibration Isolation System with Linear Motor Actuator. Gong-yu PAN, Wen-yan GU and Dong LI

An Admission Control Algorithm in Cloud Computing Systems

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

FORAGING ALGORITHM FOR OPTIMAL REACTIVE POWER DISPATCH WITH VOLTAGE STABILITY AND RELIABILITY ANALYSIS

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

SOLUTION OF ELD PROBLEM WITH VALVE POINT EFFECTS AND MULTI FUELS USING IPSO ALGORITHM

Capacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search

Efficient Reactive Power Management via Enhanced Differential Evolution Algorithm with Adaptive Penalty Factor

Newton s Method for One - Dimensional Optimization - Theory

PARTICLE SWARM OPTIMIZATION BASED OPTIMAL POWER FLOW FOR VOLT-VAR CONTROL

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

Transcription:

Internatonal Journal on Electrcal Engneerng and Informatcs Volume 4, Number 4, December 2012 Bg-Bang and Bg-Crunch (BB-BC) and FreFly Optmzaton (FFO): Applcaton and Comparson to Optmal Power flow wth Contnuous and Dscrete Control Varables C. V. Gopala Krshna Rao 1 and G. Yesuratnam 2 1 Dept., M.V.S.R Engneerng college, Hyderabad. 2 Dept., Unversty college of Engneerng, Osmana Unversty, Hyderabad. vgkrao_ch@yahoo.com, ratnamgy2003@yahoo.co.n Abstract: Bg-Bang and Bg-crunch (BB-BC), a heurstc optmzaton method s based on the concept of unversal evoluton. FreFly optmzaton (FFO), also a recent heurstc optmzaton method, s based on the concept of flashng behavour of lghtngbugs. Both the optmzaton methods are appled to obtan the soluton of the Optmal Power Flow (OPF) wth contnuous and dscrete control varables for quadratc generator output cost functons. The contnuous control varables are generatng unt actve power outputs and generator bus voltage magntudes, whle the dscrete ones are transformertap settngs and swtchable shunt devces. A number of functonal constrants such as load bus voltage magntudes, lne flows and reactve power capabltes are ncluded as quadratc penaltes n the optmzaton functon. A comparatve smulaton results for Ward Hale 6 bus system wth seven control varables and IEEE 30 bus system wth twenty-three control varables are presented. Keywords: Bng-Bang and Bg-Crunch, FreFly, optmal power flow, dscrete, contnuous NOTATIONS F T : total operatng cost,nb: number of buses, NG: number of generator buses, NT: number of Transformers, NL: number of lnes (branches),nsh: number of swtchable shunts, NPQ: number of load buses NTR: number of transformers, : actve power njecton at bus, : reactve power at bus,np: populaton sze (number of frefles n FFO/number of Bg- Bangs BB-BC)NC: number of control varables (co-ordnates of frefles FF0/dspersons n BB-BC) 1. Introducton Rapd growth n power system sze and Electrcal power demand, problem of reducng the operatng cost has ganed mportance whle mantanng voltage securty and thermal lmts of transmsson lne branches. A large number of mathematcal programmng (algorthms) and AI (Artfcal Intellgence technque) have been appled to solve OPF[1,2]. In most general formulaton, the OPF s a nonlnear, non-convex, large scale, statc optmzaton problem wth both contnuous and dscrete control Varables. Mathematcal programmng approaches such as Calculus methods, Non-lnear programmng (NLP), Lnear programmng (LP), Quadratc programmng (QP), algorthms appled to obtan OPF soluton requre smooth and contnuous cost functon. Dynamc programmng methods (DP) are good at solvng quadratc and ramp cost functons, at the cost of ncreased dmensonalty and may get struck n local optmalty [3]. In cost optmzaton problems, t s desrable to obtan global optmum soluton [2]. Recent advances n AI technques can be appled as complementary approach to pave the way towards global/near global solutons for complex optmzaton problems such as OPF [2]. All search ntellgence technques, are populaton based and stochastc n nature. Search ntellgence Receved: February 25 th, 2012. Accepted: December 23 th, 2012 575

C. V. Gopala Krshna Rao, et al. technques developed by scentfc communty from the nspraton of natural socal behavour of dfferent organsms/natural processes, offer multple feasble solutons per teraton/generaton. Genetc algorthms and ts varants, Swarm ntellgence, Bactera foragng, ant-colony search technques are appled to obtan qualty solutons [4] to optmzaton problems. Bg-Bang and Bg-Crunch (BB-BC) developed by Erol and Eksn [5] from the concept of unversal evoluton, s also a populaton based search technque. BB-BC method has been proved to outperform genetc algorthm for benchmark test functons [5]. FreFly Optmzaton (FFO) also a heurstc algorthm that smulates the flashng behavour of frefles(lghtng bugs) developed by Dr. Xn-she yang[6] has been appled to solve a number of complex optmzaton problems[7]. The conflctng objectves of Economc Load Dspatch (ELD) and thermal emsson Pareto [8, 9] usng tradtonal B mn (real power loss coeffcents) s solved by FFO. Ths paper ams at solvng complex OPF problem wth contnuous and dscrete control varables usng BB-BC and FFO. Contnuous varables are generator real power outputs and generator termnal voltages. Dscrete varables are transformer tap settngs and swtchable shunts at power system buses. Each method s run 10 tmes wth dfferent ntal control varables for 200 generatons. The best results of each run are presented. Tme taken by both optmzaton methods are compared along wth relablty n arrvng at qualty solutons. Results of these two optmzaton methods are also compared wth Genetc approaches avalable n lterature [10, 11] of OPF for IEEE-30 bus system. 2. Optmal power flow problem formulaton: OPF problem can be stated as follows, (1)., 0 (2), 0 (3) (4) where, T (5) x s a state vector of the system wth bus bar angles and load bus voltages V L. Control varables to optmze equaton 1 are real power generaton of generator loadng unts( P g ), termnal voltages of generators(v g ), tap-settng of transformers(t tap ) and swtchable shunts(q sh ),,, (6) Equaton (1) s consdered as sum of quadratc cost functons of thermal generatng real power loadng unts wth usual a,b,c cost coeffcents of equaton (7) = Ng = 1 a + b P + c P g 2 g $/h (7) subject to equalty constrants of equaton (2) () actve power balance n the network - 0 (=1, 2, 3, NB) () reactve power balance n the network - 0 (=NG+1, NB) of equaton 4 s feasble control vectors of nequalty constrants,they are () actve power generaton of generator buses (=1, 2, NG) () lmts on voltage magntudes of generator buses (=1, 2,..NG) () lmts on swtchable shunts (v) lmts on tap settng of transformers (=1,..NSH) (=1,..NT) 576

Bg-Bang and Bg-Crunch (BB-BC) and FreFly Optmzaton (FFO) Equaton (3) has functonal operatng constrants whch are as follows () lmts on reactve power generaton of generator buses (=1, 2, NG) () lmts on voltage magntudes of load buses (=NG+1,.NB) () thermal lmts of transmsson lnes (=1,..NL) The lmts on the control varables of real power generatons, voltage magntudes of generators, transformer tap settngs and swtchable shunt devces are mplctly handled whle generatng the parameters randomly. Power flow soluton to equaton 2, results n state vectors x (bus bar angles, load bus voltages) of the power system network. The functonal operatng constrants are handled by a quadratc penalty functon approach [12]. Due to ncluson of penalty terms, equaton (7) transforms to a pseudo objectve functon (FF) mn (8) here,,, are penalty terms for the slack bus generator MW lmt volaton, Load bus voltage lmt volatons, generator reactve power lmt volatons and volatons for thermal lmts of lnes respectvely. 3. Bg-Bang and Bg-Crunch (BB-BC) Bg-Bang and Bg-crunch (BB-BC) optmzaton, s developed from the concept of unversal evoluton. Bg-Bang Phase relates to energy dsperson n random state before evoluton of unverse. The dspersed energy s drawn nto an order for the formaton of unverse. The stage of drawng the energy to an ordered state s Bg-crunch phase. Ths concept can be mathematcally smulated by obtanng object functon values by creatng random control varables (Bg -Bang) phase. The Centre of Mass (CM) of Bg-Bang phase s drawn nto an ordered state by a Bg- crunch phase. Crunch phase control varables emerge as best control varables from Bg-Bang phase. Sequental repetton of Bg-Bang around CM eventually leads to the global control varables of the functon to be optmzed. In the Bg Bang phase control matrx (U) of dmenson (NP*NC) s generated wthn lower and upper lmts of control varables. Each row of control varable s substtuted n functon to be optmzed to obtan NP number of functon values. Then centre of mass u CM of frst phase dspersons can be computed usng equaton 9. NP NP u CM = (1/ f ) u /( 1/ f ) (9) = 1 = 1 Computaton of u CM s crunch phase of the optmzaton. In equaton 9, u s th row of U. f s the functon value correspondng to u. Ths completes k th generaton of optmzaton method. For (k+1) th generaton, each row of control vector s updated around equaton 10. u CM usng u = u CM + lmt ( u * randn )/ k (10) 577

C. V. Gopala Krshna Rao, et al. lmt Where u s scale of upper U upper and lower U lower lmts of the control varables, K s generaton number, randn s normally dstrbuted random number between -1 and +1. Repetton of Bg Bang followed by crunch results n optmum value of the functon. 4. Frefly Optmzaton (FFO) Frefles, randomly dstrbuted n space, emt lght due to photogenc organs on ther surface for varous socal behavour such as prey attracton, warnng sgnals to a predator. The poston of each frefly can be located usng co-ordnate ponts. The brghter frefly emts more lght to attract other frefles. The other frefles, whch are lesser n brghtness, get attracted towards brghter one, by updatng ther postons. Thus, frefles keep movng n space tll all of them reach same poston (towards brghter one). Ths socal behavour of frefles s mathematcally smulated by ntroducng an attracton factor that depends on the poston of Frefly. The brghtness of frefly s proportonal to the maxmum of functon to be optmzed. The coordnates of each frefly are analogous to control varables of the optmzaton functon to be optmzed. The attracton towards brghter one s smulated as monotoncally decreasng functon. β = exp (-γ ) (11) In the above equaton s the dstance between any two frefles, s the ntal attractveness and γ s an absorpton co-effcent whch controls the lght ntensty between two frefles. The movement of frefly j, wth row vector as co-ordnates can be moved to a more brghter frefly, wth row vector co-ordnates by usng the followng update equaton for frefly j, = exp γ. alpha*rand (1, NC)-0.5) (12) Where alpha s step sze, rand s unform random number between 0 and 1.In equaton 12, frst term s current poston (co-ordnates) of frefly j, second term s the attractveness factor and last term allows random movement of frefly. FFO s maxmzaton algorthm. In ths paper, n each generaton of FFO, functon values are sorted n descendng order. Mnmum of functon value s consdered as the brghtest frefly, all other frefles are moved to the brghter one as per equaton 12. The mplementaton of optmzaton methods to OPF s presented n what follows. 5. Steps to mplement BB-BC and FFO to OPF In general evolutonary approach appled to OPF conssts of smlar steps, the specfcty of approach dffers only n updatng the control varables from current generaton to the new generaton durng optmal search. The followng steps are common to both optmzatons of ths paper appled to solve OPF. The specfcty of each optmzaton s ndcated after the followng steps. 1. Read OPF data (cost coeffcents of objectve functon, Lne, bus data and locaton of control varables) n power system network. 2. Generate ntal control varable matrx U of sze (NP*NC) wthn the lower and upper lmt of control varables.e th row of U can be generated as u = U lower *(U upper U lower )*rand (1, NC). Where, rand s unform random number [0, 1], U lower and U upper are lower and upper lmts of control varables respectvely. Typcally, U lower and U upper are row vectors of dmenson (1*NC). 3. Set generaton count k=1. 578

Bg-Bang and Bg-Crunch (BB-BC) and FreFly Optmzaton (FFO) 4. Intalze FF count to 1. Row select of U to 1. 5. Fetch the row correspondng to Row select from U, modfy lne and bus data of power system network. Solve for power balance equaton of OPF by usng Newton Raphson (NR)/Fast decoupled load Flow (FDLF). 6. Check for functonal operatng constrants, for any volaton of these constrants, actvate penaltes and Evaluate FF. set Row select=row select +1, FF=FF+1, return to 5, tll FF count=np. 7. Store current best soluton and ts correspondng control varables. Check for stoppng crtera, f met dsplay current best soluton, else go to step 8. 8. Update control varables n accordance wth update Equaton of respectve optmzaton method. Ths step may result n volaton of control varable lmts. Those volated control varables should be made equal to ther respectve volated lmt. 9. Set k=k+1.return to step 3 tll k=maxgenratons. In ths paper, to satsfy power balance equatons (step 5), FDLF s used [10]. Durng ntal generatons of optmzaton algorthm, FDLF may not converge even though control varables are wthn the range. For such cases, an addtonal large penalty term proportonal to maxmum real and reactve power msmatch s added to FF.FDLF maxmum teratons and power balance msmatch tolerance are set to 8 and 0.001pu respectvely. In step 8, control varables can be updated for BB-BC usng equaton 10 and for FFO usng equaton 12. Whle applyng BB-BC, the mnmum of FF value n each generaton s consdered as u CM. Convergence crtera may be number of generatons or dfference between best functon value of k th and (k+1) th generaton less than a specfed tolerance. The above steps are mplemented for the two test systems mentoned n ths paper. The requred code s wrtten n MATLAB-7.0, as m-fles usng lbrary routnes of MATLAB soft ware. Code s executed on a 2.1 GHz, Pentum IV PC. The choce of optmzaton parameters namely NP (populaton sze), alpha (step sze), γ (absorpton co-effcent), ntal attracton n FFO are presented along wth test- case results. 6. Test Results and Dscussons To test the effectveness and qualty solutons of optmzaton methods of ths paper, OPF smulatons are carred on Ward-Hale- 6 bus and Modfed IEEE-30 bus power system networks. Requred data for the two systems for cost coeffcents of generators, control varable lmts, bus and transmsson lne data are taken from [13]. In both systems, frst bus s slack bus and ts real power lmt s dealt n OPF usng quadratc penalty. Generator voltages of slack bus for both systems are also ncluded as control varables. Total system load consdered for ward- Hale s (1.3500pu +j 0.3600pu) and for IEEE-30 bus system total base case load s (2.834pu+j1.2620pu). The lower and upper magntudes of all load bus voltages are 0.95 pu and 1.05 pu respectvely. The transformer tap settng s consdered as (0.9+tap_ poston*0.005), where tap_ poston can take 41 dscrete steps n the range 0 to 40 nteger values. The tap_ poston 0 ndcates mnmum tap 0.9 and tap_ poston 40 ndcates maxmum tap of 1.1. Swtchable shunt consdered as (step _val*0.01), where step_ val can take 6 dscrete steps n the range of 0 to 5 nteger values, a step_ val 0 ndcates 0.00pu capactve shunt and 5 ndcates capactve shunt of 0.05pu(on 100MVA base).test results for Ward-Hale and IEEE- 30 bus systems are presented n table 1 and table 2 respectvely. Each test case s run ntally for base load (wthout optmzaton) wth control varables as gven n second column of the tables 1and 2. Cost after optmzaton by FF0 and BB-BC along wth control varables and slack bus power s ndcated n column 3 and column 4 of table 1, 2. Upon close observaton of table 1, 2 optmal cost of real power generaton obtaned by BB-BC and FFO are almost same wth a small edge for FF0. 579

C. V. Gopala Krshna Rao, et al. Table 1. Varables for Ward-Hale 6 bus system Varables Base case FFO BB-BC P g1 (pu) 1.2251 0.689885 0.689925 P g2 (pu) 0.25 0.8 0.8 V g1 (pu) 1.05 1.1 1.1 V g2 (pu) 1.10 1.15 1.15 Q sh4 (pu) 0.00 0.05 0.05 Q sh6 (pu) 0.00 0.05 0.05 t 1(6-5) 1.00 0.9550 0.9250 t 2(4-3) 1.00 0.9900 0.9800 Total real power generaton(pu) 1.4753 1.4899 1.4899 Total real power losses (pu) 0.1253 0.1399 0.1399 cost($/hr) 904.3086 450.9592 450.9907 Table 2. Varables for IEEE 30- bus system Varables Base case FFO BB-BC P g1 (pu) 0.987014 1.765171 1.749672 P g2 (pu) 0.8 0.487865 0.481406 P g5 (pu) 0.5 0.214746 0.208195 P g8 (pu) 0.2 0.216439 0.222772 P g11 (pu) 0.2 0.11980 0.14110 P g13 (pu) 0.2 0.120276 0.12000 V g1 (pu) 1.06 1.085421 1.087797 V g2 (pu) 1.043 1.066785 1.065492 V g5 (pu) 1.01 1.034902 1.03551 Vg11(pu) 1.082 1.069076 1.063822 V g13 (pu) 1.071 1.059076 1.010111 Q sh10 (pu) 0.19 0.04 0.04 Q sh12 (pu) 0 0.03 0.01 Q sh15 (pu) 0 0.02 0.02 Q sh17 (pu) 0 0.04 0.02 Q sh20 (pu) 0 0.04 0.02 Q sh21 (pu) 0 0.04 0.05 Q sh23 (pu) 0 0.03 0.04 Q sh24 (pu) 0.043 0.03 0.04 Q sh29 (pu) 0 0.02 0.02 t 1(6-9) 0.978 0.9850 1.0950 t 2(6-10) 0.969 0.9650 0.9600 t 3(4-12) 0.932 0.9900 1.0100 t 4(28-27) 0.968 1.005 1.015 Total Real power generaton(pu) 2.887 2.9243 2.9231 Total Real power losses(pu) 0.053 0.0930 0.0891 Cost($/hr) 900.5211 800.6803 800.8949 Both optmzaton methods of ths paper have only one common parameter, NP to be chosen by tral. In case of BB-BC, NP s set to 25 and 50 for Ward-Hale and IEEE-30 bus case respectvely. In case of FF0 other parameters of optmzaton update equaton γ and and are set to 1.The number of smulatons carred out by keepng alpha constant for all generatons of optmzaton process at dfferent values n the range of 0.02 to unty, resulted n hgher cost than BB-BC. To mprove the results, alpha s reduced gradually n small steps as optmzaton proceeds number of generatons. Such reducton of alpha s done by lettng alpha=0.975*alpha, wth alpha as unty before start of optmzaton generatons. Trals made for alpha are ndcated n table 3, wth NP=25 n case of Ward-Hale, NP=40 n case of IEEE 30 bus system. 580

Bg-Bang and Bg-Crunch (BB-BC) and FreFly Optmzaton (FFO) Table 3. Varaton of alpha vs Cost alpha Ward-Hale IEEE 30 Cost($/hr) Cost($/hr) 0.02 453.2976 802.747 0.5 451.9923 804.25 1 451.9234 807.171 Smulatons carred out, by varyng γ n the range 0.85 to 1,( set to 1), after selecton of proper step sze alpha, also resulted n the optmal cost as reported n tables 1,2. Hence, from table 3 and smulaton carred wth varaton of γ, selecton of alpha s crtcal n FFO optmal cost. Step sze alpha reduced n small steps n every generaton lead to the local search of objectve functon. A comparatve Convergence value of FF n $/hr s ndcated n table 4. It s clear from table 4 that qualty solutons can be arrved by both optmzaton methods n early generatons of optmzaton. It can also be observed from table, that FF0 attans qualty solutons than BB-BC, n very ntal generatons (20 generatons). The reason can be attrbuted to the fact that FFO updates control varables n each generaton based on dstance norm between best functon value of FF and the rest of functon values among FF. In case of BB-BC, convergence to optmal value s controlled by k of equaton 4. As optmzaton advances number of generatons, BB-BC optmal search wll be local as ndcated n table 4. Table 5 ndcates data statstcs for ten ndependent test runs wth dfferent ntal values, for 200 generatons. Table 4. A comparatve converge values of FF. Generaton number FFO BB-BC 20 810.38 821.65 30 802.49 808.96 40 802.26 807.09 50 802.16 807.06 60 800.72 807.09 70 800.72 802.59 80 800.72 801.95 90 800.72 800.87 100 800.72 800.07 Computatonal tme, dfference between Maxmum and Mnmum cost, Mean cost and Standard devatons provded n Table 5 gves better edge to FFO compared to BB-BC. The best cost by applcaton of problem specfc advanced genetc operators[10], and real coded genetc algorthm[11] for same IEEE-30 bus system are 802.06 $/h and 801.824$/h respectvely. Best cost obtaned by both optmzatons of ths paper s less than genetc approaches. However, the proposed optmzaton approaches of ths paper need to be tested for ther robustness for certan complex non-lnear and non-convex optmzaton stuatons lke reactve power dspatch usng recently proposed an Intellgent Water Drop (IWD) algorthm wth target voltage stablty ndex [ 14] and proposed two step-ntalzaton heurstc search algorthm[15] to optmal power flow wth FACTS devces. 581

C. V. Gopala Krshna Rao, et al. Table 5. Mnmum, Maxmum, Mean and standard devaton wth dfferent ntal values Ward-Hale IEEE-30 FFO BB-BC FFO BB-BC Mn ($/hr) 451 451 800.6 800.9 Max($/hr) 451.8 452.1 801.7 802.2 Mean ($/hr) 451.2 451.2 800.9 801.3 Standard devaton 0.3097 0.4469 0.353 0.4348 Meantme(S) 10.47 12.99 81.26 98.743 7. Concluson Bg-Bang and Bg-Crunch and frefly optmzaton methods are appled to solve complex statc optmal power flow problem wth contnuous and dscrete control varables. Test results and smulatons carred towards establshng relablty confrm promsng nature of the twooptmzaton methods for optmal power flow solutons. Careful selecton of step sze n Frefly optmzaton results n optmal, fast and relable optmal power flow solutons than Bg-Bang and Bg-Crunch optmzaton. Both optmzaton methods are smple to mplement compared to Genetc approaches for optmal power flow solutons. References [1] M. Huneault and F D Galana A survey of the optmal Power Flow Lterature. IEEE trans. vol 6, no, May 1991. [2] Bansal R. CDr (2005) optmzaton methods for Electrcal power systems an overvew Internatonal journal of Emergng Electrcal Power Systems vol 2, Iss 1, Artcle 1021 avalable @http://www.bepress.com//jeeps/vol2/ss1/art 1021. [3] N. Snha, R. Chakrabart, P. K. Chattopadhaya, Evolutonary programmng technques for Economc load Dspatch IEEE Trans. Evol. comp(1) (2003), pp 84-89. [4] N. P. Padhy, Artfcal Intellgence and Intellgent Systems Oxford Unversty press [5] K. Erol Osman, Ibrahm Eksn, New optmzaton method: Bg Bang-Bg Crunch, Elsever, Advances n Engneerng Software 37 (2006), pp. 106 111. [6] Yong X.S (2008), Nature nspred Metaheurstc Algorthms, Lunver press ISBN [7] X. S. Yang, Frefly algorthm, Levy flghts and global optmzaton, n Research and Development n Intellgent Systems XXVI, pp. 209 218, Sprnger, London, UK, 2010. [8] M. vnod Kumar G. Lakshm Phan Combned Economc Dspatch Pareto optmal fonts approach usng FreFly optmzaton Internatonal Journal of computer Applcatons Vol 30 no 12 sep 2011. [9] A Postopoulous T,Valchos A(2011) Applcaton of FreFly algorthm for solvng Economc Dspatch, Internatonal Journal of Combnatroncs 2011. Artcle ID 523806, do. [10] Anatass G. Balrtzs, N. Bskas, Chrstoforos E. Zoumas and Vaslos Petrds Optmal Power flow by Enhanced Genetc Algorthns IEEE Trans vol 17 no 2, May 2002, pp 229-236. [11] K. S. Lnga Murthy, K. M. Rao, K. Srkanth, Emsson Constraned Optmal power flow usng Bnary and real coded genetc algorthms Journal of the Insttuton of Engneers (Inda), vol 92, Sep 2011, pp 3-8. [12] D. I. Sun, B. Ashley, B. Brewer, A.Hughes and W. F. Tnney, Optmal power flow by Newton approch IEEE transacton on PAS, vol PAS-103, no 5, 1984,pp 2864-80. [13] K. y. Lee, Y. M Park and J L Ortz A unfed approach to optmal real and reactve power Dspatch,System Research, IEEE transacton on PAS,vol PAS-104, no 5, May 1985, pp 1147-53. [14] K. Lenn, M. Surya kalavath An Intellgent Water Drop Algorthm for solvng Optmal Reactve Power Dspatch Problem Internatonal Journal on Electrcal Engneerng and Informatcs Volume 4, Number 3, October 2012. 582

Bg-Bang and Bg-Crunch (BB-BC) and FreFly Optmzaton (FFO) [15] A. V. Naresh Babu and S. Svanagaraju A New Approach for Optmal Power Flow Soluton Based on Two Step Intalzaton wth Mult-Lne FACTS Devce Internatonal Journal on Electrcal Engneerng and Informatcs Volume 4, Number 1, March 2012. C. V. Gopala Krshna Rao s Assocate Professor n Electrcal and Electroncs Engneerng n MVSR Engneerng College, Hyderabad. He obtaned hs B.Tech from S.V. Unversty, Trupat and M.E n Hgh Voltage Engneerng from College of Engneerng Gundy, Chenna. He has 22 years of teachng experence at graduate level. He s currently a research Scholar n College of Engneerng, Osmana Unversty. To hs credt he has three nternatonal publcatons. Hs area of nterest ncludes Hgh voltage delectrc studes and Soft computng technques appled to Power Systems. Control. G. Yesuratnam s Assocate Professor and Head of the Electrcal Engneerng Department n College of Engneerng, Osmana Unversty, Hyderabad. He obtaned hs M.Tech degree from NIT, Warangal and Ph.D n Electrcal Engneerng from IISC, Bangalore, Inda. He has 17 years of teachng experence at both under graduate and post Graduate levels. To hs credt, he has publshed 5 nternatonal journals, presented papers n 10 natonal and nternatonal conferences. Hs area of nterest ncludes applcaton of Fuzzy and Expert systems to Power System Operaton and 583