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

Size: px
Start display at page:

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

Transcription

1 Internatonal Journal on Electrcal Engneerng and Informatcs - Volume 7, Number 4, Desember 2015 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton and Voltage Stablty Improvement usng CABC Mohandas Natarajan, R. Balamurugan and L. Lakshmnarasmman Department of Electrcal Engneerng, Annamala Unversty, Annamala Nagar, Tamlnadu, Inda Abstract: Ths paper presents a chaotc artfcal bee colony (CABC) algorthm for optmal placement and szng of s on dstrbuton systems wth an am of reducng the power losses and mprovng voltage stablty. The explotaton ablty of solutons to the food searchng process s mproved n the CABC algorthm to avod the premature convergence of an artfcal bee colony algorthm. The proposed approach determnes the control varable settngs such as placement and sze of for mnmzaton of real power loss wth mpact of voltage stablty n the dstrbuton system. Further, the mpacts of on the dstrbuton system are studed wth an mportance on power losses and capacty savngs. The proposed approach s examned and tested on 33 bus and 69 bus radal test systems. The smulaton results of the proposed approach are compared to earler reported approaches. The smulaton results show the effectveness of the proposed approach. Keywords: dstrbuted generaton, chaotc artfcal bee colony, power loss, voltage stablty, radal dstrbuton systems. 1. Introducton The functon of a dstrbuton system s to delver electrcal power from the transmsson network to end users. The dstrbuted generaton () s a power source that can be playng an mportant role n the dstrbuton system n case of power demand. The dstrbuton systems are usually unbalanced and have a hgh R/X rato compared to transmsson systems, whch results wth the effect of hgh voltage drops and power losses n the dstrbuton feeders. The vtal tasks n the dstrbuton system are reducton of power losses and mprovement of the system voltage profle. Many research works have been carred out n ths drecton snce the supportng of analytcal and software approach. The plannng of handles wth the optmal placement and sze of n the dstrbuted system n order to reduce the real power loss and mprove the voltage profle and stablty. The mpact of real power njecton nto the dstrbuton system for mnmzng the power losses and voltage stablty has been reported n [1]. The plannng methodology used to evaluate any credts the utlty mght offer f the s n an approprate locaton to have real benefts for capacty relef [2]. The support an analytcal expresson used to compute the optmal sze and an effcent method to dentfy the related optmum locaton for placement for reducng the total power losses n prmary dstrbuton systems [3]. In [4], the author presented analytcal expressons have used to determne the optmum sze and power factor of dfferent types of s for mnmzng power losses n prmary dstrbuton systems. The genetc algorthm (GA) based approach to mnmze the power loss of the system for evaluated the optmal placement and sze of a wth dfferent loadng condtons s reported n [5]. A two-stage methodology of determne the optmal placement and capacty of s for loss reducton of dstrbuton systems. The frst stage of methodology s used to fndng placement and another one s the capacty of [6, 7]. The power stablty ndex and lne losses based for placement and szng of n the dstrbuton system s reported n [8]. The ntroducton of combned GA and partcle swarm optmzaton (PSO) methods and whch s used to calculate the placement and szng of n the dstrbuton system [9]. The loss senstvty factor (LSF) and smulated annealng (SA) technque are combned and whch s used to determne the locaton and sze of s n the radal networks [10]. Receved: December 3 rd, Accepted: October 22 nd, 2015 DOI: /jee

2 Mohandas Natarajan, et al. The bacteral foragng optmzaton (BFO) algorthm based optmal placement and sze of n the dstrbuton system for consderng the real power losses, operatonal costs and voltage stablty [11]. In [12], presents an analyss nto the effect of load models on the predcted energy losses of the dstrbuton system n plannng. A new voltage stablty ndex (VSI) s used to dentfy the most senstve node n the radal dstrbuton system wth dfferent types of load [13, 14]. The effcent forward and backward propagaton based load flow soluton technque has been mplemented n the radal networks s reported [15]. The artfcal bee colony (ABC) algorthm s a populaton based meta-heurstc approach and whch s nspred by ntellgent foragng behavour of honeybee swarm. It s mtates the behavours of real bees n searchng food sources and sharng the nformaton wth other bees [16, 17]. The performance of the ABC s compared wth other populaton based algorthms wth the beneft of employng fewer control parameters [18]. The modfed versons of ABC algorthm have been ntroduced n [19, 20] and t s used to solvng the real-parameter optmzaton problems. Most of the earler reported [9-11], the searchng ablty of algorthms at startng stage as a global run and end stage as a local run. Therefore, when solvng an optmzaton problem s mportance to explore the local optma at an end stage of algorthm run. Moreover, the local searchng ablty of earler reported algorthms s less. In ths paper, to encouragng the results n ths drecton for ntroducng a chaotc artfcal bee colony algorthm s mplemented to fnd the optmal placement and szng of s n the dstrbuton system so as to reduce the real power loss and mprove the voltage stablty. To mprove local optma and avod premature convergence of the soluton, the ABC algorthm s combned wth chaos. The local search capablty of the optmzaton problem s mproved usng a chaos theory. 2. Problem formulaton The objectve of the optmal placement and szng of s s to mnmze the real power loss n the radal dstrbuton system whch can be descrbed as follows, P loss, jnl P 2 j Q V 2 2 j r j (1) where, P loss = total system real power loss (MW) P j, Q j = real and reactve power flow n lne -j V = voltage at th bus r j = lne resstance of -j NL = number of lnes. Whle reducng the value of above functon s subject to a number of constrants as follows. A. Power Balance Constrants The algebrac sum of the entre recevng power s equal to the sum of entre sendng power plus lne loss over the complete dstrbuton network and power generated from unt. P (2) SS NB 2 P ( ) D NL j 1 P loss ( j) N k 1 P ( k) Q SS NB Q ( ) Q ( j) Q ( k) (3) 2 D NL j 1 loss N k 1 680

