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

Size: px
Start display at page:

Download "Multiobjective Generation Dispatch using Big-Bang and Big-Crunch (BB-BC) Optimization"

Transcription

1 Internatonal Journal of Electrcal Engneerng. ISSN Volume 4, Number 5 (20), pp Internatonal Research Publcaton House Multobjectve Generaton Dspatch usng Bg-Bang and Bg-Crunch (BB-BC) Optmzaton C.V. Gopala Krshna Rao and 2 G. Yesuratnam Assocate Professor, E.E.E. Dept., M.V.S.R. Engneerng College, Hyderabad, Inda E-mal: 2 Assocate Professor, EE Dept, Unversty College of Engneerng, Osmana Unversty, Hyderabad, Inda E-mal: ratnamgy2003@yahoo.co.n Abstract Bg Bang and Bg Crunch (BB-BC) optmzaton method for multoptmzaton of economc load dspatch and emsson dspatch of thermal power generatng statons s presented usng weghted sum method, trade-off solutons are obtaned assumng decson makers (DM) requrements by solvng optmal power flows. BB-BC optmzaton whch s a non- dervatve, populaton search optmzaton procedure developed based on Unversal Evoluton, s smple to code and fast optmzaton method trade-off (pareto) soluton obtaned by BB-BC s compared wth well researched most popular PARTICLE SWARM OPTIMIZATION for two typcal power system networks, IEEE-25(Gangour) and IEEE-30 bus systems. Outcome of comparson suggests that BB-BC optmzaton solutons are as superor as PSO Keywords: multobjectve, Bg-Bang-Crunch optmzaton trade-off (Pareto). Introducton Multobjectve optmzaton n power systems s to obtan multple Non-nferor solutons for steady state and dynamc operatng condtons of power system so that Decson Maker (DM) can select one of the best optons for power system operaton. Multobjectve optmzaton n power system can be obtaned for cost mnmzaton of thermal emsson, voltage devatons, power lne thermal lmts etc. Mnmzaton of these functons has to be done by satsfyng varous equalty, n-equalty and operatonal constrants of the power system. Real and reactve power optmzaton are

2 556 C.V. Gopala Krshna Rao and G. Yesuratnam carred out by energy computng centres to arrve at best settngs of generator out puts, specfed voltages of the generators, ratngs and control settngs of power system compensatng devces[,2]. Now-a-days, due to ncreased publc awareness of envronmental protecton and strngent rules by polluton control boards, many researchers explored the optmzaton of power system network for combned economc/ emsson power dspatch [ 3]. Assumng thermal power generaton (whch contrbute major electrc power to the grd), creates thermal emsson such as N OX,S OX and C O2, ncluson of these emssons along wth cost functon leads to multobjectve optmzaton. It s well known fact that there exsts a trade-off between cost of power generaton and Emsson of polluton. DM of energy control system has to depend on multobjectve optmzaton to decde the settngs of the power generator. Many researchers nvestgated varous tradtonal [4] and non-tradtonal optmzaton methods to obtan relable and fast trade-off solutons. Non-tradtonal optmzaton methods such as Genetc Algorthms and ther varants [5], Smulated Annealng [6], Partcle Swarm Optmzaton (PSO) [7], etc wth varous modfcatons are successfully appled to obtan trade-off solutons. These methods may be consdered as non-classcal, unorthodox and stochastc search optmzaton algorthms, known as Evolutonary Algorthms (EA). EA use a populaton of solutons n each teraton nstead of a sngle soluton. If an optmzaton problem has multple optmal solutons, EA can be used to capture multple optmal solutons n ts fnal populaton. Ths ablty of populaton based optmzaton methods to fnd multple optmal solutons n one sngle smulaton run makes these methods unque n solvng multobjectve optmzaton problems. Evolutonary Methods are partcularly requred when functon to be optmzed s dscontnuous such as ramp cost functons wth valve pont loadng [8]. Among stochastc search methods, PSO has ganed utmost popularty for many optmzaton problems of power system due ts smple code and ablty to tune both for local and global search n soluton space[9 ].To the lst of non-tradtonal methods, the recent contrbuton of Optmzaton method s Bg Bang- and Bg-Crunch(BB- BC), developed by Erol and Eksn [ 0]. Ths optmzaton s based on the concept of unversal evoluton. Accordng to ths theory, n the Bg Bang phase, energy dsspaton produces dsorder and randomness. In the Bg Crunch phase, randomly dstrbuted partcles are drawn nto an order. The Bg Bang Bg Crunch (BB BC) Optmzaton method smlarly generates random ponts n the Bg Bang phase and shrnks (draw) these ponts to a sngle representatve pont va a centre of mass n the Bg Crunch phase. After a number of sequental Bg Bangs and Bg Crunches where the dstrbuton of randomness wthn the search space durng the Bg Bang becomes smaller and smaller about the average pont computed durng the Bg Crunch, the algorthm converges to a soluton. The BB BC method has been shown to outperform the enhanced classcal Genetc Algorthm for many benchmark test functons []. In ths paper an effort s made to compare trade -off soluton between economc power dspatch and emsson dspatch (multobjectve optmzaton) by thermal power statons by BB-BC and PSO. To compare the two optmzaton methods two practcal power system networks IEEE-25bus test system (Gangour ), standard IEEE-30 bus test system are consdered

