International Journal of Scientific & Engineering Research, Volume 5, Issue 7, July ISSN
|
|
- Lily Harrell
- 6 years ago
- Views:
Transcription
1 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS Secury Consraned Un Commmen Based Load and Prce Forecasng Usng Evoluonary Opmzed LSVR Ehab E. Elaar, Member, IEEE, and Tamer A. Farrag Absrac In hs paper, a local predcor approach based on proven powerful regresson algorhm whch s suppor vecor regresson (SVR) combned wh space reconsrucon of me seres s nroduced. In addon, real value genec algorhm (GA) has been ulzed n he proposed mehod for opmzaon of he parameers of he SVR. In he proposed approach, he embeddng dmenson and he me delay consan for he load and prce daa are compued frsly, and hen he connuous load and prce daa are used for he phase space reconsrucon. Subsequenly, he reconsruced daa marx s subjec o he local predcon algorhm. Then he forecased loads and prce are fed no IEEE 30 bus es sysem for secury consran un commmen o show he reacons of un commmen o load and prce forecasng errors. The proposed model s evaluaed usng real world daase. The resuls show ha he proposed mehod provdes a much beer performance n comparson wh oher models employng he same daa. Index Terms Load forecasng, prce forecasng, local predcors, secury consraned un commmen, suppor vecor regresson, genec algorhm, sae space reconsrucon. ITRODUCTIO HORT erm load forecasng (STLF) s a val par of he op- of power sysems. STLF very valuable ool. Ths s because of he upheaval of deregulaon n elecrcy marke. Shor-erm prce forecasng n a Seraon ams o predc elecrc loads for a perod of mnues, hours, days, or weeks. STLF has always been a compeve elecrcy marke s sll a challengng ask because of he specal elecrc prce characerscs [7], [8], such as very mporan ssue n economc and relable power sysems operaon such as un commmen, reducng spnnng reserve, manenance schedulng, ec. calendar effec, hgh volaly, hgh percenage of unusual hgh-frequency, non-saonary behavor, mulple seasonaly, Several STLF mehods ncludng radonal and arfcal prces, hard non-lnear behavor ec. nellgence-based mehods have been proposed durng he In he leraure, several echnques for shor-erm elecrcy prces forecasng have been repored, namely radonal las four decades. The relaonshp beween elecrc load and s exogenous facors s complex and nonlnear, makng and AI-based echnques. The radonal echnques nclude auoregressve negraed movng average (ARIMA) [9], wavele-arima [0] and mxed model [] approaches. Alhough, que dffcul o be modeled hrough radonal echnques such as lnear or mulple regresson [], auoregressve movng average (ARMA), exponenal smoohng mehods [2], hese echnques are well esablshed o have good performance, hey canno always represen he non-lnear characerscs of he complex prce sgnal. Moreover, hey requre a lo Kalman-fler-based mehods [3], ec. On he oher hand, varous arfcal nellgence echnques were used for STLF; of nformaon, and he compuaonal cos s very hgh. among hese mehods, arfcal neural neworks (As) have On he oher hand, AI-based echnques have been used by receved he larges share of aenon. The As ha have many researchers for he prce forecasng n elecrcy markes. These mehods can deal wh he non-lnear relaon be- been successfully used for STLF are based on mullayered perceprons [4]. The neural fuzzy nework has also been used ween he nfluencng facors and he prce sgnal, herefore for load forecasng [5]. Radal bass funcons (RBFs) [6] have he forecasng precson s rased. These echnques nclude been also used for day-ahead load forecasng, gvng beer neural nework () [2], radal bass funcon [3], fuzzy resuls han ha of he convenonal neural neworks. neural nework (F) [4] and hybrd nellgen sysem (HIS) Accurae forecasng of he elecrcy prce has become a [5] Recenly, SVR [6], [7] has also been appled successfully o STLF and prce forecasng. SVR replaces he emprcal rsk mnmzaon whch s generally employed n he classcal Ths work was suppored bytaf Unversy, KSA under gran mehods such as As, wh a more advanageous srucural The Auhors are wh he deparmen of he Elecrcal Engneerng, Faculy of Engneerng, Taf Unversy, Kgdom of Saud Araba. rsk mnmzaon prncple. SVR has been shown o be very Ehab E. Elaar on leave from he Deparmen of Elecrcal Engneerng, ressan o he over fng problem and gve a hgh generalzaon performance n forecasng problems [8]. Faculy of Engneerng, Menofa Unversy, Shebn El-Kom, Egyp (e-mal: Udr.elaar0@yahoo.comU5T). All he above echnques are known as global predcors n Tamer A. Farrag s on leave from he Deparmen of Communcaons and whch a predcor s raned usng all daa avalable bu gve a Elecroncs, Msr hgh nsue of Engneerng and Technology, Egyp. predcon usng a curren daa wndow. The global predcors suffer from some drawbacks whch are dscussed n our prevous work [9], [20]. To overcome hese drawbacks, he local 204 hp://
2 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS SVR predcor s proposed n our prevous work [9] [2] and can be used o solve he STLF and prce forecasng problem. Phase space reconsrucon s an mporan sep n local predcon mehods. The radonal me seres reconsrucon echnques usually use he coordnae delay (CD) mehod [22] o calculae he embeddng dmenson and he me delay consan of he me seres [23]. Alhough local SVR (LSVR) mehod gves good predcon accuracy when s appled o STLF and prce forecasng, has a serous problem. Ths problem s ha here s a lackng of he srucural mehods for confrmng he selecon of SVR s parameers effcenly. So, n hs paper, a local predcor approach based on proven powerful regresson algorhm whch s SVR combned wh space reconsrucon of me seres s nroduced. In addon, real value genec algorhm (GA) has been ulzed n he proposed mehod for opmzaon of he parameers of he SVR. The proposed algorhm s called evoluonary opmzed LSVR (EOLSVR). Un commmen problem (UC) s a nonlnear, mxed neger combnaoral opmzaon problem. The UC problem s he problem of decdng whch elecrcy generaon uns should be scheduled economcally n a power sysem n order o mee he requremens of load and spnnng reserve. I s a dffcul problem o solve n whch he soluon procedures nvolve he economc dspach problem as a sub-problem. Snce UC searches for an opmum schedule of generang uns based on load forecasng daa, he mprovemen of load forecasng s frs sep o enhance he UC soluon [24]. In hs paper, we propose secury consraned un commmen (SCUC) mehod o reduce he producon cos by combnng load and prce forecasng wh UC problem. Frs, shor-erm loads and prce are forecased usng EOLSVR, local 2 TIME SERIES RECOSTRUCTIO onlnear me seres analyss and predcon have become a relable ool for he sudy of complex me seres and dynamcal sysems. A commonly used ool s he phase space reconsrucon echnque whch sems from he embeddng heorem developed by Takens and Sauer [22], [25]. I llusraes clearly he phase space rajecory of a me seres n he 204 hp:// embedded space nsead of he rajecory n he me doman. The heorem regards an -dmensonal me seres x() for =, 2,..., as compressed hgher dmensonal nformaon and, hus, s feaures can be exraced by exendng x() o a vecor X() n a d-dmensonal space as follows: [ x( ), x( m), x( 2m),..., x( ( d ) )] X ( ) = m where d denoes he embeddng dmenson of he sysem and m s he delay consan. Based on Takens heorem [22], o oban a fahful reconsrucon of he dynamc sysem, he embeddng dmenson mus sasfy d 2 D a +, where D a s he dmenson of he aracor. In order o oban an approprae model reconsrucon, s necessary o esmae d and m. The correlaon dmenson mehod [26] s he mos popular mehod for deermnng d because of s compuaonal smplcy. The muual nformaon mehod proposed n [27] usually provdes a good creron for he selecon of m. In general, he proper value of m corresponds o he frs local mnmum of muual nformaon. In hs paper, he correlaon dmenson mehod [26] and he muual nformaon mehod [27] are used o calculae d and m respecvely. The deals of how o choose he proper values of d and m usng hese wo mehods have been repored n [9]. 3 GEETIC ALGORITHM The GA s a search algorhm for opmzaon, based on he mechancs of naural selecon and genecs [28], [29]. The GA s able o search very large soluon spaces effcenly by provdng a lower compuaonal cos, snce hey use probablsc ranson rules nsead of deermnsc ones. GA has a SVR and local RBF models. Then UC problem s solved usng number of componens or operaors ha mus be specfed n he dynamc programmng mehod. We have chosen he hsorcal daa for he Souh Ausrala elecrcy marke, whch ncludes he power demand and prce for he perod of Hsorcal weaher daa was colleced from Macquare Unversy Web Se. Then he forecased loads and prce are fed no IEEE 30 bus es sysem for un commmen o show he reacons of un commmen o forecasng errors. The paper s organzed as follows: Secon 2 revew he me seres reconsrucon mehod. Secon 3 gves a bref dscrbon abou GA. A revew of he SCUC problem and s formulaon are presened brefly n Secon 4. The proposed mehod s presened n deals n Secon 5. Applcaons and smulaons for load and prce forecasng and UC problem are gven n Secons 6. Fnally, Secon 7 concludes he work. order o defne a parcular GA. The mos mporan componens are represenaon, fness funcon, selecon mehod, crossover, muaon and ermnaon. The GA sars wh an nal populaon of ndvduals (generaon) whch are generaed randomly. Every ndvdual (chromosome) encodes a sngle possble soluon o he problem under consderaon. The fes ndvduals are seleced by rankng hem accordng o a pre-defned fness funcon, whch s evaluaed for each member of hs populaon. The ndvduals wh hgh fness values herefore represen beer soluon o he problem han ndvduals wh lower fness values. There are many dfferen selecon operaors presened by some researchers such as sochasc samplng wh replacemen roulee wheel selecon and ournamen selecon [30]. Followng hs nal process, he crossover and muaon operaons are used where he ndvduals n he curren populaon produce he chldren (offsprng). The dea behnd he crossover operaor s o combne useful segmens of dfferen parens o form an offsprng ha benefs from advanageous b combnaons of boh parens [3]. Whle, by muaon, ndvduals are randomly alered. These varaons (muaon seps) are mosly small [3]. ormally, offsprng are muaed afer beng creaed by crossover. I s nended o preven ()
3 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS premaure convergence and loss of genec dversy. A new populaon of ndvduals (generaon) s hen formed from he ndvduals n curren populaon and he chldren. Ths new populaon becomes he curren populaon and he erave cycle s repeaed unl a ermnaon condon s reached [28]. 4 SECURITY COSTRAIT UIT COMMITMET (SCUC) The objecve of secury-consraned un commmen (SCUC) dscussed n hs work s o oban a un commmen schedule a mnmum producon cos whou compromsng he sysem relably. The relably of he sysem s nerpreed as sasfyng wo funcons: adequacy and secury. In several power markes, he ndependen sysem operaor ISO plans he day-ahead schedule usng (SCUC)[32], [33]. The radonal un commmen algorhm deermnes he un schedules o mnmze he operang coss and sasfy he prevalng consrans such as load balance, sysem spnnng reserve, ramp rae lms, fuel consrans, mulple emsson requremens and mnmum up and down me lms over a se of me perods. The scheduled uns supply he load demands and possbly manan ransmsson flows and bus volages whn her permssble lms [34]. However, n crcumsances where mos of he commed uns are locaed n one regon of he sysem, becomes more dffcul o sasfy he nework consrans hroughou he sysem. Mahemacally, he objecve funcon, or he oal operang cos of he sysem can be wren as follows [32], [33]: HS, f X T off, [ F ( P ) + S ( u ) ] S = T mn u (2) P u = = where P s he oupu power of un a perod, u s he commmen sae of un a perod, F ( P ) s he fuel cos of un a oupu power P, S s he sar up prce of un a perod, s he number of generang un and T s he oal number of schedulng perods. The consrans are as follows: Power balance: u P = where D s he cusomers demand n me nerval. Generang lms: These lms defne he regon whn whch a un mus be dspached. u P mn P Mnmum up me: Once he un s commed, mus be kep runnng for ceran number of hours, called he mnmum up me, before allowng urnng off. Ths can be formulaed as follows: up ( X on T )( u u ) X ( ) on, = X on, + u D u P, 0 max (3) (4) (5) 204 hp:// X, where, on s he number of hours he un has been on up lne and T s he mnmum up me. Mnmum down me: Once he un s urned off, s no allowed o be brough onlne agan before spendng ceran number of hours called mnmum down me. Ths can be formulaed as follows: down ( X T )( u u ) X off, 0 off, = ( X + )( u ) off, where X off, s he number of hours he un has been off down lne and T s he mnmum down me. Spnnng reserve: I can be modeled as follows: u P max D + R (7) where R s he spnnng reserve requremens. Transmsson flow lm from bus k o bus m: max P km P km ( ) = f where P() s he real power generaon vecor and φ() s he phase shfer conrol vecor a me T. The Sar up cos whch can be modeled by he followng form: CS, f X > T down + CH (9) off, where, HS, CS s he un s ho/cold sar up cos and CH s he cold sar hour. F P s frequenly represened by he followng polynomal funcon: Fuel cos funcons ( ) F P = a + b P + c P (0) where a, b, c are he coeffcens for he quadrac cos curve of generang un. 5 EVOLUTIOARY OPTIMIZED LOCAL SUPPORT VECTOR REGRESSIO (EOLSVR) 5. Suppor Vecor Regresson (SVR) The basc dea of SVR s o map he daa x no a hgh dmensonal feaure space va a nonlnear mappng, and perform a lnear regresson n ha feaure space [7] as: ( x) w x b f =, + () max ( P( ), ϕ( ) ) p down ( ) ( ) 2 + CH km (6) (8)
4 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS Where.,. denoes he do produc, w conans he coeffcens ha have o be esmaed from he daa and b s a real consan. Usng Vapnk s ε nsensve loss funcon [6], he overall opmzaon s formulaed as: mn w, b, ξ, ξ 2 T w w + C = ( ξ + ξ ) T y ( w φ( x ) + b) ( ( ) ) ε + ξ 5.2 Local predcors Local predcon s concerned wh predcng he fuure based only on a se of K neares neghbors n he reconsruced embedded space whou consderng he hsorcal nsances whch are dsan and less relevan. Local predcon consrucs he rue funcon by subdvson of he funcon doman no many subses (neghborhoods). Therefore, he dynamcs of me seres can be capured sep by sep locally n he phase space and he drawbacks of global mehods can be overcome. The local SVR (LSVR) and local RBF (LRBF) mehods can be summarzed as follows [9]: 204 hp:// Frs, reconsruc he me seres as descrbed n he prevous secon. For, each query vecor q, he K neares neghbors {z q,z q 2,...,z q K} among he ranng npus s choosng usng he Eucldan dsance as he dsance merc beween he q and each z n he reconsruced me seres. Usng hese Kneares neghbors, ran he SVR (or RBF) o obansuppor vecors and correspondng coeffcens. Fnally, he oupu of SVR (or RBF) can be compued. T 5.3 EOLSVR subjec o w φ x + b y ε + ξ (2) There are some key parameers for SVR, whch are C, ε ξ, ξ 0, =,..., and σ n he Gaussan kernel funcon. The selecon of hese parameers s mporan o he generalzaon of he predcon. Inapproprae parameers n SVR lead o overfng or where, x s mapped o hgher dmensonal space by he funcon φ, ε s a real consan, ξ and ξ are slack varables under-fng [35]. Therefore, hese parameers mus be chosen subjec o ε-nsensve zone and he consan C deermnes he carefully. However choosng he opmal parameers s a very rade-off beween he flaness of f and ranng errors. mporan sep n SVR, here are no general gudelnes avalable o selec hese parameers ll now. The problem of opmal Inroducng Lagrange mulplers α and α wh α α =0 and α, α =0 for =,,, and accordng o he Karush-Kuhn- parameers selecon s very complcaed because he complexy of SVR (and hence s generalzaon performance) depends Tucker opmaly condons [7], he SVR ranng procedure amouns o solvng he convex quadrac problem: on all hree parameers ogeher. Thus, a separae selecon of each parameer s no adequae o ge an opmal regresson model. mn ( α α )( α j α j ) Q( x, x j ) + α, α 2, j= There are many rals o choose he SVR s parameers. Varous auhors have seleced hese parameers by experence ( ε α + α ) y ( α α ) [6], [36] bu hs mehod s no suable for nonexper users. = = The grd search opmzaon mehod has been proposed by 0 α Scholkopf and Smola [37] o ge he opmal parameers of, α C subjec o (3) SVR. However, hs mehod s me consumng. The cross valdaon mehod has been also used o selec he SVR s parame- = ( α α ) = 0, =,..., ers [36]. Ths mehod s very compuaonally nensve and The oupu s a unque global opmzed resul ha has daa-nensve. Pa and Hong proposed a GASVR model [38] he form: o opmze he SVR s parameers n whch he parameers are (4) ( α ) f ( x) = α = where, Q(x,x)= φ(x). φ (x). Usng kernels, all necessary compuaons can be calculaed drecly n he npu space, whou compung he explc map φ(x). Varous kernel ypes exs such as lnear, hyperbolc angen, Gaussan, polynomal, ec. [7]. Here, we employ he commonly used Gaussan kernel whch can be as defned as followng: x x Q( x = (5), x) exp 2 2σ Q( x, x ) + b j encoded as a bnary code. Ths mehod suffers from some problems. The frs one s ha encodng he parameers as bnary code wll lead o neger valued soluons and may suffer from he lack of accuracy [29]. In addon, f he lengh of he srng s no long enough, mgh be possble for he GA o ge near o he regon of he global opmum bu never wll arrve a. As evden from above, here s a lackng of he srucural mehods for confrmng he selecon of SVR s parameers effcenly. Therefore, a real value GA s proposed n hs work o selec he SVR s parameers of local SVR mehod whch smulaneously opmzes all SVR s parameers from he ranng daa. The seps for load and prce forecasng based on he proposed mehod can be summarzed as followng: Sep : Reconsruc he me seres: Load he mulvar ae me seres daase X = (x (), x 2(),..., x M()), ( =, 2,...,). Usng he correlaon dmenson mehod and he muual nformaon mehod, calculae he embeddng dmenson d and he me delay consan m for each me seres daa se. Then, reconsruc he mulvarae me seres usng hese values. Sep 2: Form a ranng and valdaon daa: The npu daase afer reconsrucon X ~ s dvded no wo pars, ha s a ranng X ~ daase and valdaon r X ~ daase. The va
5 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS EXPREMET RESULTS sze of he ranng daase s r whle he sze of he valdaon daase s va. Sep 3: For each query pon xq, choosng he K neares neghbors of hs query pon usng he Eucldan dsance beween x q and each pon n X r ( < K<<< X ~ r ). Sep 4: Represenaon and generaon of nal populaon: In real value GA he real value parameers can be used drecly o form he chromosome. Ths means ha he chromosome represenaon n real value GA s sraghforward. In hs case, he hree parameers C, ε and σ are drecly coded o generae he chromosome CH = {C, ε, σ}. These chromosomes are all randomly nalzed. Sep 5: Evaluaon: each chromosome s evaluaed usng he fness funcon whch measures he performance of he model. I s que mporan for evolvng sysems o fnd a good fness measuremen. The fness (F) of each chromosome evaluaed usng mean absolue percenage error (MAPE) defned as: where A and F are he acual value and he forecased value, respecvely, va s he valdaon daase sze, and denoes he es nsance ndex. Sep 6: Selecon: A sandard roulee wheel selecon mehod s employed o selec he fes chromosomes from he curren populaon. Sep 7: Crossover: The operaor of crossover can now be mplemened o produce wo offsprng from wo parens whch are chosen usng he roulee wheel selecon mehod. In hs work, he lne arhmecal crossover s used [28]. Sep 8: Muaon: Smlarly, he muaon operaon can conrbue effecvely o he dversy of he populaon. In hs work, he Gaussan muaon [28] s used. Sep 9: Els sraegy: The chromosome ha has he wors fness value n he curren generaon s replaced by he chromosome ha has he bes fness value n he old generaon Sep 0: Check he soppng creron: The modellng can be ermnaed when he soppng creron s reached. In hs work, we use a predeermned maxmum number of generaons as a ermnaon condon. If he soppng creron s no sasfed, he model has o be expanded, he seps 5 o 9 can be repeaed unl he soppng creron s sasfed. Sep : Afer he ermnaon condon s sasfed, he chromosome whch gves he bes performance n he las generaon s seleced as he opmal values of SVR s parameers. Sep 2: Tran SVR: The K neares neghbors of he query pon and he opmzed parameers are used o ran he SVR algorhm. Sep 3: Calculae he predcon value of he curren query pon usng equaon (4). Sep 4: Then, he seps 3 o 3 can be repeaed unl he fuure values of dfferen query pons are all acqured. 204 hp:// In hs paper, he performance of he EOLSVR s esed and compared wh local SVR and local RBF usng hourly load prce and emperaure daa n Souh Ausrala. The load daa used ncludes hourly load and prce for he perod of for he Souh Ausrala elecrcy marke. Whle he hourly emperaure for he same perod s colleced from Macquare unversy web se. 6. Parameers To mplemen a good model, here are some mporan parameers o choose. Choosng he proper values of d and m s a crcal sep n he algorhm. The correlaon dmenson mehod and he muual nformaon mehod are used o selec d and m, respecvely, and he opmal values of hese parameers are shown n Table. Usng he obaned values of d and m, he mulvarae me seres can be reconsruced as descrbed n Secon 2. va TABLE A F MAPE = 00 (6) PHAE RECOSTRUCTIO PARAMETERS va = A Load daa Temperaure daa Prce daa Daase d m d m d m Souh Ausrala elecrcy marke Choosng K s very mporan sep n order o esablsh he local predcon model. There are some mehods used n leraures o fnd hs parameer. In hs paper K s calculaed usng a sysemac mehod whch s proposed by us n [20]: kmax α (7) K round k = max D max = k = D k ( x ) where, s he number of ranng pons, k max s he maxmum number of neares neghbors, D k(x) s he dsance beween each ranng pon x and s neares neghbors whle D max s he maxmum dsance, kmax = = D k k ( x ) kmax Dmax s he average dsance around he pons whch s nversely proporonal o he local denses and α s a consan. The wo consans k max and α are very low sensvy parameers. k max can be chosen as a percenage of he number of ranng pons () for effcency whle α can be chosen as a percenage. In hs paper, k max and α are always fxed for all es cases a 70% of and 95, respecvely. 6.2 Forcasng Accuracy Evaluaon For all performed expermens, we quanfed he predcon performance wh he Mean Absolue Error (MAE) and Mean Absolue Percenage Error (MAPE). They can be defned as follows: MAE = n MAPE = n n = n = A( ) F( ) A( ) F( ) 00 A( ) (8)
6 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS (9) TABLE 5 IMPROVEMET OF THE EOLSVR OVER OTHER APPROACHES where, A and F are he acual and he forecased loads, respecvely, n s he esng daase sze, and denoes he es nsance ndex. 6.3 Resuls and Dscusson The performance of he evoluonary opmzed local SVR (EOLSVR) s esed and compared wh local SVR and local RBF usng hourly load, prce and emperaure daa n Souh Ausrala. To make resuls comparable, he same expermenal seup s used for he hree predcors. Tha s he week of February 5-2, 2005 has been used as a esng week. The avalable hourly load and emperaure daa (for he perod of ) are used o forecas he load of esng week. Also, he avalable hourly prce and emperaure daa (for he perod of ) are used o forecas he prce of esng week. Frs, we calculae he MAE and MAPE of each day durng he esng week. Then he average MAE and MAPE values of each mehod for he esng week are calculaed. The resuls are shown n Tables 2 and 3. These resuls show ha, he EOLSVR mehod ouperforms local SVR and local RBF. Table 4 shows he MAE mprovemens of he EOLSVR mehod over local SVR and local RBF. Whle Table 5 shows he MAPE mprovemens of he EOLSVR mehod over local SVR and local RBF. These resuls show he TABLE 2 LOAD FORECASTIG RESULTS Local RBF Local SVR EOLSVR MAE (GW) MAPE (%) superory of he proposed mehod over oher mehods. TABLE 3 Prce Forecasng Resuls Local RBF Local SVR EOLSVR MAE (GW) MAPE (%) REGARDIG MAPE Load Forecasng Prce Forecasng MAPE Improvemen MAPE Improvemen EOLSVR Local RBF % % Local SVR % % Fg. Forecased and acual hourly load from 5h o 2s February 2005 usng local RBF Fgures -3 show he acual load and forecased load values usng local RBF, local SVR and EOLSVR, respecvely for he esng week. TABLE 4 IMPROVEMET OF THE EOLSVR OVER OTHER APPROACHES REGARDIG MAE Load Forecasng Prce Forecasng MAE Improvemen MAE Improvemen EOLSVR Local RBF % % Local SVR % % Fg. 2 Forecased and acual hourly load from 5h o 2s February 2005 usng local SVR 204 hp://
7 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS The resuls of load and prce forecasng are fed no he IEEE 30 bus es sysem. The IEEE 30 bus es sysem s used wh a oal of 6 generaors and 4 lnes. Table 6 shows he es sysem daa. The spnnng reserve s assumed o be 0% of he demand. The acual loads (24 hour) as well as he forecased loads are gven n Table 7. If he nal commmen sae of a generaor s, means hs generaor s on and zero ndcaes hs generaor s off. The IEEE 30 bus es sysem has 4 lnes. Each lne can ransm a maxmum power flow n MW. Table 8 shows he maxmum power flow for each lne Feasble un combnaon and oal cos (TC) values of he es sysem usng dynamc programmng mehod for load values and forecasng load values are gven n Table 9. I s clear ha accurae load forecasng s very mporan for he UC soluon. The oal cos of he forecasng load values for local RBF mehod s more han ha of acual load values by $ Addonally, he oal cos of he forecasng load values for local SVR s more han ha of acual load values by $506. Whereas he oal cos of he forecasng load values for EOLSVR s more han ha of acual load values by $ COCLUSIO In hs paper, we have proposed EOLSVR mehod for elecrcal load and prce forecasng. Afer ha he resuls of load and prce forecasng are used o solve he secury consran un commmen problem. The proposed mehod combnes a proven powerful regresson algorhm whch s SVR wh a local predcon framework. For daa preprocessng, he embeddng dmenson and he me delay consan for he npu daa are compued frsly, and hen he connuous load and prce daa are used for he phase space reconsrucon. In addon, he neghborng pons are presened by Eucldan dsance. Accordng o hese neghborng pons, he local model s se up. The local predcors can overcome he drawbacks of he global predcors by nvolvng more han one model o ulze he local nformaon. Therefore, he accuracy of he local predcor s beer 204 hp:// han he global predcor n whch only one model s engaged for all avalable daa ha conans rrelevan paerns o he curren predcon pon. In addon, o se he SVR s parameers appropraely, a new mehod s proposed. Ths mehod adops real value GA o seek he opmal SVR s parameers values and mproves he predcon accuracy. Then he forecased loads and prce are fed no IEEE 30 bus es sysem for secury consran un commmen o show he reacons of un commmen o load and prce forecasng errors. Dynamc programmng mehod s used for solvng he UC problem. Toal coss are calculaed for load daa whch s aken from Souh Ausrala elecrcy marke and forecasng load and prce daa compued by local RBF, local SVR and EOLSVR, separaely. Comparng hese oal coss show ha accurae load forecasng s mporan for UC. Over-predcon of STLF wases resources snce more reserves are avalable han needed and, n urn, ncreases he operang cos. On he oher hand, under-predcon of STLF leads o a falure o provde he necessary reserves whch s also relaed o hgh operang cos due o he use of expensve peakng uns. ACKOWLEDGMET The auhors graefully acknowledge he Taf Unversy for s suppor o carryou hs work. I funded hs projec wh a fund number REFERECES [] A. D. Papalekopulos and T. C. Heserberg, A regresson-based approach o shor-erm sysem load forecasng, IEEE Trans. Power Sys., 5 (4), , ov [2] J. W. Taylor, L. M. de Menezes, and P. E. McSharry, A comparson of unvarae mehods for forecasng elecrcy demand up o a day ahead, In. J. Forecasng, 22 (), 6, [3] J. H. Park, Y. M. Park, and K. Y. Lee, Compose modelng for adapve shorerm load forecasng, IEEE Trans. Power Sys., 6 (2), , May 99. [4] H. S. Hpper, C. E. Pedrera, and R. C. Souza, eural neworks for shor erm load forecasng: A revew and evaluaon, IEEE Trans. Power Sys., 6 (), pp , Feb [5] C. J. Ln, C. H. Chen, and C. T. Ln, A hybrd of cooperave parcle swarm opmzaon and culural algorhm for neural fuzzy neworks and s predcon applcaons, IEEE Trans. Sys.,Man, Cyber. C, Appl. Rev., 39 (), 55 68, Jan [6] S. Sheng and C. Wang, Inegrang radal bass funcon neural nework wh fuzzy conrol for load forecasng n power sysem, n Proc. IEEE Trans. Ds. Conf. Exhb. Asa and Pacfc, 2005, pp. 5. [7] C. Maros, J. Rodrguez, and M. Sanchez, Forecasng elecrcy prces by exracng dynamc common facors: applcaon o he Iberan Marke, IET Gener. Transm. Dsrb., 6, (), 20, 202. [8] L. San, S. Aggarwal, and A. Kumar, Parameer opmsaon usng genec algorhm for suppor vecor machne-based prce forecasng model n aonal elecrcy marke, IET Gener. Transm. Dsrb., 4, (), 36 49, 200. [9] T. Jakasa, I. Androces,and P. Sprcc, Elecrcy prce forecasng ARIMA model approach. Eghh In. Conf. Eur. Energy Marke (EEM), 20, pp [0] A. Conejo, M. Plazas, R. Espnola, and A. Molna, Day-ahead elecrcy prce forecasng usng he wavele ransform and ARIMA models, IEEE Trans.
8 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS Power Sys., 20 (2), , [] C. Garca-Maros, C., J. Rodrguez and M. Sanchez, Mxed models for shorrun forecasng of elecrcy prces: applcaon for he Spansh marke, IEEE Trans. Power Sys., 22,(2), , [2]. Amjady, A. Daraeepour, and F. Keyna, Day-ahead elecrcy prce forecasng by modfed relef algorhm and hybrd neural nework, IET Gener. Transm. Dsrb., 4 (3), , 200. [3] L. Coelhoa, and A. Sanosb, A RBF neural nework model wh GARCH errors: applcaon o elecrcy prce forecasng, Elecr. Power Sys. Res., 8, 74 83, 20. [4] F. Lra, C. Munoz, F. unez, and A. Cprano, Shor-erm forecasng of elecrcy prces n he Colomban elecrcy marke, IET Gener. Transm. Dsrb., 3 (), , [5]. Amjady, and H. Hemma, Day-ahead prce forecasng of elecrcy markes by a hybrd nellgen sysem, Eur. Trans. Elecr. Power, 9 (), 89 02, [6] V.. Vapnk, Sascal Learnng Theory. ew York: Wley, 998. [7] A. J. Smola and B. Scholkopf, A uoral on suppor vecor regresson, Royal Holloway College, Unv., London, U.K., eurocolt Tech. Rep. C-TR , 998. [8] M. Zhang, Shor-erm load forecasng based on suppor vecor machnes regresson, n Proceedngs of he Fourh In. Conf. on Machne Learnng and Cybernecs, Chna, 8 2 Augus [9] E. E. El-Aar, J. Y. Goulermas, and Q. H. Wu, Forecasng elecrc daly peak load based on local predcon, n IEEE Power Eng. Soc. General Meeng (PESGM09), Canada, Jul , 2009, pp. 6. [20] E. E. Elaar, J. Y. Goulermas, and Q. H. Wu, Elecrc load forecasng based on locally weghed suppor vecor regresson, IEEE Trans. Sys., Man and Cyber. C, Appl. and Rev., vol. 40, no. 4, pp , Jul [2] E. E. Elaar, J. Y. Goulermas, and Q. H. Wu, Inegrang KPCA and locally weghed suppor vecor regresson for shor-erm load forecasng, n Proc. 5h IEEE Mderranean Elecroechncal Conf. Vallea, Mala, Apr , 200, pp [22] F. Takens, Deecng Srange Aracors n Turbulence, Lec. oes n Mahemacs (Sprnger Berln), vol. 898, pp , 98. [23] D. Tao and X. Hongfe, Chaoc Tme Seres Predcon Based on Radal Bass Funcon ework, Proc. Eghh ACIS In. Conf. on Sofware Engn., Arfcal Inellgence, eworkng, and Parallel/Dsrbued Compung, pp , [24] T. Saksorncha, W. Lee, K. Mehaprayoon, J. Lao, and J. Rchard, Improve he un commmen schedulng by usng he neural- nework-based shorerm load forecasng, IEEE Trans. on Indusry applcaons, vol. 4, no., pp , Jan [25] T. Sauer, J. A. Yorke, and M. Casdagl, Embedology, Journal of Sascal Physcs, vol. 65, pp , May 99. [26] P. Grassberger and I. Procacca, Esmaon of he kolmogorov enropy from a chaoc sgnal, Physcs Revew A, vol. 28, pp , 983. [27] W. Leber and H. G. Schuser, Proper choce of he me delay for he analyss of chaoc me seres, Physcs Leer, vol. 42, pp. 07, December 989. [28] Z. Mchalewcz, Genec algorhms + daa srucures = Evolvng programs. Sprnger-Verlag, Berln Hedelberg, 996. [29] D. E. Goldberg, Genec algorhm n search, opmzaon and machne learnng. Addson Wesley, 989. [30] J. E. Baker, Reducng bas and neffcency n he selecon algorhm, n Proceedngs of In. Conf. Genec Algorhms, 987, pp [3] A. P. Engelbrech, Compuaonal nellgence: An nroducon. Jhon Wlley and Sons, Ld., [32] M. Shahdepour, H. Yamn, and Z. L., Marke operaons n elecrc power sysems. John Wley & Sons, Inc., 2000 [33] J. Zhu, Opmzaon of power sysem operaon. John Wley & Sons, Inc., [34] F. Benhamda, E.. Abdallah and A. H. Rashed, "Thermal un commmen soluon usng an mproved Lagrangan relaxaon", Inernaonal Conference on Renewable Energes and Power Qualy (ICREPQ), Sevlla, Span, [35] K. Y. Chen and C. H. Wang, Suppor vecor regresson wh genec algorhms n forecasng oursm demand, Toursm Managemen, vol. 28, pp , [36] V. Cherkassky and F. Muler, Learnng from daa: Conceps, heory and mehods. ew York: Wley, 998. [37] B. Scholkopf and A. J. Smola, Learnng wh kernels. Cambrdge: MIT press, [38] P. F. Pa and W. C. Hong, Forecasng regonal elecrc load based on recurren suppor vecor machnes wh genec algorhms, Elec. Power Sys. Research, vol. 74, no. 3, pp , hp://
9 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS TABLE 6 TEST SYSTEM DATA Un Un 2 Un 3 Un 4 Un 5 Un 6 Pmax (MW) Pmn (MW) a ($/h) b ($/MWh) c ($/MWh2) up T (h) down T (h) Sar up cos Inal sae TABLE 7 ACTUAL LOAD OF 6 UITS 24 HOUR TEST SYSTEM AD THE FORECASTED LOADS USIG LRBF, LSVR AD EOLSVR Loads (GW) Hour Acual LOCAL RBF LOCAL SVR EOLSVR TABLE 8 MAXIMUM POWER FLOW FOR EACH LIE I THE TEST SYSTEM (MW) L 650 L 325 L2 80 L3 80 L4 60 L2 650 L2 60 L22 80 L32 80 L3 325 L3 325 L23 80 L33 80 L4 650 L4 325 L24 80 L34 80 L5 650 L5 325 L25 80 L35 80 L6 325 L6 325 L26 60 L L7 450 L7 60 L27 60 L37 80 L8 350 L8 60 L28 60 L38 80 L9 650 L8 60 L29 60 L39 80 L0 60 L20 80 L30 80 L hp://
10 Inernaonal Journal of Scenfc & Engneerng Research, Volume 5, Issue 7, July ISS TABLE 9 FEASIBLE UIT COMBIATIO OF TEST SYSTEM FOR ACTUAL LOAD AD FORECASTIG LOAD VALUES USIG LOCAL RBF, LOCAL SVR AD EOLSVR Hour Feasble UC (Acual load) Feasble UC (Local RBF) Feasble UC (Local SVR) Feasble UC (EOLSVR) TC $ $ $ 68.5 $ hp://
An introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationShort-Term Load Forecasting Using PSO-Based Phase Space Neural Networks
Proceedngs of he 5h WSEAS In. Conf. on SIMULATION, MODELING AND OPTIMIZATION, Corfu, Greece, Augus 7-9, 005 (pp78-83) Shor-Term Load Forecasng Usng PSO-Based Phase Space Neural Neworks Jang Chuanwen, Fang
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
More informationISSN MIT Publications
MIT Inernaonal Journal of Elecrcal and Insrumenaon Engneerng Vol. 1, No. 2, Aug 2011, pp 93-98 93 ISSN 2230-7656 MIT Publcaons A New Approach for Solvng Economc Load Dspach Problem Ansh Ahmad Dep. of Elecrcal
More informationThe Analysis of the Thickness-predictive Model Based on the SVM Xiu-ming Zhao1,a,Yan Wang2,band Zhimin Bi3,c
h Naonal Conference on Elecrcal, Elecroncs and Compuer Engneerng (NCEECE The Analyss of he Thcknesspredcve Model Based on he SVM Xumng Zhao,a,Yan Wang,band Zhmn B,c School of Conrol Scence and Engneerng,
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationExistence and Uniqueness Results for Random Impulsive Integro-Differential Equation
Global Journal of Pure and Appled Mahemacs. ISSN 973-768 Volume 4, Number 6 (8), pp. 89-87 Research Inda Publcaons hp://www.rpublcaon.com Exsence and Unqueness Resuls for Random Impulsve Inegro-Dfferenal
More informationParameter Estimation of Three-Phase Induction Motor by Using Genetic Algorithm
360 Journal of Elecrcal Engneerng & Technology Vol. 4, o. 3, pp. 360~364, 009 Parameer Esmaon of Three-Phase Inducon Moor by Usng Genec Algorhm Seesa Jangj and Panhep Laohacha* Absrac Ths paper suggess
More informationMANY real-world applications (e.g. production
Barebones Parcle Swarm for Ineger Programmng Problems Mahamed G. H. Omran, Andres Engelbrech and Ayed Salman Absrac The performance of wo recen varans of Parcle Swarm Opmzaon (PSO) when appled o Ineger
More informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationGenetic Algorithm in Parameter Estimation of Nonlinear Dynamic Systems
Genec Algorhm n Parameer Esmaon of Nonlnear Dynamc Sysems E. Paeraks manos@egnaa.ee.auh.gr V. Perds perds@vergna.eng.auh.gr Ah. ehagas kehagas@egnaa.ee.auh.gr hp://skron.conrol.ee.auh.gr/kehagas/ndex.hm
More informationFall 2010 Graduate Course on Dynamic Learning
Fall 200 Graduae Course on Dynamc Learnng Chaper 4: Parcle Flers Sepember 27, 200 Byoung-Tak Zhang School of Compuer Scence and Engneerng & Cognve Scence and Bran Scence Programs Seoul aonal Unversy hp://b.snu.ac.kr/~bzhang/
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationRobust and Accurate Cancer Classification with Gene Expression Profiling
Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem
More informationOn computing differential transform of nonlinear non-autonomous functions and its applications
On compung dfferenal ransform of nonlnear non-auonomous funcons and s applcaons Essam. R. El-Zahar, and Abdelhalm Ebad Deparmen of Mahemacs, Faculy of Scences and Humanes, Prnce Saam Bn Abdulazz Unversy,
More informationApproximate Analytic Solution of (2+1) - Dimensional Zakharov-Kuznetsov(Zk) Equations Using Homotopy
Arcle Inernaonal Journal of Modern Mahemacal Scences, 4, (): - Inernaonal Journal of Modern Mahemacal Scences Journal homepage: www.modernscenfcpress.com/journals/jmms.aspx ISSN: 66-86X Florda, USA Approxmae
More informationMachine Learning Linear Regression
Machne Learnng Lnear Regresson Lesson 3 Lnear Regresson Bascs of Regresson Leas Squares esmaon Polynomal Regresson Bass funcons Regresson model Regularzed Regresson Sascal Regresson Mamum Lkelhood (ML)
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationA Profit-Based Unit Commitment using Different Hybrid Particle Swarm Optimization for Competitive Market
A.A. Abou El Ela, e al./ Inernaonal Energy Journal 9 (2008) 28-290 28 A rof-based Un Commmen usng Dfferen Hybrd arcle Swarm Opmzaon for Compeve Marke www.serd.a.ac.h/rerc A. A. Abou El Ela*, G.E. Al +
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5h Inernaonal onference on Advanced Desgn and Manufacurng Engneerng (IADME 5 The Falure Rae Expermenal Sudy of Specal N Machne Tool hunshan He, a, *, La Pan,b and Bng Hu 3,c,,3 ollege of Mechancal and
More informationForecasting Using First-Order Difference of Time Series and Bagging of Competitive Associative Nets
Forecasng Usng Frs-Order Dfference of Tme Seres and Baggng of Compeve Assocave Nes Shuch Kurog, Ryohe Koyama, Shnya Tanaka, and Toshhsa Sanuk Absrac Ths arcle descrbes our mehod used for he 2007 Forecasng
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationAdvanced time-series analysis (University of Lund, Economic History Department)
Advanced me-seres analss (Unvers of Lund, Economc Hsor Dearmen) 3 Jan-3 Februar and 6-3 March Lecure 4 Economerc echnues for saonar seres : Unvarae sochasc models wh Box- Jenns mehodolog, smle forecasng
More informationNeural Networks-Based Time Series Prediction Using Long and Short Term Dependence in the Learning Process
Neural Neworks-Based Tme Seres Predcon Usng Long and Shor Term Dependence n he Learnng Process J. Puchea, D. Paño and B. Kuchen, Absrac In hs work a feedforward neural neworksbased nonlnear auoregresson
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationReactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationThe Dynamic Programming Models for Inventory Control System with Time-varying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationForecasting customer behaviour in a multi-service financial organisation: a profitability perspective
Forecasng cusomer behavour n a mul-servce fnancal organsaon: a profably perspecve A. Audzeyeva, Unversy of Leeds & Naonal Ausrala Group Europe, UK B. Summers, Unversy of Leeds, UK K.R. Schenk-Hoppé, Unversy
More informationPerformance Analysis for a Network having Standby Redundant Unit with Waiting in Repair
TECHNI Inernaonal Journal of Compung Scence Communcaon Technologes VOL.5 NO. July 22 (ISSN 974-3375 erformance nalyss for a Nework havng Sby edundan Un wh ang n epar Jendra Sngh 2 abns orwal 2 Deparmen
More informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationA Novel Iron Loss Reduction Technique for Distribution Transformers. Based on a Combined Genetic Algorithm - Neural Network Approach
A Novel Iron Loss Reducon Technque for Dsrbuon Transformers Based on a Combned Genec Algorhm - Neural Nework Approach Palvos S. Georglaks Nkolaos D. Doulams Anasasos D. Doulams Nkos D. Hazargyrou and Sefanos
More informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationLi An-Ping. Beijing , P.R.China
A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.
More informationForecasting Time Series with Multiple Seasonal Cycles using Neural Networks with Local Learning
Forecasng Tme Seres wh Mulple Seasonal Cycles usng Neural Neworks wh Local Learnng Grzegorz Dudek Deparmen of Elecrcal Engneerng, Czesochowa Unversy of Technology, Al. Arm Krajowej 7, 42-200 Czesochowa,
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationIntroduction to Boosting
Inroducon o Boosng Cynha Rudn PACM, Prnceon Unversy Advsors Ingrd Daubeches and Rober Schapre Say you have a daabase of news arcles, +, +, -, -, +, +, -, -, +, +, -, -, +, +, -, + where arcles are labeled
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationPARTICLE SWARM OPTIMIZATION BASED ON BOTTLENECK MACHINE FOR JOBSHOP SCHEDULING
Proceedng 7 h Inernaonal Semnar on Indusral Engneerng and Managemen PARTICLE SWARM OPTIMIZATION BASED ON BOTTLENECK MACHINE FOR JOBSHOP SCHEDULING Rahm Mauldya Indusral Engneerng Deparmen, Indusral Engneerng
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationModeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts
nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationTime-interval analysis of β decay. V. Horvat and J. C. Hardy
Tme-nerval analyss of β decay V. Horva and J. C. Hardy Work on he even analyss of β decay [1] connued and resuled n he developmen of a novel mehod of bea-decay me-nerval analyss ha produces hghly accurae
More informationStudy on Distribution Network Reconfiguration with Various DGs
Inernaonal Conference on Maerals Engneerng and Informaon Technology Applcaons (MEITA 205) Sudy on Dsrbuon ework Reconfguraon wh Varous DGs Shengsuo u a, Y Dng b and Zhru Lang c School of Elecrcal Engneerng,
More informationFORECASTING NATURAL GAS CONSUMPTION USING PSO OPTIMIZED LEAST SQUARES SUPPORT VECTOR MACHINES
FORECASING NAURAL GAS CONSUMPION USING PSO OPIMIZED LEAS SQUARES SUPPOR VECOR MACHINES Hossen Iranmanesh 1, Majd Abdollahzade 2 and 3 Arash Mranan 1 Deparmen of Indusral Engneerng, Unversy of ehran & Insue
More informationEcon107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)
Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationSampling Procedure of the Sum of two Binary Markov Process Realizations
Samplng Procedure of he Sum of wo Bnary Markov Process Realzaons YURY GORITSKIY Dep. of Mahemacal Modelng of Moscow Power Insue (Techncal Unversy), Moscow, RUSSIA, E-mal: gorsky@yandex.ru VLADIMIR KAZAKOV
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationM. Y. Adamu Mathematical Sciences Programme, AbubakarTafawaBalewa University, Bauchi, Nigeria
IOSR Journal of Mahemacs (IOSR-JM e-issn: 78-578, p-issn: 9-765X. Volume 0, Issue 4 Ver. IV (Jul-Aug. 04, PP 40-44 Mulple SolonSoluons for a (+-dmensonalhroa-sasuma shallow waer wave equaon UsngPanlevé-Bӓclund
More informationIncluding the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.
Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationRefined Binary Particle Swarm Optimization and Application in Power System
Po-Hung Chen, Cheng-Chen Kuo, Fu-Hsen Chen, Cheng-Chuan Chen Refned Bnary Parcle Swarm Opmzaon and Applcaon n Power Sysem PO-HUNG CHEN, CHENG-CHIEN KUO, FU-HSIEN CHEN, CHENG-CHUAN CHEN* Deparmen of Elecrcal
More informationComparison of Supervised & Unsupervised Learning in βs Estimation between Stocks and the S&P500
Comparson of Supervsed & Unsupervsed Learnng n βs Esmaon beween Socks and he S&P500 J. We, Y. Hassd, J. Edery, A. Becker, Sanford Unversy T I. INTRODUCTION HE goal of our proec s o analyze he relaonshps
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More informationHighway Passenger Traffic Volume Prediction of Cubic Exponential Smoothing Model Based on Grey System Theory
Inernaonal Conference on on Sof Compung n Informaon Communcaon echnology (SCIC 04) Hghway Passenger raffc Volume Predcon of Cubc Exponenal Smoohng Model Based on Grey Sysem heory Wenwen Lu, Yong Qn, Honghu
More informationIntroduction. A Bayesian Network Approach to Forecasting
From: FLAIRS-00 Proceedngs. Copyrgh 000, AAAI (www.aaa.org). All rghs reserved. Inferencng Bayesan Neworks From Tme Seres Daa Usng Naural Selecon Andrew J. Novoblsk The Unversy of Texas a Arlngon P.O.
More informationA Dynamic Economic Dispatch Model Incorporating Wind Power Based on Chance Constrained Programming
Energes 25 8 233-256; do:.339/en8233 Arcle OPEN ACCESS energes ISSN 996-73 www.mdp.com/journal/energes A Dynamc Economc Dspach Model Incorporang Wnd Power Based on Chance Consraned Programmng Wushan Cheng
More informationPARTICLE SWARM OPTIMIZATION FOR INTERACTIVE FUZZY MULTIOBJECTIVE NONLINEAR PROGRAMMING. T. Matsui, M. Sakawa, K. Kato, T. Uno and K.
Scenae Mahemacae Japoncae Onlne, e-2008, 1 13 1 PARTICLE SWARM OPTIMIZATION FOR INTERACTIVE FUZZY MULTIOBJECTIVE NONLINEAR PROGRAMMING T. Masu, M. Sakawa, K. Kao, T. Uno and K. Tamada Receved February
More informationIntroduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms
Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationUsing Fuzzy Pattern Recognition to Detect Unknown Malicious Executables Code
Usng Fuzzy Paern Recognon o Deec Unknown Malcous Execuables Code Boyun Zhang,, Janpng Yn, and Jngbo Hao School of Compuer Scence, Naonal Unversy of Defense Technology, Changsha 40073, Chna hnxzby@yahoo.com.cn
More informationSolving the multi-period fixed cost transportation problem using LINGO solver
Inernaonal Journal of Pure and Appled Mahemacs Volume 119 No. 12 2018, 2151-2157 ISSN: 1314-3395 (on-lne verson) url: hp://www.pam.eu Specal Issue pam.eu Solvng he mul-perod fxed cos ransporaon problem
More informationAPOC #232 Capacity Planning for Fault-Tolerant All-Optical Network
APOC #232 Capacy Plannng for Faul-Toleran All-Opcal Nework Mchael Kwok-Shng Ho and Kwok-wa Cheung Deparmen of Informaon ngneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong SAR, Chna -mal: kwcheung@e.cuhk.edu.hk
More informationABSTRACT. KEYWORDS Hybrid, Genetic Algorithm, Shipping, Dispatching, Vehicle, Time Windows INTRODUCTION
A HYBRID GENETIC ALGORITH FOR A DYNAIC INBOUND ORDERING AND SHIPPING AND OUTBOUND DISPATCHING PROBLE WITH HETEROGENEOUS VEHICLE TYPES AND DELIVERY TIE WINDOWS by Byung Soo Km, Woon-Seek Lee, and Young-Seok
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle
More informationSOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β
SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose
More informationMeta-Heuristic Optimization techniques in power systems
Proceedngs of he 2nd IASME / WSEAS Inernaonal Conference on Energy & Envronmen (EE07), Pororoz, Slovena, May 15-17, 2007 163 Mea-Heursc Opmzaon echnques n power sysems Vlachos Arsds Deparmen of Informacs
More informationAttribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method GAO Jing1,a, Ma Hui1, Han Zhidong2,b
Inernaonal Indusral Informacs and Compuer Engneerng Conference (IIICEC 05) Arbue educon Algorhm Based on Dscernbly Marx wh Algebrac Mehod GAO Jng,a, Ma Hu, Han Zhdong,b Informaon School, Capal Unversy
More informationGeneration Scheduling in Large-Scale Power Systems with Wind Farms Using MICA
Journal of Arfcal Inellgence n Elecrcal Engneerng, Vol. 4, No. 16, March 2016 Generaon Schedulng n Large-Scale Power Sysems wh Wnd Farms Usng MICA Hossen Nasragdam 1, Narman Najafan 2 1 Deparmen of Elecrcal
More informationSupervised Learning in Multilayer Networks
Copyrgh Cambrdge Unversy Press 23. On-screen vewng permed. Prnng no permed. hp://www.cambrdge.org/521642981 You can buy hs book for 3 pounds or $5. See hp://www.nference.phy.cam.ac.uk/mackay/la/ for lnks.
More informationNATIONAL UNIVERSITY OF SINGAPORE PC5202 ADVANCED STATISTICAL MECHANICS. (Semester II: AY ) Time Allowed: 2 Hours
NATONAL UNVERSTY OF SNGAPORE PC5 ADVANCED STATSTCAL MECHANCS (Semeser : AY 1-13) Tme Allowed: Hours NSTRUCTONS TO CANDDATES 1. Ths examnaon paper conans 5 quesons and comprses 4 prned pages.. Answer all
More informationRADIAL BASIS FUNCTION PROCESS NEURAL NETWORK TRAINING BASED ON GENERALIZED FRÉCHET DISTANCE AND GA-SA HYBRID STRATEGY
Compuer Scence & Engneerng: An Inernaonal Journal (CSEIJ), Vol. 3, No. 6, December 03 RADIAL BASIS FUNCTION PROCESS NEURAL NETWORK TRAINING BASED ON GENERALIZED FRÉCHET DISTANCE AND GA-SA HYBRID STRATEGY
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More information