3 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton where, P D total system real power demand (MW) P total real power generated by (MW) Q D total system reactve power demand (MVAr) Q loss total system reactve power loss (MVAr) Q total reactve power generated by (MVAr) N number of. B. Real and Reactve Power Generaton Lmts The real and reactve power generaton of s controlled by ts lower and hgher lmts as follows, mn max P P P (4) Q mn Q Q (5) max C. Voltage Profle Lmts The voltage at each node of the radal dstrbuton network s defned as, mn max V V V (6) D. Lne Thermal Lmts The power carryng capacty of feeders should not exceed the thermal lmt of the lnes (S). S S (7) max, j (, j) 3. Types of Dstrbuted Generaton The unts are classfed nto four types n order to delver the real and reactve power capabltes of the dstrbuton system [4]. In ths approach, follow the report [10] for consderng that the type 1 (unty p.f) and type 2 (0.866 p.f) s only. A. Type 1 (P nject) Ths type of (e.g., Photovoltac, fuel cells and mcro turbnes) s havng the capacty of delverng the real power only and operates at unty power factor. P P P (8) D where, P s the net real power of node P s the real power njected at node P D s the real power demand of node. B. Type 2 (PQ nject) In ths type of (e.g., synchronous generator) s havng the capacty of delverng both real and reactve power. The power factor of s fxed at leadng. By consderng a = (sgn) tan (cos -1 (PF)) as n [4], the reactve power output of s expressed as, Q (9) ap Q In ths type, a = (+1) tan (cos -1 (PF )) Q Q (10) D where, Q s the net reactve power of node 681

4 Mohandas Natarajan, et al. Q s the reactve power based of node Q D s the reactve power demand of node. In whch, sgn = +1; supplyng reactve power. sgn = -1; absorbng reactve power. PF = Power Factor of. 4. Effect of on Voltage Stablty The mpact of n the dstrbuton system s to ncreasng the real power loadng capacty of the system whch related to the voltage stablty. The voltage stablty ndex (VSI) gves the nformaton for voltage stablty of the radal dstrbuton systems. The varaton of ths factor whch ndcatng system voltage stablty n presence and absence of s. The VSI s defned as [13], VSI m2 V m P m2 x jjqm2 r jj P m2 r jj Qm2 x jj V m 1 2 where, NB = total number of nodes jj = branch number VSI(m2) = voltage stablty ndex of node m2 (m2 = 2,3,.,NB) r(jj) = resstance of branch jj x(jj) = reactance of branch jj V(m1) = voltage of node m1 V(m2) = voltage of node m2 P(m2) = real power load fed through node m2 Q(m2) = reactve power load fed through node m2. (11) The evaluated value of VSI s greater than zero, whch ndcatng system operates n stable condton, otherwse system goes to nstablty. 5. An overvew of artfcal bee colony algorthm The ABC algorthm s an optmzaton algorthm that smulates the behavour of honey bees. In the ABC algorthm, the colony of artfcal bees can be classfed n to three sets, such as employed, onlookers and scouts. The bees are searchng wth specfc food sources are named as employed bees. The onlooker bees are watng on the dance area for makng the decson to choose a food source. The bees are search for food sources randomly called scouts. The man steps of the ABC algorthm are explaned as follows, Step 1 : Intalze the random populaton of food source, lmt and maxmum cycle number. Step 2 : Implement the employed bee procedure to adjust the food source of functon and calculate the correspondng ftness functon. Step 3 : Adjust the food source based on onlooker bee procedure and calculate the correspondng ftness functon. Step 4 : The specfc food source soluton s abandoned, whch s replaced by sendng the scout bee procedure. Step 5 : Update the cycle. The number of cycle reaches at maxmum cycle number (MCN) of the algorthm, prnt the fnest results of the optmzaton problem. 682