3 Multobjectve Generaton Dspatch 557 to obtan trade-off Soluton between cost of power generaton mnmzaton and thermal emsson. BB-BC trade off solutons are compared wth PSO trade-off solutons. The outcome of the comparson clearly ndcates the effectveness of BB- BC optmzaton for trade-off solutons of power systems. Ths paper s organzed as follows: secton2 presents an overvew of multobjectve optmzaton. In Secton3, multobjectve formulaton of mnmum cost dspatch and mnmum emsson dspatch along wth weghted sum formulaton of combned functon s presented. In Secton 4, optmzaton concept of BB (Bg Bang) phase and BC (Bg Crunch),s explaned. Lke all EA optmzatons, BB-BC s also unconstraned optmzaton; hence, Secton V deals wth tacklng of constrants of power system n optmzaton functon and also explans the BB-BC algorthm. Results are dscussed n secton 6, along wth test cases Consdered for smulaton. Conclusons are made n Secton 7. Multobjectve optmzaton Engneerng desgn often deals wth multple, possbly conflctng, objectve functons or desgn crtera. As an example, one may want to maxmze the performance of a system whle mnmzng ts cost. Such desgn problems are the subject of multobjectve optmzaton and can generally be formulated as: mn J(x,p) subject to g(x,p) 0 h(x,p) = 0 J=[J (x),,..j z (x)] T x=[x,,..x n ]T () g=[g (x),..g m (x)] T h=[h (x)..h m2 (x)] T In equaton (), J s an objectve functon vector, x s a desgn vector, p s a vector of fxed parameters, g s an nequalty constrant vector and h s an equalty constrant vector. There are z objectves, m nequalty constrants and m2 equalty constrants. Compared to sngle objectve problems, multobjectve problems are more dffcult to solve, snce there s no unque soluton. There s a set of acceptable trade-off optmal solutons. Ths set s called Pareto front. The preferred soluton, the one most desrable to the DM, s selected from the Pareto set. The Pareto set allows the decson maker to make an nformed decson by observng a wde range of optons snce t contans the solutons that are optmum from an overall standpont. A vector of decson varable s Pareto Optmal f there s no feasble vector of decson varables x whch wll decrease some crteron wthout causng a smultaneous ncrease n at least one another crteron. One of the most wdely used methods for solvng multobjectve optmzaton problems s to transform a multobjectve problem nto a seres of sngle objectve problems. The weghted sum method s a tradtonal method

