DECOMPOSITION ALGORITHM FOR OPTIMAL SECURITY-CONSTRAINED POWER SCHEDULING

Size: px
Start display at page:

Download "DECOMPOSITION ALGORITHM FOR OPTIMAL SECURITY-CONSTRAINED POWER SCHEDULING"

Transcription

1 DECOMPOSITION ALGORITHM FOR OPTIMAL SECURITY-CONSTRAINED POWER SCHEDULING Jorge Martínez-Crespo Julo Usaola José L. Fernández Unversdad Carlos III de Madrd Unversdad Carlos III de Madrd Red Elétra de Espana (REE) Leganés, Span Leganés, Span Madrd, Span Abstrat - Ths paper presents an approah to determne the optmal daly generaton shedulng n a ompettve envronment takng nto aount dspath onstrants (power reserve, ramp rate lmts, real and reatve power output lmts), network and power system seurty onstrants (real and reatve power flow equatons, bus voltages and transmsson flow lmts n pre and post-ontngeny states). The proposed approah onsders Benders deomposton for solvng the seurty-onstraned optmal generaton shedulng problem. It has been developed usng market algorthm appled to a Sngle System Operator Model whh onsders the daly market and the tehnal onstrants resoluton proess as a sngle one. The objetve funton mnmzes the energy purhase ost subjet to prevously defned onstrants, n a market where all avalable generatng unts must make energy bds arranged n dfferent bloks wth ther own pre. As a result of the optmzaton proess, the on/off status of the generatng unts and voltage ontrol deves, the atve and reatve power output of eah generatng unt and the tap transformer value are provded. Mathematally the power shedulng s defned as a nonlnear mxed-nteger optmzaton problem wth lnear objetve funton, bnary deson varables (on/off status of the generatng unts, reators and apators), ontnuous varables for the operaton proesses, tme ouplngs (ramp rate lmts and mnmum up/down tme) and non-lnear onstrants as omplete flow load equatons. The model has been tested n dfferent ases of the IEEE 24-bus Relablty Test System and an adapted IEEE 118-bus Test System. It has been programmed n GAMS mathematal modellng language, usng CONOPT and CPLEX solvers for non-lnear and lnear mxed-nteger programmng problems, respetvely. Keywords - Power system regulaton, eletrty markets, non-lnear mxed-nteger optmzaton problem, Benders deomposton, preventve seurty analyss 1 INTRODUCTION THIS paper presents a Benders deomposton approah [1] to defne the optmal seurty-onstraned daly unt ommtment n a ompettve envronment. Eletrty markets an be organzed n dfferent ways. The analyzed model s based on the struture of ertan eletrty markets [2, 3] that solve jontly the generaton dspath problem and the network onstrants. A sngle entty, System Operator (SO), determnes the daly generaton shedulng mnmzng the energy purhase ost and onsderng the seure operaton of the power system. The market partpants submt hourly energy multblok pre bds. The dspather (SO) problem s to selet the heapest offers from the set of the supply-sde offers to math the real power demand (demand-sde bds are not onsdered n ths study). The soluton sets the aepted offers, the ommtted energy and the hourly pre pad to every ommtted generatng unt. The ommtted unts an be pad at ther offer pres or at the spot pres, whh are dretly provded by the soluton. The seure power shedulng nvolves two lassal problems n the eletr systems operaton: the unt ommtment and the seurty-onstraned optmal power flow. In order to defne a preventve seure power shedulng, dspath onstrants (generaton lmts, power reserve, ramp rate lmts, mnmum up and down tme) as well as network (omplete load flow equatons) and seurty onstrants (bus voltages and transmsson flow lmts n pre and post ontngeny states) have been nluded n the model. Ths preventve seurty rteron also norporates the ommtment of voltage ontrol deves, suh as reators or apators. Therefore, n ths work, the daly power shedulng s a mxed-nteger non-lnear optmzaton problem that nludes: lnear objetve funton based on hourly energy mult-blok pre bds, bnary deson varables (off-lne or on-lne generatng unts, reators and apators), ontnuous varables for the operaton proesses (real and reatve power, transformer taps, voltage magntude and phase angle), tme ouplngs (ramp rate lmts, mnmum up and down tme), non-lnear network onstrants (omplete power flow equatons, transmsson flow lmts, reatve power njeted by voltage ontrol deves). non-lnear seurty onstrants (post-ontngeny real and reatve power flow equatons, transmsson flow lmts,... ). Ths optmzaton problem has been solved usng Generalzed Benders deomposton [4, 5]. Ths partton algorthm s a deomposton tehnque n two-levels, master and slave. The master problem solves the unt ommtment problem whereas the slave problem deals wth the seurty-onstraned optmal power flow (SCOPF). Ths Benders method allows to broah the presene of bnary 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 1