5 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton A. Chaotc local search The chaos theory s used to develop the searchng behavour and to avod the premature convergence of solutons n the optmzaton problem. The chaotc local search consders as a two well known maps such as logstc map and tent map. The chaotc local search can be descrbed as the followng logstc equaton as, cx k1 4cx k 1 cx k = 1, 2,.,n (12) where, cx s the th chaotc varable, and k s the maxmum number of teratons or 300. The chaotc local search has the followng procedure. k k The decson varables x s converted nto chaotc varables cx usng the equaton cx x lb k k =1, 2,..,n (13) ub lb where, lb and ub are the lower and upper bound of the x. Calculate the chaotc varables The chaotc varables equaton x lb cx k1 k1 cx k1 usng the equaton (12) for the next teraton. k1 cx s converted nto decson varables ub lb = 1, 2,..,n k1 x usng the followng (14) k1 Calculate the new soluton wth decson varables x. Revse the recent soluton of the problem f t has mproved ftness when compared to prevous one. B. Chaotc Artfcal Bee Colony algorthm The ABC algorthm s used to update the food source of the bees and whch s combned wth chaos theory s called CABC. In order to combnatons of ths algorthm has mproved the explotaton process of the searchng food source n the optmzaton problem. The CABC algorthm s used as the less number of control parameters. The CABC algorthm has the followng steps: Step 1: Intalze the random populaton, lmt, k and MCN. Step 2: Generate the ntal populaton x m lb rand * Step 3: Set the cycle = 1. x m, 1 ub lb usng the equaton as, 0 (15) Step 4: Send the employed bee procedure to adjust the food source m v m (16) x rand * m 1, 1 x x m k v usng the equaton as, where, x s a randomly selected food source, s a randomly chosen parameter ndex. k Calculate the ftness value of food source. If the new food source vector has better ftness value than older one, t replaces the old. 683

6 Mohandas Natarajan, et al. Step 5: Send the onlooker bee procedure to adjust the food source equaton (17) and (16). p m SN m 1 ft ( xm ) ft ( x ) m v m usng the probablty of where, SN denotes the sze of onlooker bees. Calculate the ftness value of correspondng food source. If the new food source vector has better ftness value than older one, t replaces the old. Step 6: Send the chaos theory procedure to adjust the food source (17) x usng the equaton (12), (13) and (14). Evaluate the ftness value of related food source. Apply the greedy selecton wth the purpose of fnd the best food source vector of the problem. Step 7: If there s any specfc food source solutons are abandoned, and t wll be replaced by a new randomly produced soluton v m for the scout bee usng the equaton (15). Step 8: Memorze the fnest food source poston acheved so far. Step 9: Cycle = Cycle + 1. Step 10: If the number of cycle attans at MCN, Prnt the fnest result of the problem. C. Implementaton of CABC algorthm to optmze the objectve functon The proposed CABC algorthm s developed and executed usng the MATLAB software. The frst mportant aspect of ths algorthm s to assgn the colony sze (CS) = 50, lmt (L) = (CS*D)/2, k = 300 and MCN = 200 of the problem. The CABC algorthm starts by creatng the ntal random populaton of the possble food source solutons. In ths approach, the placement and szng of s n the dstrbuton system are consdered as varable parameters n order to optmze the problem. The placement of s represented as the nteger varable of the problem. In ths connecton wth CABC algorthm can be reformulated by roundng off the food source poston to the nearest nteger. Set the number of cycles and then send the employed bee procedure n order to produce the new soluton. Further, to apply the greedy selecton between current soluton and t s dsturbng. Calculate the probablty of the soluton and send the onlooker bee procedure to adjust the soluton. Send the chaos theory procedure s to mprove the explotaton process of searchng the new food source soluton. To apply the greedy selecton process for both ends of onlookers and chaos theory procedures of the problem. The specfc food source solutons are abandoned by applyng the scout bee procedure to produce the new food source solutons. The generatng random populatons are wthn lmts and satsfed the above mentoned constrants. If the number of cycles reaches at maxmum, the algorthm whch t wll be stop and gves the optmal (or near optmal) value of placement and szng of s n the test systems. 6. Smulaton results To valdate the effectveness and robustness of the proposed CABC algorthm based optmal placement and szng of approach has been tested on usng 33-bus and 69-bus radal dstrbuton systems. The base values used are 100 MVA and KV for both the test systems. The load and lne data of the 33-bus system s taken from the reference [22] and 69- bus system s gven n appendx. The man objectve of ths approach s to reducng the real power loss and mprovng voltage stablty of the test systems wth satsfed constrants. Three unts are optmally placed and szed of the test systems. To express the superorty of ths proposed CABC approach has a smulaton results have been compared wth varous algorthm results n the report, such as genetc algorthm (GA), partcle swarm optmzaton (PSO), GA/PSO n [9], smulated annealng (SA) n [10] and bacteral foragng optmzaton (BFO) n [11]. 684