4 558 C.V. Gopala Krshna Rao and G. Yesuratnam that parametrcally changes the weghts among the objectve functons to obtan the Pareto front. The weght of an objectve can be chosen n proporton to the objectve s relatve mportance n the problem. ε-constrant method, weghted metrc methods, value functon methods, goal programmng methods are some of the other avalable methods [2]. For the power system studes, presented n ths paper, the weghted sum method for multobjectve optmzaton s used. Formulaton for Power System Studes For the power system studes presented n ths paper, two goals (objectves) are consdered for optmzaton, they.economc Dspatch 2.Mnmum Emsson Levels of thermal generators of Electrcal Power transmsson system. In the multobjectve optmzaton, these two objectves are combned nto a sngle objectve functon usng the weghted sum method. Economc Dspatch The optmum power flow can be expressed as constraned optmzaton Problem [ ] requrng the optmzaton of f=f(x,u) Subject to g(x,u)=0 (2) h(x,u) 0 u mn u u max x mn x x max In the above equatons, f (x, u) s the scalar objectve functon, g(x, u) represents non- lnear equalty constrants (power flow equatons), and h(x,u) s the non-lnear nequalty constrant of vector arguments x and u. The vector x conssts of dependent varables (for example bus voltage magntudes and phase angles). The vector u conssts of control varable (for example, real power generaton). Specfcally, when the objectve s to mnmze the total fuel cost, the objectve functon can be expressed as the sum of the fuel cost for all the avalable generatng unts: ( x u) f, = Ng = a + b P + c P g 2 g where Ng s total number of generators P g are the output of generators a, b, c are the cost coeffcents of the generators Mnmum Emsson of Thermal unts The atmospherc emsson can be represented by a functon that lnks emssons wth (3)

5 Multobjectve Generaton Dspatch 559 the power generated by every unt. Combned S O2 and N O x emsson s a functon of generator output and s expressed as follow. 2 2 ( x u) = ( α + βpg + γ Pg + χ sn( λ Pg)) f, Ng = (4) Whereα, β, γ, χ, λ are emsson coeffcents of the generators The combned optmzaton functon wth weghted objectves s f ( x, u) =wt* f ( x, u) +(-wt)* f 2 ( x, u) (5) Where wt can assume any value n the range (to 0).wt=, the combned Optmzaton performs economc cost dspatch, wt=0, the combned optmzaton performs economc emsson dspatch. For any other value of wt optmzaton s obtaned for trade of soluton (Pareto) between the objectves consdered. Bg-Bang and Bg-Crunch (BB-BC) The BB BC method developed by Erol and Eksn conssts of two phases: a Bg Bang phase, and a Bg Crunch phase. In the Bg Bang phase, canddate solutons are randomly dstrbuted over the search space. Smlar to other evolutonary algorthms, ntal solutons are spread all over the search space n a unform manner n the frst Bg Bang. Erol and Eksn assocated the random nature of the Bg Bang to energy dsspaton or the transformaton from an ordered state (a convergent soluton) to a dsorder or chaos state (new set of soluton canddates).randomness can be seen as equvalent to the energy dsspaton n nature whle convergence to a local or global optmum pont can be vewed as gravtatonal attracton. Snce energy dsspaton creates dsorder from ordered partcles, we wll use randomness as a transformaton from a converged soluton (order) to the brth of totally new soluton canddates (dsorder or chaos).the proposed method s smlar to the Genetc Algorthm n respect to creatng an ntal populaton randomly. The creaton of the ntal populaton randomly s called the Bg Bang phase. In ths phase, the canddate solutons are spread all over the search space n a unform manner.the Bg Bang phase s followed by the Bg Crunch phase. The Bg Crunch s a convergence operator that has many nputs but only one output, whch s named as the centre of mass, snce the only output has been derved by calculatng the centre of mass. Here, the term mass refers to the nverse of the mert functon value. The pont representng the centre of mass that s denoted by u c s calculated accordng to: u c = N f = N f = u / (6) Where u s control varable n n-dmensonal search space generated, f s a ftness functon value of u, N s the populaton sze n Bg Bang phase. After the Bg