2 varables n a non-lnear model. Besdes, the tme ouplngs are arranged so that t an be treated n a optmal way by the Benders algorthm. Ths method mproves presently avalable approahes as t supples an optmal 24-hour shedulng onsderng a prese model of the transmsson network and a omplete seurty analyss, provdng an optmal and preventve real power dspath wth voltages ontrol deves. The model has been tested n the IEEE 24-bus Relablty Test System [6] and an adapted IEEE 118-bus System [7]. The exeuton tmes and teratons number are provded and some results for the IEEE 24-bus System are reported. The model has been programmed n GAMS [8], usng CONOPT and CPLEX solvers [9] for non-lnear and lnear mxednteger programmng problems, respetvely. Ths paper s organzed n the followng way. The notaton used throughout the artle s provded n Seton 2. Seton 3 expounds the model formulaton. The struture of the Benders deomposton algorthm and ts applaton to the optmal seure power shedulng are explaned n Seton 4. Seton 5 presents the test systems and the results and fnally, Seton 6 states the onlusons. 2 NOMENCLATURE The notaton used throughout the paper s: Varables P t, real power output of unt at perod t. P g t,j real power njeted by all the generatng unts onneted at the bus j at perod t. P t,,b real power of blok b offered by unt at perod t. rt t,nj transformer tap for transformer (nj) at perod t. Q reatve power output of generatng unt, reator or apator k at perod t. Q g t,j reatve power njeted by the generatng unts, reators and apators onneted at the bus j at perod t. u deson varable (0/1) that represents the ommtment state of unt, reatane or apator x t, k at perod t. number of hours that generatng unt has been on (+) or off (-) at the end of hour t. V t,n bus voltage at bus n durng perod t. V t,n bus voltage magntude at bus n durng perod t. δ t,n phase angle at bus n durng perod t. G t,jn B t,jn G t,jn B t,jn λ m α t real term of the element j,n n bus admttane matrx. magnary term of the element j,n n bus admttane matrx. real term of the element j,n n bus admttane matrx for the post-ontngeny state. magnary term of the element j,n n bus admttane matrx for the post-ontngeny state. dual varable suppled by the slave subproblem n eah teraton m, whh s assoated to the deson of onnetng of unt k at perod t. underestmaton of the operaton osts omputed n the slave subproblem at perod t. Parameters p t,,b pre offered by unt at hour t for blok b. Pt,,b max maxmum real power offered by the generatng unt for the blok b at perod t. P max maxmum real power output of generatng unt. P mn Pt, max mnmum real power output of generatng unt. maxmum real power output of generatng unt at perod t. mnmum real power output of generatng unt at perod t. maxmum reatve power output of unt. P mn t, Q max Q mn mnmum reatve power output of unt. Pt,n d real load demand at bus n durng perod t. Q d t,j reatve load demand at bus n durng perod t. UR ramp-up and start-up rate lmt of unt. DR ramp-down and shut-down rate lmt of unt. UT mnmum up tme of unt. UT mnmum down tme of unt. state (on/off) of the unt k at perod t for teraton m. Pt, m real power of the unt at perod t for teraton m. R t reserve requrement durng perod t. U m V mn V max V mn V max Rt mn Rt max Bj sh S max jn S max jn y jn y jn ε mnmum voltage at any node n and any perod t for n state. maxmum voltage at any node n and any perod t for n state. mnmum voltage at any node n and any perod t for any (n-1) state. maxmum voltage at any node n and any perod t for any (n-1) state. jn mnmum transformer tap at any perod t. jn maxmum transformer tap at any perod t. suseptane of the apator or reator k onneted at bus n. maxmum transmsson apaty (MVA) at lne (jn) for n state. maxmum transmsson apaty (MVA) at lne (jn) for any (n-1) state. lne seres admttane. hargng admttane. ost tolerane. Sets G set of ndexes of all generatng unts. GR set of ndexes of all generatng unts, reators and apators. RC set of ndexes of all reators and apators. B set of ndexes of energy sale bloks. N set of ndexes of all buses. N set of all load buses. C set of seleted ontngenes. T set of ndexes of all perods n hours. Φ set of all system branhes and transformers. Φ n subset of all system branhes onneted at bus n. Φ RT n subset of all transformers onneted at bus n. Ψ n subset of all generatng unts at bus n. M set of teraton ndexes. 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 2

3 It should be noted that the supersrpt n a state varable (Vt,n, Q t,j, δ t,n) represents the value of that varable n the post-ontngeny state. The varable Vt,n s only defned for N buses. 3 PROBLEM FORMULATION After the lberalzaton of the eletrty ndustry, the unt ommtment s solved as a market problem based on offer pres, nstead of the ost-based mnmzaton of the lassal model. In the analyzed model, the OS operates the power system n a entralzed way. Its am s to mnmze the energy purhase ost takng nto aount the bds submtted by the generatng agents nto the market, the hourly demand and the dfferent onstrants of the power system. In ths market, all avalable generatng unts must submt energy bds arranged n dfferent power-prze bloks for eah hour. Mathematally the model an be stated as follows: Mnmze Pt,,b p t,,b P t,,b (1) t T G b B The objetve funton nludes the energy bds P t,,b dvded n bloks as well as ther bd pres, p t,,b. It should be noted that the model assumes, by smplty, that the mnmum power of thermal plant, P mn, s always offered as the frst blok, whh s onsdered as ndvsble energy blok through the deson bnary varable u t,. The aeptane of ths frst blok nvolves the generatng unt start-up. Wth ths onsderaton, the objetve funton (1) ould be formulated as follows: Mnmze ut,;p t,,b t T G p t,,1 u t, P mn + t T G b B b>1 p t,,b P t,,b (2) The njeted power to or drawn from the system s lmted by a set of onstrants, whh an be lassfed n three dfferent groups: Dspath onstrants: (3)-(10), Network onstrants: (11)-(17), Seurty onstrants: (18)-(25). The network onstrants nlude a omplete AC model. The n-1 seurty onstrants are addtonal equalty and nequalty onstrants assoated wth those preseleted prevalng outages. These outages produe a volaton of the seurty lmts and they are haraterzed by a new set of nodal power flow equatons and transmsson system operatng lmts (n-1 state equatons), n whh the ontrol varables (generator real power, generator voltage magntude and transformer taps) are kept n equal value that n the base-ase (n state). The exepton would be the generatng unt outage, n whh the lost generaton wll be suppled by the rest of the ommtted generatng unts (all of them or a subset, smulatng the aton of the P-f regulaton) aordng to the equaton (22). In the ase of lne or transformer outage, t s verfed that G t,jn =G t,jn and Bt,jn = B t,jn exept for the terms of the bus admttane matrx related to the lost element. Voltage magntudes are norporated as they are a rtal fator n some real power systems. By smplty, for (n-1)-state onstrants, t has been onsdered n the formulaton all voltage magntudes as Vt,j. Ths s only true n PQ buses. The prevously mentoned onstrants are the followng ones: a) Energy bloks lmts: 0 P t,,b P max t,,b t T, G, b B/{1} (3) b) Relaton between energy bloks and real power output: P t, = u t, P mn + b B b>1 ) Real power output lmts: u t, P mn P t,,b t T, G (4) P t, u t, P max t T, G (5) d) Reatve power output lmts: u t, Q mn e) Ramp rate lmts: Q t, u t, Q max t T, G (6) DR P t, P t 1, UR t T, G (7) f) Mnmum startng up tmes: [x t 1, UT ] [u t 1, u t, ] 0 t T, UG (8) g) Mnmum startng down tmes: [x t 1, +DT ] [u t, u t 1, ] 0 t T, UG (9) h) System operatng reserve requrements: u t, P max Pt,n d + R t t T G u Q max k Q d t,n t T ) n-state real power flow equatons: V t,j V t,n (G t,jn os(δ t,j δ t,n )+B t,jn sn(δ t,j δ t,n ))= = P g t,j P d t,j t T, j N : P g t,j = (10) Ψ j P t, (11) j) n-state reatve power flow equatons: V t,j V t,n (G t,jn sn(δ t,j δ t,n ) B t,jn os(δ t,j δ t,n ))= = Q g t,j Qd t,j t T, j N : Q g t,j = k Ψ j Q (12) k) n-state transmsson apaty lmts of lnes: ( ( ) ) V t,j [(V t,j V t,n ) y jn ] 1 +V t,j V t,j 2 y jn Sjn max t T, j, n N : (jn) Φ j (13) 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 3