7 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton A. 33-bus radal system The table 1 shows the results of real power loss, voltage stablty ndex, optmal placement and szng of the s of the system are obtaned by dfferent methods. These results confrm that the CABC approach to obtan the mnmum real power loss s MW (type 1) and MW (type 2) when compared to other methods. Resultant that the real power loss s reduced to % (type 1) and % (type 2) compared to base case condton. For the reducton of real power loss has greatly mproved the voltage profle and performance of the system. The graphcal representaton of the VSI of each node (except substaton) of the system s shown n fgure 1. The mnmum value of VSI s (type 1) and (type 2) of ths approach greatly mproved when compared to the absence of n the system. Fgure 1. Voltage stablty ndex of 33-bus radal system Fgure 1. Voltage stablty ndex of 69-bus radal system B. 69-bus radal system The table 2 shows the results of real power loss, voltage stablty ndex, optmal placement and szng of the s of the system are evaluated by dfferent methods. In ths system, the real power loss has come down to MW (type 1) and MW (type 2) or % (type 1) and % (type 2) when compared to other methods. The mnmum VSI of ths system s (type 1) and (type 2) and t s value of each node as shown n fgure

8 Mohandas Natarajan, et al. Table 1. The performance analyss of 33-bus radal system wth s at dfferent power factors Method P loss (MW) VSI mn Bus no. P (MW) sze Q (MVAr) Base case GA [9] PSO [9] GA/PSO [9] LSFSA [10] BFOA [11] CABC LSFSA [10] BFOA [11] CABC Power factor - Unty Unty Unty Unty Unty Unty Table 2. The performance analyss of 69-bus radal system wth s at dfferent power factors Method P loss (MW) VSI mn Bus no. P (MW) sze Q (MVAr) Base case GA [9] PSO [9] GA/PSO [9] LSFSA [10] BFOA [11] CABC LSFSA [10] BFOA [11] CABC Power factor - Unty Unty Unty Unty Unty Unty

9 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton The tables 1 & 2 show the mnmum real power loss of the test systems determned by the dfferent methods. It s clear that the proposed CABC approach has better performance when compared to exstng technques. As a result of ths confrms that the CABC s well capable of explotaton process of the soluton. Fgure 3a. Convergence characterstcs of 33-bus radal system Fgure 3a. Convergence characterstcs of 33-bus radal system Fgure 3b. Convergence characterstcs of 69-bus radal system The fgures 1 & 2 show the voltage stablty ndex of each node of the test systems whch represent the real power type s better performance when compared to the base case and real (P) and reactve (Q) power nject type much better performance when compared to the above type. The fgure 3 (a & b) gves the convergence characterstcs of the CABC algorthm n terms of real power loss and n whch to get the best optmal soluton for mnmum number of cycles. The convergence curves are presented that the real power type. Moreover, the combnaton of real and reactve power nject type s also approxmately smlar to the convergence characterstcs of real power wth reasonable computatonal tme. 687