6 560 C.V. Gopala Krshna Rao and G. Yesuratnam Crunch phase, the algorthm creates the new solutons to be used as the Bg Bang of the next teraton step, by usng the prevous knowledge (centre of mass).ths can be accomplshed by spreadng new off-sprngs around the centre of mass usng a normal dstrbuton (randn) operaton n every drecton, where the standard devaton of ths normal dstrbuton functon decreases as the number of teratons of the algorthm ncreases: ( u * randn) k unew = uc + lmt / (7) Where, u lmt are the maxmum and mnmum lmts of control varables. randn s random normal number between - and. k = (teraton number+). Applcaton of BB-BC to power system studes BB-BC s an unconstraned optmzaton functon. In general, Optmzaton of power system wth problem specfc control varables u ( P g,e g,taps,etc) has to satsfy equalty g(x,u)(power flow equatons), In-equalty constrants h(x,u) h lmt (Branch flow lmts, generator reactve power lmts, slack bus real power output), x(voltage magntude and Phase angle of the load bus bars). In ths paper, real power output of the Generator except slack bus real power output are control varables. Reactve power lmts of the generator are handled n the power flow algorthm pv-pq bus type swtchng. Real power flows of the transmsson branches and slack bus power.e h(x, u) are satsfed by usng penalty functon method. There fore, the combned objectve functon gets transformed to unconstraned functon ff as follows n 2 b f ( x, u ) + pen ( (, ) ) ( ) 2 b h lmt h x u + pen s PGslmt PGs (8) b = Where pen b s penalty for branch real power flow volatons. Pen s s penalty for slack real power generaton. Operatonal varables (x) for specfed loads are calculated by Newton-Raphson (NR) Power flow algorthm. The pseudo code of the BB-BC appled s gven below Step : Generate ntal canddates n a random manner P g s Step 2: Solve NR Power flow and obtan voltage solutons, Calculate the ftness functon (ff) values of all the canddate solutons. Step 3: Fnd the centre of the mass p gc usng equaton 6. Step 4: Calculate new canddates around the centre of the mass usng equaton -7. Bound the control varables wthn the lmts, f control varables volate the lmts.

7 Multobjectve Generaton Dspatch 56 Step 5: Untl meetng a stoppng crteron, return to step 2. The above algorthm has to be repeated for all wt s (trade-off) of the DM. Partcle Swarm Optmzaton (PSO) s a heurstc search technque that smulates the movements of a flock of brds whch am to fnd food. The relatve smplcty of PSO and the fact that t s a populaton-based technque have made t a natural canddate to be extended for multobjectve optmzaton. PSO optmzaton algorthm requres Optmzaton parameters constrcton factor (cf) and nerta weght (w) to enhance the local and global search. In ths paper, mplementaton of PSO and selecton of tunng parameters for PSO are as explaned n ref [7]. Dscusson of Smulaton Results To test the BB-BC and PSO for multobjectve optmzaton as per the algorthms explaned above, a MATLAB code s wrtten, and s executed on Intel Pentum V, 2.8 GHz. Test cases consdered for smulaton are as follows. Test case IEEE-25bus system(gangour),35 transmsson lnes,5 generators wth generator as slack generator lne data, bus data, cost and NOx emsson coeffcents of the system s avalable [ 2].Total real power load 7.25 p.u and reactve power load s 2.23 p.u. Test case 2 IEEE-30 bus standard test system, 4 transmsson lnes, wth 6 generatng unts, two fxed shunts, and four transformers wth generator as slack generator. The bus and lne data of ths system s avalable [3], Cost coeffcents and combned N O x, and S O2 coeffcents are taken from [7]. Total real power load p.u and reactve power load s.2620 p.u. Test case : Decson makers choce for trade-off vector s assumed as wt= [, 0.8, , 0]; In combned objectve functon of equaton (5) consdered wt=, optmzes mnmum cost dspatch, where as wt=0, optmzes for mnmum emsson dspatch. As The wt departs from tends towards 0, multobjectve functon gves weghtage towards mnmum emsson dspatch and pcks those generators whch ncreases the Cost of power generaton and reduces the emsson.bb-bc parameters are set to Maxteratons 00, populaton sze 30.To compare wth PSO, Maxteratons 00, populaton sze 30.PSO also requres settng of Φ, cf and nerta weght w n equaton (). After few trals, cf=0.729, nerta weght w s set to.2 n the begnnng of teraton process and gradually the value reduced to w/.5 n successve teratons. Advantage of BB-BC, s that t does not requre trals to select parameters for optmzaton. k n equaton 7, s responsble for local search around Centre of mass of populaton as teraton number ncreases. k s taken as (teraton number+). Fg(),(2) ndcates convergence characterstcs for economc dspatch and emsson dspatch by BB-BC and PSO.BB-BC converges n a stepped manner wthout any oscllatons. It 4 s observed that to converge to an accuracy of 0 tolerance BB-BC needs 4-6 teratons more than PSO. However, both optmzaton methods nearly converge to