4 l) Transformer tap lmts: Rt mn jn rt t,jn Rt max jn t T, j, n N :(jn) Φ RT j (14) m) Pre-ontngeny reatve power njeted by shunt reators or apators: Q =u B sh k,j V 2 t,j n) n-state bus voltage magntude lmts: t T, k RC, j N:B sh k,j 0 (15) V mn V t,n V max t T, n N (16) o) n-state bus angle lmts: - π δ t,n π t T, n N/{ns} δ t,ns = 0 ns: swng bus (17) p) (n-1)-states real power flow equatons: V t,n( G t,jn os ( δt,j δ t,n) +B t,jn sn ( δt,j δ t,n)) = t,jv =P g t,j P d t,j C, t T, j N :P g t,j = Ψ j P t, (18) q) (n-1)-states reatve power flow equatons: V t,n( G t,jn sn ( δt,j δ t,n) B t,jn os ( δt,j δ t,n)) = t,jv =Q g t,j Qd t,j C, t T, j N :Q g t,j = Ψ j Q t, (19) r) (n-1)-states transmsson apaty lmts of lnes: [( ( ( ) V t,j Vt,j V t,n) yjn ] ) +V 1 t,j Vt,j 2 y jn Sjn max C, t T, j, n N : (jn) Φ j (20) s) Post-ontngeny reatve power njeted by shunt reators or apators: Q =u B sh k,j (V t,j) 2 C, t T, k RC, j N :B sh k,j 0 (21) t) Real power output of unts after generatng unt outage: P max P =P + k P (Pk max P ) P t, k G:P >0 k P t, = 0 G: P t, > 0 (22) u) (n-1)-states bus voltage magntude lmts: V mn V t,n V max C, t T, n N (23) v) (n-1)-states reatve power output lmts: u t, Q mn Q t, u t, Q max C, t T, G (24) w) (n-1)-states bus angle lmts: - π δ t,n π C, t T, n N/{ns} δ t,ns = 0 ns: swng bus (25) 4 BENDERS DECOMPOSITION The short-term power shedulng addressed n ths paper s a mxed-nteger non-lnear optmzaton problem whh nludes lnear objetve funton, bnary deson varables, ontnuous varables for operaton proesses, tme ouplngs and lnear and non-lnear onstrants. The dffultes assoated to the resoluton of nonlnear optmzaton problems wth bnary and/or nteger varables fore to make use of parttonng tehnques. The Benders partton algorthm s a deomposton tehnque n two-levels, master and slave. The master level represents the deson problem, unt ommtment, whereas the slave level deals wth the operaton problem: SCOPF. The Benders algorthm defnes an teratve proedure between both levels. The master problem s formulated as a lnear mxed-nteger problem whh determnes the ommtted generatng unts, reators and apators. Ths shedule s transferred to the slave subproblem nonlnear optmzaton problem whh alulates the operatng ost and the dual values assoated to the shedulng deson prevously taken by the master problem. Ths new nformaton s suppled to the master problem through the Benders uts n order to mprove the new deson of the master problem. The slave level solves the operaton problem by means of a seurty onstraned AC optmal power flow. In daly shedulng, the slave problem an be deomposed n 24 subproblems (one per hour), whh are sequentally solved. Ths s possble beause of the ramp rate lmts, tme ouplng onstrants, are formulated as power lmts [10] that are updated after solvng eah hourly slave subproblem so that produton lmts for eah generatng unt are ompled wthn the followng hourly slave subproblem. Therefore, ths method allows to broah the nononvexty assoated wth the bnary varables and to dvde the global problem nto two smaller problems easer to solve. Besdes, the tme ouplngs an be treated n an optmal way. The algorthm optmzes jontly the 24- hour problem (unt ommtment wth SCOPF) provdng better results than those obtaned n ase of solvng the onstrants separately hour by hour, as t has usually been solved. The proedure followed n ths paper nludes the steps llustrated n the flowhart of the Fgure Master Problem The master level solves the deson problem, a mxednteger lnear problem, whose soluton provdes the on/off state of the generatng unts and voltage ontrol deves gven by the bnary varables u. The master problem ontans any onstrant wth bnary varables n ts formulaton. At the same manner, the objetve funton s made of those terms of the funton (2) that nlude bnary varables. The objetve funton s defned as follows: Mnmze ut,, α t t T G p t,,1 u t, P mn + t Tα t (26) 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 4