10 Mohandas Natarajan, et al. 7. Concluson The CABC algorthm has been developed for the determnaton of optmal placement and szng of s n the test systems. It has been successfully mplemented to the 33-bus and 69- bus systems for the mnmzaton of real power loss and to mproved system voltage stablty. Two dfferent types of unts are separately placed and szed n the test systems for mnmzaton of real power loss. The graphcal representaton of VSI results shows that the system voltage stablty s potentally mproved when the presence of. The comparson of smulaton results wth earler reported methods n the lterature demonstrates the superorty of the proposed algorthm to solve the real power loss mnmzaton of the test systems. The proposed algorthm can be mplemented for the soluton of the large scale system. 8. References [1]. H. Hedayat, S. A. Nabavnak, and A. Akbarmajd, A Method for Placement of Unts n Dstrbuton Networks, IEEE Trans., Power Del., vol. 23, no. 3, pp , July [2]. R. C. Dugan, T. E. McDermott, and G. J. Ball, Plannng for dstrbuted generaton, IEEE Ind. Appl. Mag., vol. 7, no. 2, pp , Mar-Apr [3]. N. Acharya, P. Mahat, and N. Mthulananthan, An analytcal approach for allocaton n prmary dstrbuton network, Electrcal Power and Energy Systems 28, pp , [4]. D. Q. Hung, N. Mthulananthan, and R. C. Bansal, Analytcal Expressons for Allocaton n Prmary Dstrbuton Networks, IEEE Trans. On energy Con., vol. 25, no. 3, pp , Sep [5]. D. Sngh, D. Sngh, and K. S. Verma, GA based Optmal Szng & Placement of Dstrbuted Generaton for Loss Mnmzaton, World Acad., Sc, Engg., and Tech., vol. 1, pp , [6]. M. P. Laltha, V. C. V. Reddy, V. Usha, and N. S. Reddy, Applcaton of fuzzy and PSO for placement for mnmum loss n radal dstrbuton system, ARPN Jour., of Engg., and Appled Sces., vol. 5, no. 4, pp , Apr [7]. M. P. Laltha, V. C. V. Reddy, and N. S. Reddy, Applcaton of fuzzy and ABC for placement for mnmum loss n radal dstrbuton system, Iranan Journal of Elect., & Electronc Engg., vol. 6, no. 4, pp , Dec [8]. M. M. Aman, G. B. Jasmon, H. Mokhls, and A. H. A. Bakar, Optmal placement and szng of a based on a new power stablty ndex and lne losses, Electrcal Power and Energy Systems 43, pp , [9]. M. H. Morad, and M. Abedn, A combnaton of genetc algorthm and partcle swarm optmzaton for optmal locaton and szng n dstrbuton systems, Electrcal Power and Energy Systems 34, pp , [10]. S. K. Injet, and N. P. Kumar, A novel approach to dentfy access pont and capacty of multple s n a small, medum and large scale radal dstrbuton systems, Electrcal Power and Energy Systems 45, pp , [11]. A. M. Imran, and M. Kowsalya, Optmal sze and stng of multple dstrbuted generators n dstrbuton system usng bacteral foragng optmzaton, Swarm and Evolut., Compt., 15 pp , [12]. K. Qan, C. Zhou, M. Allan, and Y. Yuan, Effect of load models on assessment of energy losses n dstrbuted generaton plannng, Elect., Power and Energy Systems 33, pp , [13]. M. Chakravorty, D. Das, Voltage stablty analyss of radal dstrbuton networks, Electrcal Power and Energy Systems 23, pp , [14]. R. Ranjan, B. Venkatesh and D. Das, Voltage Stablty Analyss of Radal Dstrbuton Networks, Elect. Power Comp. and Syst., 31, pp ,

11 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton [15]. D. Thukaram, H.M.W. Banda, and J. Jerome, A robust three-phase power flow algorthm for radal dstrbuton systems, Electrc Power Systems Research 50, pp , [16]. D. Karaboga, and B. Basturk, On the performance of artfcal bee colony (ABC) algorthm, Appled Soft Computng 8, pp , [17]. D. Karaboga, and B. Basturk, A powerful and effcent algorthm for numercal functon optmzaton: artfcal bee colony (ABC) algorthm, Journal of Global Optmzaton 39, pp , [18]. D. Karaboga, and B. Akay, A comparatve study of Artfcal Bee Colony algorthm, Appled Maths., and Comput., 214, pp , [19]. D. Karaboga, and B. Akay, A modfed Artfcal Bee Colony (ABC) algorthm for constraned optmzaton problems, Appled Soft Computng 11, pp , [20]. B. Akay, and D. Karaboga, A modfed Artfcal Bee Colony for real-parameter optmzaton, Informaton Scences 192, pp , [21]. B. Lu, L. Wang, Y. Jn, F. Tang and D. Huang, Improved partcle swarm optmzaton combned wth chaos, chaos solutons and fractals 25, pp , [22]. N. C. Sahoo and K. Prasad, A fuzzy genetc approach for network reconfguraton to enhance voltage stablty n radal dstrbuton systems, Energy Conv. and Managt., 47, pp , Appendx Lne and load data for 69-radal dstrbuton system F T R (p.u.) X (p.u.) P (MW) Q (MVAr)

12 Mohandas Natarajan, et al Mohandas Natarajan, He receved the B.E degree n Electrcal and Electroncs from Madras Unversty and M.E degree n Power Systems from Annamala Unversty, Inda n 2002 and 2008, respectvely. He s workng towards hs Ph.D. n the area of Voltage stablty analyss. Hs areas of nterest nclude network loss mnmzaton, dstrbuted generaton and applcaton of soft computng technques n power system engneerng. He s presently an Assstant Professor n Electrcal engneerng, Annamala Unversty, Annamala Nagar, Tamlnadu, Inda. R. Balamurugan, He receved hs B.E. n Electrcal and Electroncs Engneerng, M.E. n power System and Ph.D n Electrcal Engneerng, from Annamala Unversty, Inda n 1994, 1997 and 2008 respectvely. Hs areas of nterest nclude Dgtal Smulatons of Power Systems, Control Systems, Applcatons of Computatonal Intellgence Technques n Power System Engneerng, and Electrcal Machnes. He s presently an Assstant Professor n Electrcal Engneerng, Annamala Unversty, Annamala Nagar, Tamlnadu, Inda. L. Lakshmnarasmman, He receved hs B.E. n Electrcal and Electroncs Engneerng, M.E. n Power System and PhD n Electrcal Engneerng, from Annamala Unversty, Inda n 1993, 1999 and 2008 respectvely. He s presently an Assocate Professor n Electrcal Engneerng, Annamala Unversty, Annamala Nagar, Tamlnadu, Inda. Hs research nterests nclude power system analyss, power system economcs and applcaton of computatonal ntellgence technques to power system optmzaton problems. He s a member of IEEE and a lfe member of Indan Socety for Techncal Educaton. 690

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons

More information

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

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

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

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

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

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Loss Minimization of Power Distribution Network using Different Types of Distributed Generation Unit

Loss Minimization of Power Distribution Network using Different Types of Distributed Generation Unit Internatonal Journal of Electrcal and Computer Engneerng (IJECE) Vol. 5, o. 5, October 2015, pp. 918~928 ISS: 2088-8708 918 Loss Mnmzaton of Power Dstrbuton etwor usng Dfferent Types of Dstrbuted Generaton

More information

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

Optimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular

More information

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

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Optimal placement of distributed generation in distribution networks

Optimal placement of distributed generation in distribution networks MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol. 3, o. 3, 20, pp. 47-55 ITERATIOAL JOURAL OF EGIEERIG, SCIECE AD TECHOLOGY www.est-ng.com 20 MultCraft Lmted. All rghts reserved Optmal

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application 7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,

More information

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD 90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the

More information

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

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Extended Model of Induction Machine as Generator for Application in Optimal Induction Generator Integration in Distribution Networks

Extended Model of Induction Machine as Generator for Application in Optimal Induction Generator Integration in Distribution Networks Internatonal Journal of Innovatve Research n Educaton, Technology & Socal Strateges IJIRETSS ISSN Prnt: 2465-7298 ISSN Onlne: 2467-8163 Volume 5, Number 1, March 2018 Extended Model of Inducton Machne

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY (IJEET)

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY (IJEET) INTERNTINL JURNL F ELECTRICL ENINEERIN & TECHNLY (IJEET) Internatonal Journal of Electrcal Engneerng and Technology (IJEET), ISSN 0976 6545(rnt), ISSN 0976 6553(nlne) Volume 5, Issue 2, February (204),

More information

Research on Route guidance of logistic scheduling problem under fuzzy time window

Research on Route guidance of logistic scheduling problem under fuzzy time window Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Conductor selection optimization in radial distribution system considering load growth using MDE algorithm

Conductor selection optimization in radial distribution system considering load growth using MDE algorithm ISSN 1 746-7233, England, UK World Journal of Modellng and Smulaton Vol. 10 (2014) No. 3, pp. 175-184 Conductor selecton optmzaton n radal dstrbuton system consderng load growth usng MDE algorthm Belal

More information

OPTIMAL PLACEMENT OF DG IN RADIAL DISTRIBUTION SYSTEM USING CLUSTER ANALYSIS

OPTIMAL PLACEMENT OF DG IN RADIAL DISTRIBUTION SYSTEM USING CLUSTER ANALYSIS OTIMAL LACEMET OF DG I RADIAL DISTRIBUTIO SYSTEM USIG CLUSTER AALYSIS MUDDA RAJARAO Assstant rofessor Department of Electrcal & Electroncs Engneerng,Dad Insttute of Engneerng and Technology, Anakapalle;

More information

VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS

VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS M. Rodríguez Montañés J. Rquelme Santos E. Romero Ramos Isotrol Unversty of Sevlla Unversty of Sevlla Sevlla, Span Sevlla,

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

A Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems

A Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems DOI.703/s40707-013-0003-x STF Journal of Engneerng Technology (JET), Vol. No. 3, Dec 013 A Novel Evolutonary Algorthm for Capactor Placement n Dstrbuton Systems J-Pyng Chou and Chung-Fu Chang Abstract

More information

Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles

Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles 1 Internatonal Congress on Informatcs, Envronment, Energy and Applcatons-IEEA 1 IPCSIT vol.38 (1) (1) IACSIT Press, Sngapore Partcle Swarm Optmzaton wth Adaptve Mutaton n Local Best of Partcles Nanda ulal

More information

Optimum Multi DG units Placement and Sizing Based on Voltage Stability Index and PSO

Optimum Multi DG units Placement and Sizing Based on Voltage Stability Index and PSO Optmum Mult DG unts Placement and Szng Based on Voltage Stablty Index and PSO J. J. Jaman, M.M. Aman 2 jasrul@fe.utm.my, mohsnaman@sswa.um.edu.my M.W. Mustafa, G.B. Jasmon 2 wazr@fe.utm.my, ghauth@um.edu.my

More information

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

Particle Swarm Optimization Based Optimal Reactive Power Dispatch for Power Distribution Network with Distributed Generation Internatonal Journal of Energy and Power Engneerng 2017; 6(4): 53-60 http://www.scencepublshnggroup.com/j/jepe do: 10.11648/j.jepe.20170604.12 ISSN: 2326-957X (Prnt); ISSN: 2326-960X (Onlne) Research/Techncal