8 562 C.V. Gopala Krshna Rao and G. Yesuratnam average mnmum n 0 to 30 teratons. Due to absence of Velocty terms for local and global searches n BB-BC for 00 teratons run take less tme. Both optmzatons are run for 00 ndependent tmes and the average executon tmes are computed whch gves the average tme for BB-BC s and for PSO s respectvely. Fgure : Convergence Characterstcs wt=, test case-. Fgure 2: Convergence Characterstcs wt=0, test case-. Table, 2 shows trade-off (pareteo) soluton and generator outputs (control 4 varables of test case-). Results are shown for a tolerance of 0 for cost and emsson. For all trade off weghts BB-BC soluton s as superor as PSO for cost, emsson dspatch and generator outputs. Table : comparatve trade-off soluton of test case-. Trade -off wt BB-BC BB-BC Cost of generaton Cost of generaton Emsson Emsson $/hr $/hr kg/hr kg/hr

9 Multobjectve Generaton Dspatch Table 2: Comparatve Generator outputs of test case- Trade-off weght(wt).0 BB- BC 0.8 BB- BC 0.5 BB- BC 0.3 BB- BC 0.0 BB- BC Pg() p.u Pg(2) p.u Pg(3) p. u Pg(4) p.u Pg(5) p.u Real power loss (p.u) Test case 2: Optmzaton parameters for ths case are smlar to test case-. Emsson functon consdered s combned S O2 and N O x and hence emsson functon has the same form as equaton 4.For ths case, Wt= [, 0] are only weghts that satsfes the trade-off (pareto) soluton by both PSO and BB-BC. Fg 3, 4 shows the convergence characterstcs of BB-BC and PSO respectvely. For ths case also both convergence characterstcs, mnmum dspatch results and generator outputs provded by BB-BC s as superor as to PSO. Table 3, 4 comparsons of results are shown. Tmes of executons are calculated smlar to that n test case-, for00 teraton average tme of BB-BC s less than PSO. Average tme for BB-BC s and for PSO s respectvely.

10 564 C.V. Gopala Krshna Rao and G. Yesuratnam BB-BC Ftness Functon ff wt=,economc Dspatch Test case Iteratons Fgure 3: convergence Characterstcs wt=, test case 2. Ftness Functn ff wt=0,economc Emsson Dspatch Test case-2 BB-BC PO S Iteratons Fgure 4: Convergence Characterstcs wt=0, test case =2. Table 3: comparatve trade-off soluton test case-2. BB-BC BB-BC Trade-off wt cost of Generaton $/hr Cost of generaton $/hr Emsson kg/hr Emsson kg/hr

