Economic Dispatch Scheduling using Classical and Newton Raphson Method
|
|
- Cordelia Fleming
- 5 years ago
- Views:
Transcription
1 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 Volume, Issue, June0 Internatonal Journal of Enneerng and Management Research age umber: Economc Dspatch Schedulng usng Classcal and ewton Raphson Method avneet Kaur, Mannder, Inderjeet Sngh,, Electrcal Enneerng & TU, IDIA ABSTRACT Over the past several years, concerns have been rased over the possblty that the exposure to 00 Hz electromagnetc felds from power lnes, substatons and other power sources may have detrmental health effects on lvng organsms The economc dspatch problem was defned so as to determne the allocaton of electrcty demand among the commtted generatng unts to mnmze the operatng costs subject to physcal and technolocal constrants Economc load dspatch s an mportant optmzaton task n power system operaton for allocatng generaton among the commtted unts such that the system constrants mposed are satsfed and energy requrement n terms of kcal/h or Btu/h or Rupees per hour (Rs/h) are mnmzed To all ntents and purposes, there has been concern that the economc dspatch may not be the best envronmentally In ths research paper economc schedulng of thermal unts has been done Over and above, regular electrc supply s the sheer necessty for growng ndustry and other felds of lfe Keywords Economc dspatch, amda teraton, Classcal Method and ewton Raphson Method I ITRODUCTIO The economc load dspatch problem pertans to the optmum generaton schedulng of avalable generatng unts n a power system to mnmze the cost of generaton subject to system constrants [,] In vew of rapd growth n demand and supply of electrcty, electrc power system s becomng ncreasngly larger and more complex day by day Regular electrc supply s the utmost necessty for growng ndustry and other felds of lfe Wth the ncreasng dependence of ndustry, agrculture and daytoday household comfort upon the contnuty of electrc supply, the relablty of power systems has put on great mportance [] Every electrc utlty s normally under oblgaton to provde to ts consumers a certan degree of contnuty and qualty of servce (power flow on transmsson lnes n a specfed range) Therefore, economy, emsson etc objectves of the power system must be properly coordnated n arrvng at optmal power dspatch[,] It s, therefore, requred to search for better and realstc stratees to acheve varous objectves along wth desred qualty of power supply and satsfyng smultaneously varous system constrants Ths mples economc load dspatch schedulng aspects of the system operaton, whch are duly nvestgated n the present work n a unfed multobjectve approach[] II ECOOMIC DISATCH Economc dspatch n electrc power system has ganed ncreasng mportance as the cost assocated wth generaton and transmsson of electrc energy keeps ncreasng So n optmal load dspatch problem generator operatng cost characterstcs s the most mportant factor The major component of generaton operatng cost for fossl plants s the cost of fuel nput per hour, whle the cost of mantenance, water etc contrbute only neglbly small portons[] The operatng characterstcs of fossl plants can be expressed n terms of mllon calores per uneconomcal (or may be techncally nfeasble) to operate the unt and MW Copyrght 0 Vandana ublcatons All Rghts Reserved
2 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 lmts [,9] Mathematcally, ths s an optmzaton problem III SOUTIO BASED O AMBDA ITERATIO METHOD The economc dspatch problem s defned as that whch mnmzes the total operatng cost of the power system whle meetng the total load plus transmsson losses wthn generator lmts Mathematcally, the problem s defned a Fg Operatng cost versus power output curve The power output of the plant s ncreased sequentally by openng a set of valves at the nlet to ts steam turbne The throttlng losses n a valve are large, when t s just opened and small when t s fully opened As a result the operatng cost of a plant has the form as shown n Fgure MW (mn) MW (max) ( Y axs Operatng cost Rs/h ) ower Output Fgure Cost Rs/h versus output MW curve For dspatchng purposes, ths operatng cost per unt generator s usually approxmated by quadratc polynomal ( ) ( F = a + b + c ) g g g Rs /h Where a, b, c are the cost coeffcents and stands for the unt s number The man objectve of the economc dspatch s to mnmze the cost of fuel for the thermal power system, subject to certan constrants as generatng enough power to meet the load demand and to stay wthn operatng Mnmze F ( ) = ( a + b + c ) = (a) Subject to () The energy balance equaton = = D + (b) Rs/h () and the nequalty constrant mn max ; ( =, ) = = j=,, (c) Where a,b, c are the cost coeffcents D s the load demand s the real power generaton and wll act as decson varable s the number of generaton buses s the transmsson power loss One of the most mportant, smple but approxmate method of expressng transmsson loss as a functon of generator powers s through Bcoeffcents Ths method uses the fact that under normal operatng condtons, the transmsson loss s quadratc n the njected bus real powers The general form of the loss formula usng Bcoeffcents s B j gj MW () Where, and gj are the real power njectons at the th and jth buses, respectvely B j are the loss coeffcents whch are constant under certan assumed condtons, s number of generaton buses The transmsson loss formula of () s known as George s formula Another more accurate form of transmsson loss expresson, frequently known as Kron s loss formula s Copyrght 0 Vandana ublcatons All Rghts Reserved
3 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 = B 00 + = B 0 + = j= MW () Where and are the real power njectons at th gj and jth buses, respectvely B 00, B 0 and B j are the loss coeffcents whch are constant under assumed condtons, s the number of the generaton buses The above constraned optmzaton problem s converted nto an unconstraned optmzaton problem agrange multpler method s used n whch the functon s mnmzed (or maxmzed) wth sde condtons n the form of equalty constrants Usng agrange multplers and augmented functon s defned as (, λ) = F ( ) + λ ( D + ) () = Where λ s the agranan multpler ecessary condtons for the optmzaton problem are (, λ )/ = F( )/ + λ ( / ) =0 (=,, ) Rearranng the above equaton, F( )/ = λ ( / ) (=,, ) () Where F( )/ s the ncremental cost of the th generator (Rs/MWh) / s the ncremental transmsson losses Equaton () s known as the exact coordnaton equaton, and (, λ ) λ / = D + = 0 () = Equaton () the socalled coordnaton equaton, numberng s solved smultaneously wth Eqn () to yeld a soluton for agrange multpler λ and the optmal generaton of generators, By dfferentatng the transmsson loss equaton Eqn () wth respect to, the ncremental transmsson loss can be obtaned as, / = B 0 + Bjgj (=,, ) () j= And by dfferentatng cost functon eqn(a) wth respect to, the ncremental cost can be obtaned as B j gj F()/ = a +b ( ) Equaton () can be rewrtten as (=,, ) { F( )/ } / ( / )= λ or { F( )/ } = λ (=,, ) (9) where = 0/( / ) s called the penalty factor of th plant To obtan the soluton, substtute Eqs () and () nto eq () a +b = λ (B 0 B j gj ) (=,, ) j= Rearranng the above equaton to get, we have (a + λ B ) =λ (B 0 B j gj ) b (=,, ) j= j The value of can obtaned as = {λ (B 0 B j gj )b} / (a +λ B ) (=,, ) (0) j= j If the ntal values of (=,, ) and λ are known the above equaton can be solved teratvely untl eq() s satsfed by modfyng λ Ths technque s known as successve approxmaton IV AGORITHM: ECOOMIC DISATCH (CASSICA METHOD) Read data, namely cost coeffcents, a, b, c ; B coeffcents, B j, B 0, B 00 (=,, ; j=,, ); convergence tolerance є, step sze α, and maxmum teratons allowed, ITMAX,etc Compute the ntal values of (=,, ) and λ by assumng that the transmsson losses are zero, e =0 Set teraton counter, IT = Compute (=, ) usng eq(0) Compute transmsson loss usng Eq () Compute = D + = Check ε,f yes, then GOTO Step 0 Check IT ITMAX, f yes then GOTO Step 0(t means program termnated wthout obtanng the requred convergence) Copyrght 0 Vandana ublcatons All Rghts Reserved
4 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 Update λ new =λ+α, where α s the step sze used to ncrease or decrease the value of λ n order to meet the step 9 IT =IT+, λ= λ new and GOTO Step and repeat 0 Compute optmal total cost from eq(a) and transmsson loss from () Stop V ECOOMIC DISATCH USIG EWTORAHSO METHOD The economc dspatch problem s expressed by eqs(a), (b) and (c) and s converted nto an unconstraned optmzaton problem as n eq() ecessary condtons for the optmzaton problems eq() are ven by eqs () and eqs () The soluton of nonlnear eq() can be obtaned usng the ewton Raphson method n whch any change n control varables about the ntal values can by obtaned usng Taylor s expanson Taylor s expanson to second order of eq () and eq () can be wrtten as ( / ) + ( / gj ) gj + ( / λ) λ = / () j= j (( /( λ gj ) gj + ( / λ ) λ = / λ () j= The above equaton can be rewrtten n matrx form as p g p g p g λ p g = p g T λ p g λλ λ λ () Dervatves can be obtaned as follows: / = F/ + λ [( / ) ] =( a +b ) + λ (B 0 + B j gj ) = (=,, ) (a) / λ = D + (b) = Takng dervatves of eq(a) wth respect to, ( / ) = F/ + λ( / ) = a +λ B (=,, G) ( a) ( / gj ) = λ ( / ) = λ B j (b) (=, G; j=,, G; j) Takng dervatves of eqs (a) and ( b) wth respect to λ, G ( / λ )= ( / λ) = / =B 0 + B j gj = (=,, G) (c) / λ =0 (d) Equatons () and () are terated tll no further mprovement s obtaned or sngle dervatves wth respect to control varables become zero VI AGORITHM: ECOOMIC DISATCH (EWTORAHSO METHOD) Read data, namely a, b, c (cost coeffcents); B j, B 0, B 00 (Bcoeffcents) (=,, ; j=,, ) convergence tolerance, є, and ITMAX ( maxmum allowed teratons), etc Compute the ntal values of (=,,,) and λ by presumng that = 0 Assume that no generator has been fxed ether at lower lmt or at upper lmt Set teraton counter IT = Compute Hessan and Jacoban matrx elements usng eqs () and () [H] p g = [J] λ Deactvate row and column of Hessan matrx and row of Jacoban matrx representng the generator whose generaton s fxed ether at lower lmt or at upper lmt Ths s done so that fxed generators,can not partcpate n allocaton Gauss elmnaton method s employed n whch trangularzaton and backsubsttuton processes are performed to fnd (=,, R and λ) Here R s the number of generators whch can partcpate n allocaton or Check ether R = R = + λ ( ) + ( λ) ε ε Copyrght 0 Vandana ublcatons All Rghts Reserved
5 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 f convergence condton s yes then GOTO Step 0 Check IT > ITMAX, f condton s yes GOTO Step 0(t means the procedure proceeds wthout obtanng requred convergence) Modfy control varables, (new) = + ; (=,, R ) and λ (new) = λ + λ 9 IT =IT+, = (new), λ = λ (new) and GOTO Step and repeat 0 If no more volatons then GOTO Step, else check the lmts of generators and fx up as follows: If < mn then = mn If > max then = max GOTO Step and repeat Compute the optmal total cost and transmsson loss Stop VII TEST SYSTEMS AD RESUTS Test problem no The fuel nputs per hour of two plants are ven as F (g ) = (0009 g +0 g +00) Rs/h F (g ) = (000 g +0 g +0) Rs/h Determne the economc schedule to meet the demand of 0MW and the correspondng cost of generaton The transmsson losses are ven by = 000g g (0000 g g ) Assumptons: α = 00, ε =0000, and ITMAX= TOTA COST = 09 Rs/hr Table Generaton Schedule (R Method) IT g (M g (M λ(rs/mwh) OWER OSS = 99 MW TOTA COST = 09 Rs/hr Test problem no For a three generator system the fuel cost coeffcents are ven n table (a) The B coeffcents for transmsson loss are ven n table (b)determne the economc schedule for load of 0 MW Table Generaton Schedule (Classcal Method) I T g (M g (M λ(rs/mw h) Δ(M (M Table (a) Fuel cost coeffcents Table (b) Bcoeffcents MW Table Optmal Generaton Schedule (R Method) IT g (M g (M g (M λ(rs/mwh) Copyrght 0 Vandana ublcatons All Rghts Reserved
6 wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 OWER OSS = 09 MW TOTA COST = Rs/hr Table Generaton Schedule (Classcal Method) I T g ( M g ( M g ( M λ(rs/m Wh) Δ(M (M TOTA COST = Rs/hr VIII COCUSIO Economc dspatch s the shortterm determnaton of the optmal output of a number of electrcty generaton facltes, to meet the system load, at the lowest possble cost, subject to transmsson and operatonal constrants The basc constrants of the economc dspatch problem reman n place but the model s optmzed to mnmze pollutant emsson n addton to mnmzng fuel costs and total power loss Due to the added complexty, a number of algorthms have been employed to optmze ths envronmental/economc dspatch problem It s concluded that the economc schedulng of thermal unts to meet the load demand n the most economc way wthout volatng any system or ndvdual unt constrants REFERECES [] BHChowdhary and SRahman, A revew of recent advances n economc dspatch, IEEE Trans on ower Systems, Vol, no, pp,990 [] MHuneault and FDGalana, A survey of the power flow lterature, IEEE Trans on ower Systems, Vol, no, pp0, 99 [] JSDhllon, SCart and DKothar, Stochastc economc emsson load dspatch, Electrc ower Systems Research, vol, pp 9, 99 [] Janda, D Kothar and KS ngamurthy, Economc emsson load dspatch through goal programmng technques, IEEE Transactons on Energy Converson, vol EC (), pp, 9 [] C Durga rasad, AK Jana and SC Trpathy, Modfcatons to ewton Raphson load flow for llcondtoned power systems, Electrcal ower & Energy Systems, vol (), pp 99, 990 [] AO Ekwue and JF Macqueen, Comparson of load flow soluton methods, Electrc ower Systems Research, vol (), pp, 99 [] C alanchamy & K Shrkrshna, Smple Algorthm for economc power dspatch, vol, 99 [] HW Dommel & WF Tnney, Optmal power flow solutons, IEEE Trans, Vol AS, 9 [9] K Aok & T Satoh, ew Algorthms for classc economc load dspatch", IEEE Trans Vol 0, 9 Copyrght 0 Vandana ublcatons All Rghts Reserved
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 informationE 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 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 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 informationWinter 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 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 informationCombined 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 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 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 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 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 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 informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
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 informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
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 informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
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 informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationYong 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 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 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 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 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 informationVQ 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 informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationOPTIMISATION. 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 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 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 information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
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 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 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 informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
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 informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationThe 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 informationECONOMIC AND MINIMUM EMISSION DISPATCH
ECOOMIC AD MIIMUM EMISSIO DISACH Y. Demrel A. Demroren İstanbul echncal Unversty, Electrcal Engneerng Department Maslak / İstanbul / urkey ABSRAC In ths paper, Hopfeld eural etwork (H and Lagrange Multpler
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 informationSome 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 informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
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 informationLeast squares cubic splines without B-splines S.K. Lucas
Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationResearch Report. Eiichi Ono, Yoshikazu Hattori, Yuji Muragishi. Abstract. Special Issue Estimation and Control of Vehicle Dynamics for Active Safety
Specal Issue Estmaton and Control of Vehcle Dynamcs for Actve Safety 7 Research Report Estmaton of Tre Frcton Crcle and Vehcle Dynamcs Integrated Control for Four-wheel Dstrbuted Steerng and Four-wheel
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 informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
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 informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
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 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 informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationOptimization 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 informationCSci 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 informationWhich 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 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 informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
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 informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
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 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 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 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 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 informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
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 informationArchive 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 informationDistributed Slack Bus Algorithm for Economic Load Dispatch
Dstrbuted Slack Bus Algorthm for Economc Load Dspatch A thess submtted n partal fulflment of the requrements for the degree of Bachelor of Technology n Electrcal Engneerng By, Anurag Mohapatra 108EE005
More informationTransfer Capability Computations in Deregulated Power Systems
Proceedngs of the rd Hawa Internatonal Conference on System Scences - 000 ransfer Capablty Computatons n Deregulated Power Systems Mohamed Shaaban (St. M. IEEE Yxn N (S. M. IEEE Felx F. Wu ( Fellow, IEEE
More informationTopic 5: Non-Linear Regression
Topc 5: Non-Lnear Regresson The models we ve worked wth so far have been lnear n the parameters. They ve been of the form: y = Xβ + ε Many models based on economc theory are actually non-lnear n the parameters.
More informationMultiobjective Generation Dispatch using Big-Bang and Big-Crunch (BB-BC) Optimization
Internatonal Journal of Electrcal Engneerng. ISSN 0974-258 Volume 4, Number 5 (20), pp. 555-566 Internatonal Research Publcaton House http://www.rphouse.com Multobjectve Generaton Dspatch usng Bg-Bang
More informationAnnexes. 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 informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationEE292K Project Report: Stochastic Optimal Power Flow in Presence of Renewables
EE292K Project Report: Stochastc Optmal Power Flow n Presence of Renewables Anubhav Sngla (05737385) Advsor: Prof. Danel O Nell June, 202 Abstract In ths work we propose optmal power flow problem maxmzng
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 informationLoss Minimization of Power Distribution Network using Different Types of Distributed Generation Unit
Internatonal Journal of Electrcal and Computer Engneerng (IJECE) Vol. 5, o. 5, October 2015, pp. 918~928 ISS: 2088-8708 918 Loss Mnmzaton of Power Dstrbuton etwor usng Dfferent Types of Dstrbuted Generaton
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
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 informationTerm Project - select journal paper and outline. Completed analysis due end
EE 5200 - Lecture 30 Fr ov 4, 2016 Topcs for Today: Announcements Term Project - select journal paper and outlne. Completed analyss due end of Week 12. Submt va e-mal as mn-lecture.ppt wth voce narraton.
More informationForesighted Demand Side Management
Foresghted Demand Sde Management 1 Yuanzhang Xao and Mhaela van der Schaar, Fellow, IEEE Department of Electrcal Engneerng, UCLA. {yxao,mhaela}@ee.ucla.edu. Abstract arxv:1401.2185v1 [cs.ma] 9 Jan 2014
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 informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationCOEFFICIENT 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 informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationEconomic pricing techniques for transmission network in deregulated electricity market
Economc prcng technques for transmsson network n deregulated electrcty market Shakashraf al 1, K.Vmala kumar 2 P.G.Scholor, E.E.E Department, J.N.T.U.A College of Engneerng,Pulvendula,Kadappa,Inda 1 Assstant
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationProblem 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 informationSolutions 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 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 informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More 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 informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More information