More information

ELE B7 Power Systems Engineering. Power Flow- Introduction

ELE B7 Power Systems Engineering. Power Flow- Introduction ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,

More information

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

A Genetic algorithm based optimization of DG/capacitors units considering power system indices

A Genetic algorithm based optimization of DG/capacitors units considering power system indices A Genetc algorthm based optmzaton of DG/capactors unts consderng power system ndces Hossen Afrakhte 1, Elahe Hassanzadeh 2 1 Assstant Prof. of Gulan Faculty of Engneerng, ho_afrakhte@gulan.ac.r 2 Elahehassanzadeh@yahoo.com

More information

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

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization Transent Stablty Constraned Optmal Power Flow Usng Improved Partcle Swarm Optmzaton Tung The Tran and Deu Ngoc Vo Abstract Ths paper proposes an mproved partcle swarm optmzaton method for transent stablty

More information

Optimal choice and allocation of distributed generations using evolutionary programming

Optimal choice and allocation of distributed generations using evolutionary programming Oct.26-28, 2011, Thaland PL-20 CIGRE-AORC 2011 www.cgre-aorc.com Optmal choce and allocaton of dstrbuted generatons usng evolutonary programmng Rungmanee Jomthong, Peerapol Jrapong and Suppakarn Chansareewttaya

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

Combined Economic Emission Dispatch Solution using Simulated Annealing Algorithm

Combined Economic Emission Dispatch Solution using Simulated Annealing Algorithm IOSR Journal of Electrcal and Electroncs Engneerng (IOSR-JEEE) e-iss: 78-1676,p-ISS: 30-3331, Volume 11, Issue 5 Ver. II (Sep - Oct 016), PP 141-148 www.osrjournals.org Combned Economc Emsson Dspatch Soluton

More information

Capacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search

Capacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton

More information

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

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

A Novel Hybrid Bat Algorithm for the Multilevel Thresholding Medical Image Segmentation

A Novel Hybrid Bat Algorithm for the Multilevel Thresholding Medical Image Segmentation RESEARCH ARTICLE Copyrght 2015 Amercan Scentfc Publshers All rghts reserved Prnted n the Unted States of Amerca Journal of Medcal Imagng and Health Informatcs Vol. 5, 1 5, 2015 A Novel Hybrd Bat Algorthm

More information

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

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

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

Population Variance Harmony Search Algorithm to Solve Optimal Power Flow with Non-Smooth Cost Function Populaton Varance Harmony Search Algorthm to Solve Optmal Power Flow wth Non-Smooth Cost Functon B.K. Pangrah 1, V. Ravkumar Pand, Swagatam Das2, and Ajth Abraham3 Abstract. Ths chapter presents a novel

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Branch Exchange Approach to Power Loss Reduction in Reconfiguration Problem of Balanced Distribution Networks

Branch Exchange Approach to Power Loss Reduction in Reconfiguration Problem of Balanced Distribution Networks Int. J. Mech. Eng. Autom. olume, Number 3, 015, pp. 14-149 Receved: December 8, 014; Publshed: March 5, 015 Internatonal Journal of Mechancal Engneerng and Automaton Branch Exchange Approach to Power Loss

More information

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

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

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

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

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

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

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

Evolutionary Computational Techniques to Solve Economic Load Dispatch Problem Considering Generator Operating Constraints Internatonal Journal of Engneerng Research and Applcatons (IJERA) ISSN: 48-96 Natonal Conference On Advances n Energy and Power Control Engneerng (AEPCE-K1) Evolutonary Computatonal Technques to Solve

More information

Wavelet chaotic neural networks and their application to continuous function optimization

Wavelet chaotic neural networks and their application to continuous function optimization Vol., No.3, 04-09 (009) do:0.436/ns.009.307 Natural Scence Wavelet chaotc neural networks and ther applcaton to contnuous functon optmzaton Ja-Ha Zhang, Yao-Qun Xu College of Electrcal and Automatc Engneerng,

More information

Operating conditions of a mine fan under conditions of variable resistance

Operating conditions of a mine fan under conditions of variable resistance Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety

More information

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

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 26 CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 2.1 INTRODUCTION Voltage stablty enhancement s an mportant tas n power system operaton.

More information

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

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

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

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI] Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes

More information

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

Optimal Placement of Unified Power Flow Controllers : An Approach to Maximize the Loadability of Transmission Lines S. T. Jaya Chrsta Research scholar at Thagarajar College of Engneerng, Madura. Senor Lecturer, Department of Electrcal and Electroncs Engneerng, Mepco Schlenk Engneerng College, Svakas 626 005, Taml Nadu,