11 Multobjectve Generaton Dspatch 565 Table 4: Comparatve Generator outputs of test case-2. Trade-off Weght(wt).0 BB-BC 0.0 BB-BC Pg() p.u Pg(2) p.u Pg(3) p.u Pg(4) p.u Pg(5) p.u Pg(6) p.u Real power loss(p.u) BB-BC Real power loss(p.u) BB-BC Conclusons BB-BC optmzaton algorthm s appled for multobjectve optmzaton to obtan trade-off solutons for economc electrcal real power cost dspatch and emsson dspatch of thermal generatng power transmsson system usng weghted sum method. BB-BC optmzaton s found to be soluton effectve and convergence s relable.most attractve feature s that lke other EA, BB-BC does not requre any tral parameters for optmzaton. A number of multple solutons around centre of mass n frst 0-5 teratons found to arrve at average mnmum for all trade-off weghts (wt) n both Test cases. The effectveness of BB-BC has to be tested for optmal locaton of compensatng devces, Reactve power optmzaton, congeston management etc wth more number of control parameters wth dscrete step szes for large scale Power transmsson system. References [] A. J. Wood and Wollenberg Power Generaton and Control, John Wlley and Sons, New York, 984. [2] D. P. Kothar, J. S. Dhllon, Power System Optmzaton, PHI, New Delh,2004. [3] Jacob Zahav and Lawrence Esenberg, An Applcaton of Economc- Envronmental power dspatch IEEE Trans. On systems, Man, and Cybernetcs, July- 977, pp [4] J. W. Talaq, M. E. Harway A summary of Envronmental /Economc dspatch Algorthms IEEE Trans.on Power System, no 3,994,pp [5] Anastasos G. Bakrtzs, N. Bskas, E. Zoumous, Vaslos Petrds, Optmal power [6] Flow by Enhanced Genetc Algorthms IEEE Trans.on Power System, vol 7, No 2, pp

12 566 C.V. Gopala Krshna Rao and G. Yesuratnam [7] K. P. Wong and Y. W. Wong Thermal Generator Schedulng usng Hybrd Genetc/Smulated Annealng Approach IEE proc. part C, vol 42,no4,July 995, p 372. [8] Papya Dutta, A. K.Snha, Envronmental Economc Dspatch Constraned by Voltage Stablty usng PSO, IEEE -2006, pp [9] H. Yang, P. Yang and A. T. Johns, Evolutonary Programmng Based Economc Dspatch for unts wth non-smooth Fuel Cost Functons IEEE Trans. on pwrs, Vol, no, February 996, pp 2-8. [0] L. S. Ttare, L. D. Arya, A PSO for Improvement of Voltage Stablty by Reactve Power Reserve Management Journal of the Insttuton of Engneers (Inda),vol 87,September 2006,pp3-7. [] K. Erol Osman, Ibrahm Eksn, New optmzaton method: Bg Bang-Bg Crunch, Elsever, Advances n Engneerng Software 37 (2006), pp. 06. [2] K. Deb, Mult-Objectve Optmzaton Usng Evolutonary Algorthms, John Wley & Sons, Ltd., Chchester, England, 200. [3] P. H. Hota, R. Chakrabart, P. K. Chattopadhya Multobjectve Dspatch Usng Goal- Attanment Method Journal of the Insttuton of Engneers(Inda),vol 82,September 200,pp22-27 [4] H. Saadat, Power System Analyss, McGraw-Hll, Inc., 999.

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

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

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

International 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 information

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

Evolutionary 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 information

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

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

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

Multi-Objective Evolutionary Programming for Economic Emission Dispatch Problem

