Optimal Reactive Power Dispatch Using Ant Colony Optimization Algorithm
|
|
- Oliver Gibson
- 5 years ago
- Views:
Transcription
1 Proceedngs of the 14 th Internatonal Mddle East Power Systems Conference (MEPCO 10), Caro Unversty, Egypt, December 19-21, 2010, Paper ID 315. Optmal Reactve Power Dspatch Usng Ant Colony Optmzaton Algorthm A. A. Abou El-Ela, A. M. Knawy and M. T. Mouwaf R. A. El Sehemy Department of electrcal Engneerng Department of electrcal engneerng Faculty of engneerng Faculty of engneerng Mnoufya Unversty Kafrelshekh Unversty Egypt Egypt Abstract Ths paper proposes a procedure for solvng the optmal reactve power dspatch (ORPD) problem usng ant colony optmzaton (ACO) algorthm. The objectve of the ORPD s to mnmze the transmsson lne losses under control and dependent varable constrants usng proposed senstvty parameters of reactve power that dependent on a modfcaton of Fast Decoupled Power Flow (FDPF) model. The ACO algorthm s appled to the IEEE standard 14-bus and a real power system at west delta network as a part of the Unfed Egyptan etwork (UE). Smulaton results show the capablty of the proposed ACO algorthm for the ORPD problem compared wth those obtaned usng the conventonal optmzaton technques as lnear programmng (P), genetc algorthm (A) and partcle swarm optmzaton (PSO) technque. Index Terms Ant colony optmzaton, reactve power dspatch. I. ITRODUCTIO ORPD s one of the optmzaton problems n power systems that optmzed the control varables by conventonal, ntellgence and modern optmzaton technques. The objectve functon of ORPD s to mnmze the transmsson lne losses by optmzng the control varables such as generaton voltages, swtchable reactve power and on-load tap changers (OTC) under control and dependent varable constrants. Subbaraj and Rajnarayanan [1] proposed self-adapted real coded genetc algorthm (SARA) to solve optmal reactve power dspatch (ORPD) problem. The selfadaptaton n real coded genetc algorthm (RA) ntroduced by applyng the smulated bnary crossover (SBX) operator, bnary tournament selecton and polynomal mutaton. The problem formulaton nvolves contnuous (generator voltages), dscrete (transformer tap ratos) and bnary (VAR sources) decson varables. Aruna and Devaraj [2] presented real coded genetc algorthm (RA) for solvng the mult-objectve ORPD problem n a power system. Modal analyss of the system used for statc voltage stablty assessment. oss mnmzaton and mzaton of voltage stablty margn taken as the objectves. enerator termnal voltages, reactve power generaton of the capactor banks and tap changng transformer settng taken as the optmzaton varables. Mahadevan and Kannan [3] solved the ORPD problem by mnmzng the actve power losses for a fxed economc power dspatch by adjustng the control varables usng partcle swarm optmzaton (PSO) technque. To overcome the drawback of premature convergence n PSO, a learnng strategy ntroduced n PSO, and ths approach called, comprehensve learnng partcle swarm optmzaton (CPSO) also appled to the proposed problem. Subbaraj and Rajnarayanan [4] proposed a two-phase hybrd PSO approach to solve ORPD problem. In ths hybrd approach, the phase-1 used PSO to explore the optmal regon and the phase-2 appled drect search as local optmzaton technque for fner convergence. Through few recent years, ACO algorthms are employed to solve optmzaton problems n dfferent felds wth more accurate and effcently soluton compared wth conventonal and other modern optmzaton algorthms. akawro and Erlch [5] presented a hybrd method for solvng voltage stablty constraned optmal reactve power dspatch (VSCORPD) problem, wth mnmzng the energy loss at the current tme nterval and the cost of adjustng dscrete control devces whle mantanng system securty and voltage stablty constrants wthn the permssble lmts. An artfcal neural network (A) s traned to approxmate the voltage stablty margn durng the optmzaton process, whle modfed ACO used to solve the VSCORPD. Abbasy and Hossen [6] proposed a novel ACO-based ORPD approach and four dfferent ACO algorthms, ncludng the smple ant system and three of ts drect successors, eltst ant system (AS), rank-based AS and mn AS used to solve the ORPD problem, wth mnmzng the real power loss under decson and dependent varables constrants. In ths paper, an approach s proposed to solve the ORPD problem usng the ACO algorthm, whch based on the behavor of real ants for searchng the shortest route between the colony and the source of food based on the ndrect communcaton meda, called pheromone. The mnmzaton of the transmsson lne losses are consdered as an objectve functon wth control and dependent varable constrants. II. PROBEM FORMUATIO The ORPD problem can be expressed as an optmzaton problem wth the transmsson lne losses that are a functon n the generator voltages and swtchable reactve power, whch are defned as: 960
2 MnΔP ( P / V ) + ( P / Q ) 1 1 P s the objectve functon of the change n transmsson lne losses. V and Q are the changes n the control varables of generaton voltages and swtchable reactve power, respectvely. s the number of generaton buses. s the number of buses whch the swtchable reactve sources are located. ow, the changes n transmsson lne losses wth respect to changes n generator voltage can be derved based on the load flow equatons as; also; S I (2) * j 1 {[ cosδ + B snδ ] + j[ snδ B cosδ ]} V j S P + jq (3) From equatons (2) and (3), the actve power at bus can be formulated as: P [ cos δ + B sn δ ] V j j 1 At, j, equaton (4) can be rewrtten as; P 2 + V [ cos δ + B sn δ ] V j j 1, j ow, the values of P / V and P j / V can be calculated by dfferentatng equaton (5) as: [ cos δ B sn ] V j P / V δ j 2V + + j 1, j j j [ cos δ B sn δ ] P / V j Y -1 / Z +j B ; s the lne admttance between buses and j. δ and δ j are the angles of the voltages at buses and j, respectvely. Also, the change n transmsson lne losses due to changes n swtchable reactve power can be wrtten as: ( P / V )( V Q ) j (7) P / Q / (8) V / Q : s the change of swtchable voltage buses wth respect to change n swtchable reactve power at that bus. The objectve functon (1) s subjected to the followng constrants: a) Control varable constrants eneraton voltage constrants The change n generator voltage must be wthn ther permssble lmts as: mn Δ V (9) (1) (4) (5) (6) V nt mn mn nt nt s the ntal value of the generator voltage at each generator bus. mn V and V are the mnmum and mum of generaton voltages, respectvely. V man and V are the mnmum and mum changes n generaton voltages, respectvely. Swtchable reactve power constrants The change n swtchable reactve power must be wthn ther permssble lmts as: mn Δ Q (10) Δ Q mn mn nt nt Δ Q Q nt s the ntal value of the swtchable reactve power. Q mn and Q are the mnmum and mum of swtchable reactve power, respectvely. Q man and Q are the mnmum and mum changes n swtchable reactve power, respectvely. b) Dependent varable constrants oad voltage constrants The voltage at each load bus must be wthn ther permssble lmts as: Δ V (11) V nt mn mn mn nt nt s the ntal value of the voltage at each load bus. V mn and V are the mnmum and mum of load bus voltages, respectvely. V man and V are the mnmum and mum changes n load bus voltages, respectvely. eneraton reactve power constrants The reactve power of each generator must be wthn ther permssble lmts as: Δ Q Δ Q Δ Q (12) mn mn mn nt nt nt Q s the ntal value of reactve power at generaton buses. 961
3 Q mn and Q are the mnmum and mum values of reactve power at generaton buses, respectvely. man Q and Q are the mnmum and mum changes n reactve power at generaton buses, respectvely. III. PROPOSED SESITIVITY PARAMETERS The FDPF method s one of the load flow methods that assumed the changes n actve power flows due to changes n voltage phase angles are hgher than the changes due to voltage magntudes. On the other hand, the changes n reactve power flows due to changes n voltage magntudes are hgher than the changes due to voltage phase angles. So, t can be wrtten as: [ P/V] [B'] [ δ] and [ Q/V] [B"] [ V] [ P] and [ Q] are the vectors of actve and reactve power msmatches, respectvely. [B'] and [B"] are the susceptance matrces. [ δ] and [ V] are the vectors of changes n voltage angles and magntudes, respectvely. In ths paper, the ORPD problem s based on the second equaton of the FDPF as: [ Q/V] [B"] [ V] (13) B" s the susceptance matrx as: B B " " 1 1 / j 1, j X ; 1,2,..., 1 " B 1/ X ;, j 1,2,..., 1 j X : s the lne reactance between buses and j. ow, equaton (13) can be rewrtten n terms of control and dependent varables as: / V B B (14) / V B B The senstvty parameters between control and dependent varables can be derved based on equaton (14) as fellows: a) The load bus voltages related to control varables o changes n the reactve power at load-bus ( Q 0) The senstvty parameters relatng the changes n loadbus voltages due to the changes n generaton-bus voltages are gven as: Δ V S 1 [ S ] [ B ] [ B ] o changes n generaton voltages ( V 0) (15) The senstvty parameters relatng to the changes n load-bus voltages due to the changes n swtchable reactve power sources can be gven as: Δ V S (16) 1 1 [ S ] [ B ] V and, V s the vector of bus voltages that connected to VAR sources. b) eneraton reactve power related to control varables The senstvty parameters relatng to the changes n generated reactve power due to the changes n generatonbus voltages can be wrtten as: [ B ] + [ B ] Δ Q / V (17) By substtutng from equaton (15) nto (17), we obtan: Δ Q S (18) { [ ] } S B + B S The senstvty parameters relatng to the changes n generated reactve power due to the changes n swtchable reactve power sources can be wrtten as: 1 [ B][ S ] + [ B] / V (19) By substtutng from equaton (16) nto (19), we get: Δ Q S 1 [ S ] {[ B ][ S ] + [ B ]}[ S ] (20) ow, the proposed senstvty between the control and the dependent varables can be formulated based on equatons (15), (16), (18) and (20) n a compact matrx form as: S S Q S Q Δ S Δ IV. ACO AORITHM (21) A random amount of pheromone s deposted n each rout after each ant completes t s tour, anther antes attract to the shortest route accordng to the probablstc transton rule that depends on the amount of pheromone deposted and a heurstc gude functon as equal to the nverse of the dstance between begnnng and endng of each route. The probablstc transton rule of ant k to go from cty to cty j can be expressed as: P α β [ τ ( t) ] [ η ( t) ] α [ τ ( t) ] [ η ( t) ] k ( t) β q q q ; j, q k (22) τ s the pheromone tral deposted between cty and j by ant k, η s the vsblty or sght and equal to the nverse of the dstance or the transton cost between cty and j ( η 1/d ). α and β are two parameters that nfluence the relatve weght of pheromone tral and heurstc gude functon, respectvely. If α0, the closest ctes are more lkely to be selected that correspondng to a classcal greedy algorthm. On the contrary, f β0, the probablty wll be 962
4 depend on the pheromone tral only. These two parameters should be tuned wth each other, q s the ctes that wll be vsted after cty. r k s a tabu lst n memory of ant that recodes the ctes whch wll be vsted to avod stagnatons. After each tour s completed, a local pheromone update s determned by each ant dependng on the route of each ant as n equaton (23), after all ants attractve to the shortest route, a global pheromone update s consdered to show the nfluence of the new addton deposts by the other ants that attractve to the best tour as shown n equaton (24): ( 1 ρ ) τ ( ρτ o τ ( t + 1) t) + (23) ( 1 ρ ) τ ( t) + εδτ ( ) τ ( t + 1) t (24) τ (t+1) s the pheromone after one tour or teraton, ρ s the pheromone evaporaton constant, ε s the elte path weghtng constant, τ o 1 / d s the ncremental value of pheromone of each ant. Whle, τ s the amount of pheromone for elte path as: Δ τ ( t ) 1 / (25) d best d best s the shortest tour dstance. V. ACO AORITHM FOR ORPD PROBEM ACO algorthm s appled to solve the ORPD problem as an optmzaton technque wth control and dependent varable constrants where artfcal ants travels n search space to fnd the shortest route that havng the strongest pheromone tral and a mnmum objectve functon. Our objectve n ths paper s to mnmze the change n power losses as descrbed n (1) wth control varable constrants n (9) and (10), and dependent varable constrants n (11) and (12). So that, the heurstc gude functon s the nverse of the ndvdual change n losses of each ant that postoned n the reasonable lmt of the control varable to the vsblty of each ant. Whle, heurstc gude functon of the problem s the nverse of the total change n losses at teraton t +1, as: η ( t + 1) 1/ ( P / V ) + ( P / Q ) (26) 1 1 In ACO algorthm, a search space creates wth dmensons of stages on number of control varables and states or the randomly dstrbuted values of control varables wth n a reasonable threshold. Artfcal ants leaves colony to search randomly n the search space based on the probablty n (22) to complete a tour matrx that conssts of the postons of ants wth the same dmenson of the search space. Then, tour matrx s appled on the objectve functon to fnd a heurstc gude functon to fnd the best soluton and update local and global pheromone to begn a next teraton. System parameters are adjusted by tral and error to fnd the best values of theses parameters. The ACO algorthm can be appled to solve the ORPD problem usng the followng seven steps: Step 1: Intalzaton Insert the lower and upper boundares of each control varable [( V mn, V ) and ( Q mn, Q )], system parameters, and create a search space wth a dmensons of number of control varables ( V, Q ) and the length of randomly dstrbuted values wth the same dmenson of the ntal pheromone that contans elements wth very small equal values to gve all ants wth the same chance of searchng. Step 2: Provde frst poston Each ant s postoned on the ntal state randomly wthn the reasonable range of each control varable n a search space wth one ant n each control varable n the length of randomly dstrbuted values. Step 3: Transton rule Each ant decde to vst a next poston n the range of other control varables accordng to the probablty transton rule n equaton (22) that depends on the amount of pheromone deposted and the vsblty that s the nverse of objectve functon (26). the effect of pheromone and vsblty on each other depends on the two parameters α and β. Step 4: ocal pheromone updatng ocal updatng pheromone s dfferent from ant to other because each ant takes a dfferent route. The ntal pheromone of each ant s locally updated as n (23). Step 5: Ftness functon After all ants attractve to the shortest path that havng a strongest pheromone, the best soluton of the objectve functon s obtaned Step 6: lobal pheromone updatng Amount of pheromone on the best tour becomes the strongest due to attractve of ants for ths path. Moreover, the pheromone on the other paths s evaporated n tme. Step 7: Program termnaton The program wll be termnated when the mum teraton s reached or the best soluton s obtaned wthout the ants stagnatons. The proposed procedure steps are shown n Fg. 1. A. Test Systems VI. APPICATIOS The standard IEEE 14-bus system [7] and a real power system at West Delta network as a part of the Unfed Egyptan etwork (UE) [8] are used to show the capablty of ACO algorthm for solvng solve the ORPD problem. The MVA base s taken 100 and the cost of power losses s assumed 0.07 E.P. /KWh whle, the cost of reactve power s assumed 15 E.P. /KVar. 963
5 Start Intalzaton; Insert parameters, control lmts and ntal pheromone enerate the ntal poston randomly of each ant Apply state transton rule Apply local pheromone updatng rule Intal value of load voltages V Vmn o Ftness functon evaluaton Apply global pheromone updatng rule Max ter. s reached Yes oad buses Fg. 3 Intal values of load voltages for west delta system B. Results and Comments The results of the ACO algorthm are obtaned usng the Matab code verson 7.1 that setup on a Pentum 4, 3.0 Hz PC, 0.99 B of RAM. Stop Fg. 1 Flow chart the proposed ACO algorthm The results obtaned are compared wth those obtaned usng a conventonal lnear programmng (P), A and PSO technque. The best values of ACO algorthm parameters are α 1, β5 ρ0.5 and ε5. The load flow s done usng the ewton-raphson load flow to get the values of power loss that are and MW for 14-bus and west delta system, respectvely. Fgures 2 and 3 show the mnmum, mum lmts and ntal values of control and dependent varables for 14-bus test system and West Delta system. IEEE 14-bus test system Tables I, II and Fg. 4 show the ORPD usng dfferent optmzaton technques. Table I shows the results of control varables (V and Q ) and dependent varables (Q ). Whle, Fg. 4 shows the other dependent varables of load bus voltages (V ) that elmnate the voltage volatons usng A, PSO and ACO. Whle, buses 6 and 8 are stll volated ther lmts usng the conventonal P. Table II shows the results of power loss, cost of power loss (CP), root mean square of load-bus voltage devaton wth respect to the flat voltage (V.D.) rms, reactve power reserve (RPR) and cost of the connected reactve power (CRP). In Table II and Fg. 4, the ACO algorthm has mnmum values of power loss, CP, (V.D.) rms and CRP compared wth other technques. In addton, t has the mum value of RPR compared wth other technques. Intal value of load voltages V oad buses Fg. 2 Intal values of load voltages for 14-bus system TABE I COTRO AD DEPEDET VARIABES USI DIFFERET TECHIQUES FOR 14-BUS SYSTEM. Varables P A PSO ACO V V Q Q Q Q TABE II A COMPARISO BETWEE DIFFERET OPTIMIZATIO TECHIQUES FOR 14-BUS SYSTEM. Varables P A PSO ACO Power oss (pu.) CP ( EP) (V.D.)rms RPR CRP ( EPx103)
6 oad bus voltage (pu.) V Vmn. P A PSO ACO oad buses Fg. 4 oad bus voltage usng dfferent technques for 14-bus system West delta system Tables III, IV and Fg. 5 show the ORPD usng dfferent optmzaton technques. Table III shows the results of control varables (V ) and dependent varables (Q ), whle Fg. 5 shows the other dependent varables of load bus voltage (V ). In Table IV, the ACO algorthm has mnmum values of power loss wth mnmum cost and mnmum voltage devaton compared wth other technques. Also, the load voltages based on ACO algorthm are the nearest to the flat voltage compared to the other technques. TABE III COTRO AD DEPEDET VARIABES USI DIFFERET TECHIQUES FOR WEST DETA SYSTEM. Varables P A PSO ACO V V V V V V V V Q Q Q Q Q Q Q Q TABE IV A COMPARISO BETWEE DIFFERET OPTIMIZATIO TECHIQUES FOR WEST DETA SYSTEM Varables P A PSO ACO Power oss (pu.) CP ( EP) (V.D.)rms oad bus voltage (pu.) V Vmn P A PSO ACO oad buses Fg. 5 oad bus voltage usng dfferent technques for west delta system VII. COCUSIO Ths paper presents an ORPD based on ACO algorthm. The objectve of the ORPD s to mnmze the transmsson lne losses under control and dependent varable constrants whch are proposed senstvty parameters of reactve power that depend on a modfcaton of Fast Decoupled Power Flow (FDPF) model. Three test systems have been used to show the capablty of the proposed algorthm compared wth other conventonal P, A and PSO. The ACO algorthm leads to mnmum power losses wth mnmzng of voltage devaton, cost of swtchable reactve power and mzng reactve power reserve compared to the other proposed algorthms. So, the proposed ACO algorthm gves more accurate and effcently soluton for ORPD problem.. Moreover, the proposed algorthm represents a potental tool to ad the power system operators n the on-lne envronment. REFERECES [1] P. Subbaraj and P.. Rajnarayanan, "Optmal Reactve Power Dspatch Usng Self-Adapted Real Coded enetc Algorthm", Electrc Power Systems Research, Vol. 79, o. 2, pp , February [2] P. Aruna Jeyanthy and D. Devaraj, "Optmal Reactve Power Dspatch for Voltage Stablty Enhancement Usng Real Coded enetc Algorthm", Internatonal Journal of Computer and Electrcal Engneerng, Vol. 2, o. 4, pp , August [3] K. Mahadevan and P. S. kannan, "Comprehensve earnng Partcle Swarm Optmzaton for Reactve Power Dspatch Electrc Power Systems Research, Vol. 10, o. 2, pp , March [4] P. Subbaraj and P.. Rajnarayanan, "Hybrd Partcle Swarm Optmzaton Based Optmal Reactve Power Dspatch", Internatonal Journal of Computer Applcatons, Vol. 1, o. 5, pp , February [5] W. akawro and I. Erlch, "A Hybrd Method for Voltage Stablty Constraned Optmal Reactve Power Dspatch", IEEE Power and Energy Socety eneral Meetng, pp. 1-8, July [6] A. Abbasy and S. H. Hossen, "Ant Colony Optmzaton-Based Approach to Optmal Reactve Power Dspatch: A Comparson of Varous Ant Systems", IEEE Power Engneerng Socety (PES) Conference and Exposton, pp. 1-8, July, South Afrca, [7] Washngton Unversty Webste: [8] A. A. Abou El-Ela, S. M. Allam and M. M. Shatla, "Maxmal Optmal Benefts of Dstrbuted eneraton Usng enetc Algorthms ", Electrc Power Systems Research, Vol. 80, o. 7, pp , July
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 informationChapter - 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 informationComparative 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 informationCHAPTER 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 informationThe 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 informationPARTICLE 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 informationA 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 informationEfficient Reactive Power Management via Enhanced Differential Evolution Algorithm with Adaptive Penalty Factor
Effcent Reactve Power Management va Enhanced Dfferental Evoluton Algorthm wth Adaptve Penalty Factor W. S. Sakr Ragab A.E-Sehemy Ahmed M. Azmy Electrcal Engneerng Department Faculty of Engneerng, Kafrelshekh
More informationOptimal Reactive Power Dispatch Using Efficient Particle Swarm Optimization Algorithm
Optmal Reactve Power Dspatch Usng Effcent Partcle Swarm Optmzaton Algorthm MESSAOUDI Abdelmoumene *, BELKACEMI Mohamed ** *Electrcal engneerng Department, Delfa Unversty, Algera ** Electrcal engneerng
More informationCHAPTER 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 informationMarkov 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 informationTransient 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 informationLecture 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 informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationChapter 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 informationELE 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 informationEEL 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 informationEnergy Conversion and Management
Energy Converson and Management 49 (2008) 3036 3042 Contents lsts avalable at ScenceDrect Energy Converson and Management ournal homepage: www.elsever.com/locate/enconman Modfed dfferental evoluton algorthm
More informationModule 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 informationParticle 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 informationStochastic Weight Trade-Off Particle Swarm Optimization for Optimal Power Flow
Stochastc Weght Trade-Off Partcle Swarm Optmzaton for Optmal Power Flow Luong Dnh Le and Loc Dac Ho Faculty of Mechancal-Electrcal-Electronc, Ho Ch Mnh Cty Unversty of Technology, HCMC, Vetnam Emal: lednhluong@gmal.com,
More informationOptimal 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 informationStatic security analysis of power system networks using soft computing techniques
Internatonal Journal of Advanced Computer Research (ISSN (prnt): 49-777 ISSN (onlne): 77-797) Statc securty analyss of power system networks usng soft computng technques D.Raaga Leela 1 Saram Mannem and
More informationA 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 informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationApplication of Gravitational Search Algorithm for Optimal Reactive Power Dispatch Problem
Applcaton of Gravtatonal Search Algorthm for Optmal Reactve Power Dspatch Problem Serhat Duman Department of Electrcal Eucaton, Techncal Eucaton Faculty, Duzce Unversty, Duzce, 8620 TURKEY serhatuman@uzce.eu.tr
More informationA 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 informationDesign 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 informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationSingle-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 informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationCapacitor 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 informationMMA 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 informationPopulation 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 informationFUZZY 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 informationDifferential Evolution Immunized Ant Colony Optimization Technique in Solving Economic Load Dispatch Problem
Engneerng, 013, 5, 157-16 do:10.436/eng.013.51b09 Publshed Onlne January 013 (http://www.scrp.org/journal/eng) Dfferental Evoluton Immunzed Ant Colony Optmzaton Technque n Solvng Economc Load Dspatch Problem
More informationCHAPTER 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 informationA NEW METHOD TO INCORPORATE FACTS DEVICES IN OPTIMAL POWER FLOW USING PARTICLE SWARM OPTIMIZATION
Journal of Theoretcal and Appled Informaton Technology 5-9 JATIT. All rghts reserved. www.att.org A NEW METHOD TO INCORPORATE FACTS DEVICES IN OPTIMAL POWER FLOW USING PARTICLE SWARM OPTIMIZATION 1 K.CHANDRASEKARAN
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationProceedings 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 informationA 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 informationLecture 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 informationEEE 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 informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationEvolutionary Multi-Objective Environmental/Economic Dispatch: Stochastic vs. Deterministic Approaches
Evolutonary Mult-Objectve Envronmental/Economc Dspatch: Stochastc vs. Determnstc Approaches Robert T. F. Ah Kng, Harry C. S. Rughooputh and Kalyanmoy Deb 2 Department of Electrcal and Electronc Engneerng,
More informationEvolutionary 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 informationA 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 informationLecture 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 informationInternational Journal on Electrical Engineering and Informatics Volume 4, Number 4, December 2012
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
More informationOn 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 informationSteady state load-shedding by Alliance Algorithm
Steady state load-sheddng by Allance Algorthm V. Calderaro, V. Gald, V. Lattarulo, A. Pccolo, P. Sano Department of Informaton and Electrcal Engneerng, Faculty of Engneerng, Salerno Unversty, Italy Abstract-Ths
More informationAn 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 informationParticle 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 informationArmy Ants Tunneling for Classical Simulations
Electronc Supplementary Materal (ESI) for Chemcal Scence. Ths journal s The Royal Socety of Chemstry 2014 electronc supplementary nformaton (ESI) for Chemcal Scence Army Ants Tunnelng for Classcal Smulatons
More informationAN EVOLUTIONARY PROGRAMMING APPLICATION TO OPTIMAL REACTIVE POWER DISPATCH
U.P.B. Sc. Bull., Seres C, Vol. 72, Iss. 1, 2010 ISSN 1454-234x AN EVOLUTIONARY PROGRAMMING APPLICATION TO OPTIMAL REACTIVE POWER DISPATCH Florn IONESCU 1, Constantn BULAC 2, Ioana PISICĂ 3, Ion TRISTIU
More informationFeature 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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationOptimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm
World Essays Journal / 5 (): 40-45 07 07 Avalable onlne at www. worldessaysj.com Optmal Allocaton of FACS Devces to Enhance otal ransfer Capablty Based on World Cup Optmzaton Algorthm Farzn mohammad bolbanabad
More informationOptimal Reactive Power Dispatch Considering FACTS Devices
Leonardo Journal of Scences ISSN 1583-0233 Issue 18, January-June 2011 p. 97-114 Optmal Reactve Power Dspatch Consderng FACTS Devces Ismal MAROUANI *, Tawfk GUESMI, Hsan HADJ ABDALLAH and Abdarrazak OUALI
More informationVOLTAGE 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 informationOPTIMAL POWER FLOW USING PARTICLE SWARM OPTIMIZATION
Internatonal Journal of Engneerng Scences & Emergng Technologes, Dec. 212. OPTIMAL POWER FLOW USING PARTICLE SWARM OPTIMIZATION M. Lakshmkantha Reddy 1, M. Ramprasad Reddy 2, V. C. Veera Reddy 3 1&2 Research
More informationDetermining 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 informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationInteractive 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 informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationGeneralized 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 informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More informationSolving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study
Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test
More informationOptimal 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 informationFirefly Algorithm based Optimal Reactive Power Flow
ISSN (e): 50 3005 olume, 06 Issue, 0 February 016 Internatonal Journal o Computatonal Engneerng Research (IJCER) Frely Algorthm based Optmal Reactve Power Flow G. K. Moorthy 1, R. K. Santh, S. M. Alamelunachappan
More informationConductor 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 information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationResearch Article Multiobjective Economic Load Dispatch Problem Solved by New PSO
Advances n Electrcal Engneerng Volume 2015, Artcle ID 536040, 6 pages http://dx.do.org/10.1155/2015/536040 Research Artcle Multobjectve Economc Load Dspatch Problem Solved by New PSO Nagendra Sngh 1 and
More informationResource 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 informationSome 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 informationECONOMIC DISPATCH SOLUTION USING A REAL-CODED GENETIC ALGORITHM
Acta Electrotechnca et Informatca o. 4, Vol. 5, 005 ECOOMIC DISATCH SOLUTIO USI A REAL-CODED GEETIC ALGORITHM * Hamd BOUZEBOUDJA, ** Abdelkader CHAKER, *** Ahmed ALLALI, **** Bakhta AAMA * Electrotechncal
More informationEconomic dispatch solution using efficient heuristic search approach
Leonardo Journal of Scences Economc dspatch soluton usng effcent heurstc search approach Samr SAYAH QUERE Laboratory, Faculty of Technology, Electrcal Engneerng Department, Ferhat Abbas Unversty, Setf
More informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationSOLVING 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 informationUncertainty 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 informationOptimal 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 informationCollege 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 informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationA Modified Approach for Continuation Power Flow
212, TextRoad Publcaton ISSN 29-434 Journal of Basc and Appled Scentfc Research www.textroad.com A Modfed Approach for Contnuaton Power Flow M. Beragh*, A.Rab*, S. Mobaeen*, H. Ghorban* *Department of
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationCOMPARISON 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 informationHYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE
Internatonal Journal of Fuzzy Logc Systems (IJFLS) Vol.2, No., February 22 HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Amt Saraswat and Ashsh San 2 Department
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationOptimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement using CABC
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
More informationDifferential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow
1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental
More informationTHE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS
Nnth Internatonal IBPSA Conference Montréal, Canada August 5-8, 2005 THE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS Jonathan Wrght, and Al Alajm Department
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationAn Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment
An Integrated Asset Allocaton and Path Plannng Method to to Search for a Movng Target n n a Dynamc Envronment Woosun An Mansha Mshra Chulwoo Park Prof. Krshna R. Pattpat Dept. of Electrcal and Computer
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? + + + + + + + + + Intuton of Margn Consder ponts
More informationAnt Colony Optimization 209
Ant Colony Optmzaton 9 14 x Ant Colony Optmzaton Benlan Xu, Jhong Zhu and Qnlan Chen Changshu Insttute of Technology Chna 1. Introducton Swarm ntellgence s a relatvely novel approach to problem solvng
More information