More information

Optimal Feeder Reconfiguration of Distribution System with Distributed Generation Units using HC-ACO

Optimal Feeder Reconfiguration of Distribution System with Distributed Generation Units using HC-ACO Internatonal Journal on Electrcal Engneerng and Informatcs Volume 6, Number 1, March 014 Optmal Feeder Reconfguraton of Dstrbuton System wth Dstrbuted Generaton Unts usng HC-ACO Manas Ranjan Nayak Deptt.

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

The Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems

The Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems The Convergence Speed of Sngle- And Mult-Obectve Immune Algorthm Based Optmzaton Problems Mohammed Abo-Zahhad Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut,

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

Optimal Multi-Objective Planning of Distribution System with Distributed Generation

Optimal Multi-Objective Planning of Distribution System with Distributed Generation Optmal Mult-Objectve Plannng of Dstrbuton System wth Dstrbuted Generaton M. A. Golar 1 S. Hossenzadeh A. Hajzadeh 3 1 Assocated Professor, Electrcal Engneerng Department, K.N.Toos Unversty of Technology,

More information

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

A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM IJCMA: Vol. 6, No. 1, January-June 2012, pp. 1-19 Global Research Publcatons A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM S. Kavtha and Nrmala

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department

More information

Lecture 20: November 7

Lecture 20: November 7 0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:

More information

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

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

AN EFFICIENT METHOD BASED ON ABC FOR OPTIMAL MULTILEVEL THRESHOLDING *

AN EFFICIENT METHOD BASED ON ABC FOR OPTIMAL MULTILEVEL THRESHOLDING * IJST, Transactons of Electrcal Engneerng, Vol. 6, No. E, pp 7-9 Prnted n The Islamc Republc of Iran, 0 Shraz Unversty AN EFFICIENT METHOD BASED ON ABC FOR OPTIMAL MULTILEVEL THRESHOLDING * S. A. MOHAMMADI,

More information

Thin-Walled Structures Group

Thin-Walled Structures Group Thn-Walled Structures Group JOHNS HOPKINS UNIVERSITY RESEARCH REPORT Towards optmzaton of CFS beam-column ndustry sectons TWG-RR02-12 Y. Shfferaw July 2012 1 Ths report was prepared ndependently, but was

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Journal of Artificial Intelligence in Electrical Engineering, Vol. 2, No. 5, May 2013

Journal of Artificial Intelligence in Electrical Engineering, Vol. 2, No. 5, May 2013 Journal of Artfcal Intellgence n Electrcal Engneerng, Vol. 2, No. 5, May 2013 Mult Objectve Optmzaton lacement of DG roblem for Dfferent Load Levels on Dstrbuton Systems wth urpose Reducton Loss, Cost

More information

A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem

A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem A Hybrd Mutaton-based Artfcal Bee Colony for Travelng Salesman Problem Shma Sabet and Fardad Farokh Islamc Azad Unversty of Central Tehran Branch, Tehran, Iran Emal: sh_sabet25@yahoo.com, f_farokh@auctb.ac.r

More information

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

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng

More information

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) , A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare

More information

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

PARTICLE SWARM OPTIMIZATION BASED OPTIMAL POWER FLOW FOR VOLT-VAR CONTROL ARPN Journal of Engneerng and Appled Scences 2006-2012 Asan Research Publshng Networ (ARPN). All rghts reserved. PARTICLE SWARM OPTIMIZATION BASED OPTIMAL POWER FLOW FOR VOLT-VAR CONTROL M. Balasubba Reddy

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

International Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN

International Journal of Mathematical Archive-3(3), 2012, Page: Available online through   ISSN Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Optimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs

Optimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs Optmal Schedulng Algorthms to Mnmze Total Flowtme on a Two-Machne Permutaton Flowshop wth Lmted Watng Tmes and Ready Tmes of Jobs Seong-Woo Cho Dept. Of Busness Admnstraton, Kyongg Unversty, Suwon-s, 443-760,

More information

A Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach

A Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland

More information

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3,

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, roceedngs of the 0th WSEAS Internatonal Confenrence on ALIED MATHEMATICS, Dallas, Texas, USA, November -3, 2006 365 Impact of Statc Load Modelng on Industral Load Nodal rces G. REZA YOUSEFI M. MOHSEN EDRAM

More information

Credit Card Pricing and Impact of Adverse Selection

Credit Card Pricing and Impact of Adverse Selection Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

Fundamental loop-current method using virtual voltage sources technique for special cases

Fundamental loop-current method using virtual voltage sources technique for special cases Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,

More information

DERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION

DERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION Internatonal Worshop ADVANCES IN STATISTICAL HYDROLOGY May 3-5, Taormna, Italy DERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION by Sooyoung

More information

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

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

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

Statistical Circuit Optimization Considering Device and Interconnect Process Variations Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan

More information