Multi-Objective Evolutionary Programming for Economic Emission Dispatch Problem Mult-Objectve Evolutonary Programmng for Economc Emsson Dspatch Problem P. Venkatesh and Kwang. Y.Lee, Fellow, IEEE Abstract--Ths paper descrbes a new Mult-Objectve Evolutonary Programmng (MOEP) method

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

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

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

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

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

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

Research Article Multiobjective Economic Load Dispatch Problem Solved by New PSO

Research 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 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

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

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

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

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

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

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

U.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 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

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

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

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

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

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

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Kernel Methods and SVMs Extension

Kernel 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 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

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

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

Optimization of Corridor Observation Method to Solve Environmental and Economic Dispatch Problem

Optimization of Corridor Observation Method to Solve Environmental and Economic Dispatch Problem ISSN (e): 2250 3005 Vol, 04 Issue, 11 November 2014 Internatonal Journal of Computatonal Engneerng Research (IJCER) Optmzaton of Corrdor Observaton Method to Solve Envronmental and Economc Dspatch Problem

More information

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or

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

Lecture 16 Statistical Analysis in Biomaterials Research (Part II)

Lecture 16 Statistical Analysis in Biomaterials Research (Part II) 3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

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

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 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 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

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

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

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

Constrained Evolutionary Programming Approaches to Power System Economic Dispatch

Constrained Evolutionary Programming Approaches to Power System Economic Dispatch Proceedngs of the 6th WSEAS Int. Conf. on EVOLUTIONARY COMPUTING, Lsbon, Portugal, June 16-18, 2005 (pp160-166) Constraned Evolutonary Programmng Approaches to Power System Economc Dspatch K. Shant Swarup

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

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

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

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016 CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng

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

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

Which Separator? Spring 1

Which Separator? Spring 1 Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal

More information

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

HYBRID 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 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

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

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

Energy Conversion and Management

Energy 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 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

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

T E C O L O T E R E S E A R C H, I N C.

T E C O L O T E R E S E A R C H, I N C. T E C O L O T E R E S E A R C H, I N C. B rdg n g En g neern g a nd Econo mcs S nce 1973 THE MINIMUM-UNBIASED-PERCENTAGE ERROR (MUPE) METHOD IN CER DEVELOPMENT Thrd Jont Annual ISPA/SCEA Internatonal Conference

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

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

Archive of SID. A Novel Pareto-Optimal Solution for Multi-Objective Economic Dispatch Problem.

Archive of SID. A Novel Pareto-Optimal Solution for Multi-Objective Economic Dispatch Problem. IRANIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, VOL. 6, NO., SUMMER-FALL 007 A Novel Pareto-Optmal Soluton for Mult-Obectve Economc Dspatch Problem S. Muraldharan, K. Srkrshna, and S. Subramanan

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

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

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

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

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

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

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

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

Chapter 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 information

Global Optimization Using Hybrid Approach

Global Optimization Using Hybrid Approach Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw

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

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

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

Stochastic 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 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

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

Simultaneous 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 information

DUE: WEDS FEB 21ST 2018

DUE: 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 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

Economic dispatch solution using efficient heuristic search approach

Economic 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 information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

On a direct solver for linear least squares problems

On a direct solver for linear least squares problems ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear

More information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

More information

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T Chapter 4 ECOOMIC DISPATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

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

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

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Solving Nonlinear Differential Equations by a Neural Network Method

Solving 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 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

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

Solving 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 information

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Regular paper. New Approach to Solve Multiobjective. Economic Dispatch

Regular paper. New Approach to Solve Multiobjective. Economic Dispatch Tawfk Guesm Hsan Hadj Abdallah Ahmed Toum Sfax Natonal Engneerng School, Electrcal Department. BP W, 3038 Sfax-Tunsa. gg_tawfk@yahoo.fr J. Electrcal Systems - (006): 64-8 Regular paper New Approach to

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

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

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

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Static security analysis of power system networks using soft computing techniques

Static 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 information