5 Mnmze Pt,,b p t,,b P t,,b t T (28) G b B b>1 subjet to the rest of onstrants that have not nluded n the master problem, n addton to: u = U m : λ m+1 t T, k GR (29) To onsder the onstrant (29) n the slave problem, t s neessary to defne temporally the nteger varable u as a ontnuous varable to obtan ts senstvty or dual value λ m+1. Eah slave problem determnes the values of the operaton varables (P t,, Q, V t,n, r t,nj, δ t,n, Q, V t,n, δ t,n ) at eah perod for n and n-1 states. Fgure 1: Flowhart of the deomposton proedure The objetve funton onssts of two terms, the frst one represents the start-up ost of the unt at ts mnmum power and the seond one s a lower estmaton of the operaton osts omputed n the slave problem. Therefore, the optmzaton varables are αt and u. Ths funton s subjet to the onstrants (8), (9), (10) and the Benders lnear uts whh are formulated as: α t α t ( U m 1 )+ ( λ m 1 u U m 1 ) t T, m M(27) The key ssue n Benders deomposton s loated at these Benders lnear uts. Both levels, master and slave, are oupled by the Benders uts that are updated at eah teraton for all operaton problems. These uts nludes the term α t (U m 1 ), whh represents the ost of the slave subproblem orrespondng to the perod t for the generaton shedulng establshed by the master problem n the prevous teraton, and a seond term related to the senstvty assoated to the unt ommtment provded by the master problem n the prevous teraton. 24 new uts are added to the master problem at eah teraton. On the other hand, the mnmum and maxmum startng up tmes onstrants (8) and (9) are lnearzed to be nluded n the master problem [10]. 4.2 Slave Problem The slave level solves the operaton problem by means of a seurty onstraned optmal power flow. The slave problem s deomposed n hourly subproblems, whh are sequentally solved. Eah hourly slave subproblem solves the system operaton problem, a SCOPF, mnmzng the ost of the produton bds (exept for the frst blok bd) submtted to the market by eah generatng unt ommtted by the master problem at eah hour. Therefore, the objetve funton for eah hourly subproblem s: 4.3 Benders onvergene rteron The teratve Benders deomposton proedure stops when the value of the objetve funton omputed n the master problem reahes the same value than the startup osts (frst bd blok) plus operatng osts omputed through the slave problem, exept for a small tolerane ost ε. Atually, as the start-up osts are the same n both problems, slave and master, they an be omtted n the onvergene rteron (CC), onsderng only the operatng osts of both problems. The fnal onvergene rteron s establshed as the equaton (30) shows. ( ) ) (α t U m αt t T CC = ) ε m M (30) α t (U m t T 4.4 Slave problem feasblty Feasblty uts have been added to the master problem to enfore the feasblty of the hourly slave subproblems. However, sne voltage ontrol s a loal problem, there ould be some ases where the reatve power onstrant (32) does not guarantee the problem feasblty. It would fore to add fttous soures at some PV buses or at buses wth voltage ontrol deves and to nlude them wth a hgh penalty fator n the objetve funton of the slave problem so that t s optmzed the global ost mnmzng the ost of the nfeasbltes as well. Nevertheless, these uts mprove the problem onvergene, redung the number of teratons. The uts are formulated as: u t, Pt, max Pt,n d + R t t T G G u t, P mn t, P d t,n t T (31) u Q max k Q d t,n t T u Q mn k Q d t,n t T (32) 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 5

6 5 TEST SYSTEMS AND RESULTS The test systems are the IEEE 24-bus Relablty Test System and an adapted IEEE 118-bus Test System wth standard osts for the generatng unts. Only results for the IEEE 24-bus system are shown. The test for the IEEE 118-bus system seeks to ompare the behavour of the proposed approah n a larger power system wth an mportant number of voltage ontrol deves (12 apators and 2 reators) and to ompare the exeuton tmes. The IEEE 24-bus Test System nludes 32 unts: nulear, oal, ol and hydro plants, dstrbuted all over the generatng buses and rangng from 12 to 400 MW. The total generaton apaty amounts to 3405 MW. The peak load s 2850 MW and ours n hours T18 and T19. The mnmum load s 1682 MW and takes plae n hours T4 and T5. A 98% power fator s appled to all load levels. The transmsson network ontans 24 load/generatng buses onneted by 38 lnes or transformers at two voltages, 138 and 230 kv. The swng bus s N13. The power system has voltage ontrol deves at buses N14 (synhronous ondenser) and N6 (reator). The transformers taps are modelled as ontnuous varables. The voltage lmts n n-state are 0.95 and In a post-fault state the lmts are set to 0.93 and The flow lmts are provded n the referene [6]. The seleted prevalng ontngenes are shown n Table 1. Hours (t) Lnes/transformers (jn) Unts () t= T1,T2,T4, (N7-N8), (N8-N9), G9, G10 or G11 T5,T22,T24 (N8-N10) at bus N7 t = T3, T6 (N7-N8), (N8-N9) G9, G10 or G11 t = T23 (N7-N8), (N8-N9), G9, G10 or G11 (N8-N10), (N3-N24), (N9-N11) t = T7 (N7-N8), (N8-N9), G9, G10 or G11 (N8-N10), (N3-N24), (N9-N11), (N11-N14), (N12-N23), (N15-N24) t= [T8,T21] (N7-N8) Table 1: Seleted ontngenes at eah perod (IEEE 24-Bus System) The generators bd pres have been taken aordng to the margnal osts of eah energy blok. The number of energy bloks s 5 and the bd pre rses wth the blok number. The model manages n the master problem 816 bnary varables u, 624 nteger varables x onverted n 1248 new bnary varables as a result of the lnearzaton of equatons (8) and (9), and 24 ontnuous varables α t. On the other hand, eah hourly slave problem nludes from 357 varables and 644 onstrants on, dependng on the number of ontngenes. Eah ontngeny adds 227 new onstrants and 77 new varables. The master problem s solved usng CPLEX under GAMS, whereas the slave subproblem s solved usng CONOPT. The per unt ost tolerane ε s fxed to 1e-3. Avalable soluton data nlude: system total ost. on/off status of every generatng unt, reator and apator per hour. atve power output of every plant per hour. voltage magntude of every bus per hour. reatve power output of every plant and voltage ontrol deves per hour. power flow of every lne per perod. spot pre per bus and perod. Table 2 shows the evoluton of the Benders teratve proess. The dfferene between operatng osts of the slave and master problems s progressvely dereasng wth the number of teratons. The operatng osts are very hgh n the frst teratons due to the ommtment of fttous generaton soures n some buses. The master total ost reports on the total ost of unt ommtment wth onstrants resoluton. Iter. Master Slave Master CC Total Cost Operatng Cost Operatng Cost Table 2: Evoluton of the onvergene of osts ($) wth the teratons Fgure 2 shows the hourly maxmum pre obtaned wthout onstrants (Case1) and the hourly maxmum pre wth onstrants soluton (Case2). It hghlghts the ndene of onstrants soluton n the daly market. Obvously, ths last maxmum pre s determned by some generatng unt ommtted to solve onstrants. The generatng unts loated at buses N7 and N13, whh are more expensve, determne the fnal pre at eah perod. It may be dedued that these unts have a prvleged loaton n the network to solve onstrants. It stands to reason that the hgher dfferene n pres between both ases ours n the valley load perods, as t s neessary to onnet new generators to fulfll the network and seurty onstrants. Fgure 2: System maxmum pre wth or wthout onstrants Spot pres per bus at perods T18 (peak load) and T2 (valley load) are shown n the Fgure 3. Fgure 4 detals the tme evoluton of the spot pre n the buses N2 (PV bus) and N19 (PQ bus). Spot pres per bus and hour show, respetvely, ther spae dstrbuton (maxmum spot pres at rtal buses N7 and N8) and the orrelaton between the tme evoluton of total generaton and the tme evoluton 15th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 6

7 of spot pres spot pres per hour follow approxmately the load urve. Fgure 3: Tme evoluton of the spot pres (perods T2 y T18) Fgure 4: Spot pres per bus (buses N2 and N19) The number of teratons to reah the onvergene and the total CPU tme requred arryng out the study ases on an INTEL P-IV (3.06 GHz.) are shown n Table 3. The method has been appled to real systems but t s neessary to mprove ts performane n the future to redue the omputaton tme. In large-sale power system, the exeuton tme s hghly dependent on the preson requred to the lnear mxed-nteger optmzer, the number of ontngenes analyzed and the omputaton effeny of non-lnear optmzer. Computaton tme Iteratons IEEE 24-Bus System IEEE 118-Bus System 2h Table 3: Computaton and number of teratons n test systems 6 CONCLUSIONS The Generalzed Benders deomposton method s used to solve a mult-perod dspath problem wth seurty onstrants n a wholesale market model. Ths model solves the daly market and onstrants soluton proess n a sngle stage. The method shows good onvergene propertes for the developed applaton. The proposed algorthm mproves presently avalable approahes n the followng respets: a daly unt ommtment s onsdered smultaneously wth a AC prese model of the transmsson network nludng load flow equatons, lne apaty lmts and voltage lmts n both pre and post-ontngeny states; branhes overload and bus voltages problems are jontly analyzed; and the model provdes an optmal and preventve real power shedule wth voltages ontrol deves ommtment. Fnally, the algorthm optmzes jontly the 24-hour problem (unt ommtment wth SCOPF) provdng better results than those obtaned solvng eah hourly problem separately. A small-sale ase study based on the IEEE 24-bus s analyzed and the omputaton tme and number of teratons are ompared wth the IEEE 118-bus System. The hourly maxmum pre allows to know the last generatng unt ommtted to solve onstrants n eah perod. Spot pres per bus and hour show, respetvely, ther spae dstrbuton and the orrelaton between the tme evoluton of total generaton and the tme evoluton of spot pres. Tme omputaton problems an be deteted n largesale power system. Ths exeuton tme s hghly dependent on the preson requred to the lnear mxed-nteger optmzer, the number of ontngenes analyzed and the omputaton effeny of non-lnear optmzer. Parallel omputaton and/or reatve reserve by areas ould be appled to mprove the tme omputaton soluton. Referenes [1] J. F. Benders, Parttonng Proedures for Solvng Mxed-Varables Programmng Problems, Numershe Mathematk, vol. 4, pp , 1962 [2] H. Rudnk, R. Varela and W. Hogan, Evaluaton of Alternatves for Power System Coordnaton and Poolng n a Compettve Envronment, IEEE Transatons on Power Systems, vol. 12, no. 2, pp , May 1997 [3] R. A. Drom, Operatng Agreement of PJM Interonneton, L.L.C., FERC, Aprl 2002 [4] H. Ma and S. M. Shahdehpour, Unt ommtment wth transmsson seurty and voltage onstrants, IEEE Transatons on Power Systems, vol. 14, no. 2, pp , May 1999 [5] N. Algual and A. J. Conejo, Multperod optmal power flow usng Benders deomposton, IEEE Transatons on Power Systems, vol. 15, no. 1, pp , February 2000 [6] The IEEE Relablty Test System-1996, IEEE Transatons on Power Systems, vol. 14, no. 3, pp , August 1999 [7] IEEE 118-bus System. Avalable at: [8] A. Brooke, D. Kendrk, A. Meeraus and R. Raman, Release 2.50 GAMS A Users Gude, Washngton, DC: GAMS Development Corporaton, 1998 [9] GAMS, GAMS-The Solver Manuals, Washngton, DC: GAMS Development Corporaton, Marh [10] J. M. Arroyo and A. J. Conejo, Optmal Response of a thermal unt to an eletrty spot market, IEEE Transatons on Power Systems, vol. 15, no. 3, pp , August th PSCC, Lege, August 2005 Sesson 18, Paper 1, Page 7

Pricing System Security in Electricity Markets. latter might lead to high prices as a result of unrealistic

Pricing System Security in Electricity Markets. latter might lead to high prices as a result of unrealistic 1 Pro. Bulk Power Systems Dynams and Control{V, Onomh, Japan, August 2001. Prng System Seurty n Eletrty Markets Claudo A. Ca~nzares Hong Chen Wllam Rosehart UnverstyofWaterloo Unversty of Calgary Dept.

More information

Modern Problem Solving Techniques in Engineering with POLYMATH, Excel and MATLAB. Introduction

Modern Problem Solving Techniques in Engineering with POLYMATH, Excel and MATLAB. Introduction Modern Problem Solvng Tehnques n Engneerng wth POLYMATH, Exel and MATLAB. Introduton Engneers are fundamentally problem solvers, seekng to aheve some objetve or desgn among tehnal, soal eonom, regulatory

More information

Figure 1. Inventory Level vs. Time - EOQ Problem

Figure 1. Inventory Level vs. Time - EOQ Problem IEOR 54 Sprng, 009 rof Leahman otes on Eonom Lot Shedulng and Eonom Rotaton Cyles he Eonom Order Quantty (EOQ) Consder an nventory tem n solaton wth demand rate, holdng ost h per unt per unt tme, and replenshment

More information

CONSIDER a connected network of n nodes that all wish

CONSIDER a connected network of n nodes that all wish 36 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 60, NO. 2, FEBRUARY 204 Coded Cooperatve Data Exhange n Multhop Networks Thomas A. Courtade, Member, IEEE, and Rhard D. Wesel, Senor Member, IEEE Abstrat

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH 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

Data Analysis with Fuzzy Measure on Intuitionistic Fuzzy Sets

Data Analysis with Fuzzy Measure on Intuitionistic Fuzzy Sets Proeedngs of the Internatonal MultConferene of Engneers and Computer Sentsts 2016 Vol II Marh 16-18 2016 Hong Kong Data nalyss wth Fuzzy Measure on Intutonst Fuzzy Sets Sanghyuk Lee * Ka Lok Man Eng Gee

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Use of Multi-attribute Utility Functions in Evaluating Security Systems

Use of Multi-attribute Utility Functions in Evaluating Security Systems LLNL-TR-405048 Use of Mult-attrbute Utlty Funtons n Evaluatng Seurty Systems C. Meyers, A. Lamont, A. Sherman June 30, 2008 Ths doument was prepared as an aount of work sponsored by an ageny of the Unted

More information

Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3 Royal Holloway Unversty of London Department of Physs Seres Solutons of ODEs the Frobenus method Introduton to the Methodology The smple seres expanson method works for dfferental equatons whose solutons

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet 2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

24. Impact of Piracy on Innovation at Software Firms and Implications for Piracy Policy

24. Impact of Piracy on Innovation at Software Firms and Implications for Piracy Policy 4. mpat of Pray on nnovaton at Software Frms and mplatons for Pray Poly Jeevan Jasngh Department of nformaton & Systems Management, HKUST Clear Water Bay, Kowloon Hong Kong jeevan@ust.h Abstrat A Busness

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

Heuristic Static Load-Balancing Algorithm Applied to CESM

Heuristic Static Load-Balancing Algorithm Applied to CESM Heurstc Statc Load-Balancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,

More information

Multi-class kernel logistic regression: a fixed-size implementation

Multi-class kernel logistic regression: a fixed-size implementation Mult-lass kernel logst regresson: a fxed-sze mplementaton Peter Karsmakers,2, Krstaan Pelkmans 2, Johan AK Suykens 2 Abstrat Ths researh studes a pratal teratve algorthm for mult-lass kernel logst regresson

More information

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy

More information

Energy-Efficient Design in Wireless OFDMA

Energy-Efficient Design in Wireless OFDMA Ths full text paper was peer revewed at the dreton of IEEE Communatons Soety subjet matter experts for publaton n the ICC 2008 proeedngs. Energy-Effent Desgn n Wreless OFDMA Guowang Mao, Nageen Hmayat,

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Multi-settlement Systems for Electricity Markets: Zonal Aggregation under Network Uncertainty and Market Power 1

Multi-settlement Systems for Electricity Markets: Zonal Aggregation under Network Uncertainty and Market Power 1 Proeedngs of the 35th Hawa Internatonal Conferene on System Senes - 2002 Mult-settlement Systems for Eletrty Markets: Zonal Aggregaton under Network Unertanty and Market Power 1 Ransh Kamat and Shmuel

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

Cournot equilibria in two-settlement electricity markets with system contingencies. Jian Yao, Shmuel S. Oren* and Ilan Adler

Cournot equilibria in two-settlement electricity markets with system contingencies. Jian Yao, Shmuel S. Oren* and Ilan Adler 142 Int. J. Crtal Infrastrutures, Vol. 3, Nos. 1/2, 2007 Cournot equlbra n two-settlement eletrty markets wth system ontngenes Jan Yao, Shmuel S. Oren* and Ilan Adler Department of Industral Engneerng

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

An efficient constraint handling methodology for multi-objective evolutionary algorithms

An efficient constraint handling methodology for multi-objective evolutionary algorithms Rev. Fac. Ing. Unv. Antoqua N. 49. pp. 141-150. Septembre, 009 An effcent constrant handlng methodology for mult-objectve evolutonary algorthms Una metodología efcente para manejo de restrccones en algortmos

More information

HowHow to Find the Best Online Stock Broker

HowHow to Find the Best Online Stock Broker A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt

More information

Medium and long term. Equilibrium models approach

Medium and long term. Equilibrium models approach Medum and long term electrcty prces forecastng Equlbrum models approach J. Vllar, A. Campos, C. íaz, Insttuto de Investgacón Tecnológca, Escuela Técnca Superor de Ingenería-ICAI Unversdad ontfca Comllas

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Fuzzy Set Approach To Asymmetrical Load Balancing In Distribution Networks

Fuzzy Set Approach To Asymmetrical Load Balancing In Distribution Networks Fuzzy Set Approach To Asymmetrcal Load Balancng n Dstrbuton Networks Goran Majstrovc Energy nsttute Hrvoje Por Zagreb, Croata goran.majstrovc@ehp.hr Slavko Krajcar Faculty of electrcal engneerng and computng

More information

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH ESTABLISHIG TRADE-OFFS BETWEE SUSTAIED AD MOMETARY RELIABILITY IDICES I ELECTRIC DISTRIBUTIO PROTECTIO DESIG: A GOAL PROGRAMMIG APPROACH Gustavo D. Ferrera, Arturo S. Bretas, Maro O. Olvera Federal Unversty

More information

Peer-to-peer systems have attracted considerable attention

Peer-to-peer systems have attracted considerable attention Reputaton Aggregaton n Peer-to-Peer etwork Usng Dfferental Gossp Algorthm Ruhr Gupta, Yatndra ath Sngh, Senor Member, IEEE, arxv:20.430v4 [s.i] 28 Jan 204 Abstrat Reputaton aggregaton n peer to peer networks

More information

Preventive Maintenance and Replacement Scheduling: Models and Algorithms

Preventive Maintenance and Replacement Scheduling: Models and Algorithms Preventve Mantenance and Replacement Schedulng: Models and Algorthms By Kamran S. Moghaddam B.S. Unversty of Tehran 200 M.S. Tehran Polytechnc 2003 A Dssertaton Proposal Submtted to the Faculty of the

More information

Solving Factored MDPs with Continuous and Discrete Variables

Solving Factored MDPs with Continuous and Discrete Variables Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent

More information

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

Optimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account

Optimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account Amercan J. of Engneerng and Appled Scences (): 8-6, 009 ISSN 94-700 009 Scence Publcatons Optmal Bddng Strateges for Generaton Companes n a Day-Ahead Electrcty Market wth Rsk Management Taken nto Account

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

Lognormal random eld approxmatons to LIBOR market models O. Kurbanmuradov K. Sabelfeld y J. Shoenmakers z Mathemats Subet Classaton: 60H10,65C05,90A09 Keywords: LIBOR nterest rate models, random eld smulaton,

More information

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Hgh Dmensonal Data Analysis proposeations

Hgh Dmensonal Data Analysis proposeations Yuntao Qan, Xaoxu Du, and Q Wang Sem-supervsed Herarhal Clusterng Analyss for Hgh Dmensonal Data Sem-supervsed Herarhal Clusterng Analyss for Hgh Dmensonal Data Yuntao Qan, Xaoxu Du, and Q Wang College

More information

UTILIZING MATPOWER IN OPTIMAL POWER FLOW

UTILIZING MATPOWER IN OPTIMAL POWER FLOW UTILIZING MATPOWER IN OPTIMAL POWER FLOW Tarje Krstansen Department of Electrcal Power Engneerng Norwegan Unversty of Scence and Technology Trondhem, Norway Tarje.Krstansen@elkraft.ntnu.no Abstract Ths

More information

Credit Limit Optimization (CLO) for Credit Cards

Credit Limit Optimization (CLO) for Credit Cards Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt

More information

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo. ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract

More information

Simulation and optimization of supply chains: alternative or complementary approaches?

Simulation and optimization of supply chains: alternative or complementary approaches? Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z

More information

Response Coordination of Distributed Generation and Tap Changers for Voltage Support

Response Coordination of Distributed Generation and Tap Changers for Voltage Support Response Coordnaton of Dstrbuted Generaton and Tap Changers for Voltage Support An D.T. Le, Student Member, IEEE, K.M. Muttaq, Senor Member, IEEE, M. Negnevtsky, Member, IEEE,and G. Ledwch, Senor Member,

More information

Dynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network

Dynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network Dynamc Constraned Economc/Emsson Dspatch Schedulng Usng Neural Network Fard BENHAMIDA 1, Rachd BELHACHEM 1 1 Department of Electrcal Engneerng, IRECOM Laboratory, Unversty of Djllal Labes, 220 00, Sd Bel

More information

Optimal Adaptive Voice Smoother with Lagrangian Multiplier Method for VoIP Service

Optimal Adaptive Voice Smoother with Lagrangian Multiplier Method for VoIP Service Optmal Adaptve Voe Smoother wth Lagrangan Multpler Method for VoIP Serve Shyh-Fang HUANG, Er Hsao-uang WU and Pao-Ch CHANG Dept of Eletral Engneerng, Computer Sene and Informaton Engneerng and Communaton

More information

Time Value of Money Module

Time Value of Money Module Tme Value of Money Module O BJECTIVES After readng ths Module, you wll be able to: Understand smple nterest and compound nterest. 2 Compute and use the future value of a sngle sum. 3 Compute and use the

More information

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Educational Software for Economic Load Dispatch for Power Network of Thermal Units Considering Transmission Losses and Spinning Reserve Power

Educational Software for Economic Load Dispatch for Power Network of Thermal Units Considering Transmission Losses and Spinning Reserve Power Educatonal Software for Economc Load Dspatch for ower Network of Thermal Unts Consderng Transmsson Losses and Spnnng Reserve ower Mohammad T. Amel Saed Moslehpour Massoud ourhassan ower and Water Unversty

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Vulnerability Assessment of Cybersecurity for SCADA Systems Using Attack Trees

Vulnerability Assessment of Cybersecurity for SCADA Systems Using Attack Trees Vulnerablty Assessment of Cyberseurty for SCADA Systems Usng Attak Trees Chee-Woo Ten, Student Member, IEEE, Chen-Chng Lu, Fellow, IEEE, Manmaran ovndarasu, Member, IEEE Abstrat By penetratng the SCADA

More information

Simple Interest Loans (Section 5.1) :

Simple Interest Loans (Section 5.1) : Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

More information

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code

More information

A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES

A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES 82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu

More information

Cyber-Security Via Computing With Words

Cyber-Security Via Computing With Words Cyber-Seurty Va Computng Wth Words John. Rkard Dstrbuted Infnty, In. 4637 Shoshone Drve Larkspur, CO 808 Emal: trkard@dstrbutednfnty.om ABSRAC Cyber-seurty systems must deal wth a hgh rate of observable

More information

Analysis of Reactivity Induced Accident for Control Rods Ejection with Loss of Cooling

Analysis of Reactivity Induced Accident for Control Rods Ejection with Loss of Cooling Analyss of Reactvty Induced Accdent for Control Rods Ejecton wth Loss of Coolng Hend Mohammed El Sayed Saad 1, Hesham Mohammed Mohammed Mansour 2 Wahab 1 1. Nuclear and Radologcal Regulatory Authorty,

More information

When can bundling help adoption of network technologies or services?

When can bundling help adoption of network technologies or services? When an bundlng help adopton of network tehnologes or serves? Steven Weber Dept. of ECE, Drexel U. sweber@oe.drexel.edu Roh Guérn Dept. of CSE, WUSTL guern@wustl.edu Jaudele C. de Olvera Dept. of ECE,

More information

A method for a robust optimization of joint product and supply chain design

A method for a robust optimization of joint product and supply chain design DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Defining Contractor Performance Levels

Defining Contractor Performance Levels Defnng Contrator Performane Leels Khaled Nassar, Ph.D., AIA Assoate Professor, Ameran Unersty n Caro In many ountres, state and prate owners often ategorze ontrators nto arous groups based on ther apates

More information

Development of TIF for transaction cost allocation in deregulated power system

Development of TIF for transaction cost allocation in deregulated power system ISSN (Onlne) 31 004 ISSN (Prnt) 31 556 Development of TIF for transacton cost allocaton n deregulated power system Noolu.Narendra Reddy 1, Kurakula.Vmala Kumar P.G. Scholar, Department of EEE, JNTUA College

More information

(6)(2) (-6)(-4) (-4)(6) + (-2)(-3) + (4)(3) + (2)(-3) = -12-24 + 24 + 6 + 12 6 = 0

(6)(2) (-6)(-4) (-4)(6) + (-2)(-3) + (4)(3) + (2)(-3) = -12-24 + 24 + 6 + 12 6 = 0 Chapter 3 Homework Soluton P3.-, 4, 6, 0, 3, 7, P3.3-, 4, 6, P3.4-, 3, 6, 9, P3.5- P3.6-, 4, 9, 4,, 3, 40 ---------------------------------------------------- P 3.- Determne the alues of, 4,, 3, and 6

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

Stochastic Inventory Management for Tactical Process Planning under Uncertainties: MINLP Models and Algorithms

Stochastic Inventory Management for Tactical Process Planning under Uncertainties: MINLP Models and Algorithms Stochastc Inventory Management for Tactcal Process Plannng under Uncertantes: MINLP Models and Algorthms Fengq You, Ignaco E. Grossmann Department of Chemcal Engneerng, Carnege Mellon Unversty Pttsburgh,

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

NONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY

NONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY NONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY A Dssertaton Presented to the Faculty of the Graduate School of Cornell Unversty In Partal Fulfllment of the Requrements

More information

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance

Application of Quasi Monte Carlo methods and Global Sensitivity Analysis in finance Applcaton of Quas Monte Carlo methods and Global Senstvty Analyss n fnance Serge Kucherenko, Nlay Shah Imperal College London, UK skucherenko@mperalacuk Daro Czraky Barclays Captal DaroCzraky@barclayscaptalcom

More information

An Introduction to 3G Monte-Carlo simulations within ProMan

An Introduction to 3G Monte-Carlo simulations within ProMan An Introducton to 3G Monte-Carlo smulatons wthn ProMan responsble edtor: Hermann Buddendck AWE Communcatons GmbH Otto-Llenthal-Str. 36 D-71034 Böblngen Phone: +49 70 31 71 49 7-16 Fax: +49 70 31 71 49

More information

Analysis of Premium Liabilities for Australian Lines of Business

Analysis of Premium Liabilities for Australian Lines of Business Summary of Analyss of Premum Labltes for Australan Lnes of Busness Emly Tao Honours Research Paper, The Unversty of Melbourne Emly Tao Acknowledgements I am grateful to the Australan Prudental Regulaton

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Chapter 6. Demand Relationships Among Goods

Chapter 6. Demand Relationships Among Goods Chapter 6 Demand Relatonshps Among Goods Up to ths pont, we have held the pre of other goods onstant. Now we onsder how hanges n p affet n a two-good world. I p I p I p I p p p ( ) ( ) then I p then (

More information

Examensarbete. Rotating Workforce Scheduling. Caroline Granfeldt

Examensarbete. Rotating Workforce Scheduling. Caroline Granfeldt Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015

More information

Software project management with GAs

Software project management with GAs Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de

More information

2. SYSTEM MODEL. the SLA (unlike the only other related mechanism [15] we can compare it is never able to meet the SLA).

2. SYSTEM MODEL. the SLA (unlike the only other related mechanism [15] we can compare it is never able to meet the SLA). Managng Server Energy and Operatonal Costs n Hostng Centers Yyu Chen Dept. of IE Penn State Unversty Unversty Park, PA 16802 yzc107@psu.edu Anand Svasubramanam Dept. of CSE Penn State Unversty Unversty

More information

Computational Fluid Dynamics II

Computational Fluid Dynamics II Computatonal Flud Dynamcs II Eercse 2 1. Gven s the PDE: u tt a 2 ou Formulate the CFL-condton for two possble eplct schemes. 2. The Euler equatons for 1-dmensonal, unsteady flows s dscretsed n the followng

More information

Statistical Methods to Develop Rating Models

Statistical Methods to Develop Rating Models Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and

More information

Pricing Energy and Ancillary Services in Integrated Market Systems by an Optimal Power Flow

Pricing Energy and Ancillary Services in Integrated Market Systems by an Optimal Power Flow Prcng Energy and Ancllary Servces n Integrated Maret Systems by an Optmal Power Flow Tong Wu, Member, IEEE, Mar Rothleder, Member, IEEE, Zad Alaywan, Senor Member, IEEE, Alex D. Papalexopoulos, Fellow,

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

L10: Linear discriminants analysis

L10: Linear discriminants analysis L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

A Dynamic Load Balancing for Massive Multiplayer Online Game Server

A Dynamic Load Balancing for Massive Multiplayer Online Game Server A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

Online Procurement Auctions for Resource Pooling in Client-Assisted Cloud Storage Systems

Online Procurement Auctions for Resource Pooling in Client-Assisted Cloud Storage Systems Onlne Procurement Auctons for Resource Poolng n Clent-Asssted Cloud Storage Systems Jan Zhao, Xaowen Chu, Ha Lu, Yu-Wng Leung Department of Computer Scence Hong Kong Baptst Unversty Emal: {janzhao, chxw,

More information

Testing and Debugging Resource Allocation for Fault Detection and Removal Process

Testing and Debugging Resource Allocation for Fault Detection and Removal Process Internatonal Journal of New Computer Archtectures and ther Applcatons (IJNCAA) 4(4): 93-00 The Socety of Dgtal Informaton and Wreless Communcatons, 04 (ISSN: 0-9085) Testng and Debuggng Resource Allocaton

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

Activity Scheduling for Cost-Time Investment Optimization in Project Management PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng

More information