Conductor selection optimization in radial distribution system considering load growth using MDE algorithm

Size: px
Start display at page:

Download "Conductor selection optimization in radial distribution system considering load growth using MDE algorithm"

Transcription

1 ISSN , England, UK World Journal of Modellng and Smulaton Vol. 10 (2014) No. 3, pp Conductor selecton optmzaton n radal dstrbuton system consderng load growth usng MDE algorthm Belal Mohamad Kalesar Ardabl Provnce Electrc Power Dstrbuton Company, Iran (Receved October , Accepted May ) Abstract. Ths paper presents optmal conductor selecton of MV feeders n radal dstrbuton system (RDS) plannng to reduce power loss and mprove voltage profle usng Modfed Dfferental Evoluton (MDE) algorthm. To analyss the steady state of network n each step of optmzaton, a drect approach load flow whch s both robust and effcent and has hgh convergence speed s used. In ths paper, conductor selecton wll be performed consderng the captal nvestment, power loss, and energy loss factors so that, constrants lke maxmum current capacty of feeders and allowed voltage drop of nodes are satsfed. Also, the effect of load growth on the conductor selecton and the cost of energy losses s consdered. The proposed method s mplemented on 32 bus network and the results are compared wth other refernce. Keywords: optmal conductor selecton, modfed dfferental evoluton algorthm, power loss reducton and voltage profle mprovement 1 Introducton The optmum plannng of power dstrbuton networks s one of the most mportant research felds for electrcal engneers. That s because of the close proxmty of these networks to the ultmate consumers and of ther great length, whch has as a consequence ncreased captal nvestment and ncreased operatonal costs because of ther losses. The ultmate am of ths research s to plan dstrbuton networks whch satsfy the growng demand for electrcty, fulfll specfc techncal operatonal constrants and whch are also characterzed by the mnmum overall cost (nvestment and operatonal cost). Power losses n the lnes account for the bulk of the dstrbuton system losses. The captal nvestment n layng dstrbuton network lnes accounts for a consderable fracton of total captal nvestment. In general, n most of the exstng dstrbuton systems, the conductors are not selected n a systematc way. Thus, the captal cost of conductng materal and power loss n the feeders s more and also the maxmum current carryng capacty and voltage lmts are not generally satsfed. Therefore, consderable attentons have been gven on optmal dstrbuton systems plannng over last few years. In recent researches, many approaches have been proposed to solve power dstrbuton system plannng problem. In [1, 18], feeder cross secton selecton problem has fulflled wth usng analytc methods consderng allowable voltage drop so that, economc costs arsng from nvestment cost, power and energy loss cost has mnmzed. In [19] an economcal current densty-based method and heurstc approach n combnaton for conductor sze selecton presented, but the soluton obtaned s sub-optmal. In [2, 4, 5, 11, 14] conductor selecton problem has solved wth heurstc optmzaton methods and the optmal conductor szes are determned by mnmzng the total cost consstng of cost of conductor and cost of losses and subject to the constrant on voltage drop at far end load ponts and maxmum current carryng capacty of the feeder. In [6], several fnancal and engneerng factors are consdered n the soluton, whch the ntent wll be the Correspondng author. E-mal address: belal.mohamad@gmal.com. Publshed by World Academc Press, World Academc Unon

2 176 B. Kalesar: Conductor selecton optmzaton n radal dstrbuton system most economcal when both captal and operatng costs are consdered. Ranjan et al. mnmze nvestment cost, power and energy loss costs and also mproves voltage profle wth replacng exstng conductors usng evolutonary programmng [10]. In addton to these, the effect of load growth on the conductor selecton s consdered n [15] wth fuzzy evolutonary programmng.mohammad et al. use genetc algorthm (GA), hybrd genetc and partcle swarm optmzaton (HGAPSO), dfferental evoluton (DE), PSO-DE, PSO and Imperalst Compettve (IC) algorthm to conductor selecton problem respectvely [3, 7 9, 12, 13]. Ths paper presents a method based on MDE algorthm for conductor selecton n power radal dstrbuton system plannng consderng effect of load growth. The selected conductors wth proposed method consder maxmum current carryng capacty of conductors as well as lmt of allowable voltage drop for nodes. Addtonally causes a compromse between nvestment costs (arsng from feeder to be bult, cost of mantenance and operaton), power and energy loss cost, then make maxmum savng. 2 Load flow analyss The load flow soluton provdes the steady state condton of a power system. Because of the spread range of R and X, and radalty of the power dstrbuton system, the load flow problem of the radal dstrbuton network s ncluded as an ll-condton problem. One of the major reasons, whch make the load flow program dverge, s the ll-condton problem of the Jacobn matrx or Y admttance matrx. In order to prevent ths problem, the proposed drect approach of [17] s used. In ths method, two matrces, whch are developed from the topologcal characterstcs of dstrbuton systems, are used to solve load flow problem. [B] = [BIBC][I], [ V ] = [BCBV ][B], (1) [ V ] = [BCBV ][BIBC][I] = [DLF ][I]. The BIBC matrx represents the relatonshp between bus current njectons and branch currents, and the BCBV matrx represents the relatonshp between branch currents and bus voltages Eq. (1). These two matrces are combned to form a drect approach for solvng load flow problems. ( ) I k P + jq =, V k [ V k+1 ] = [DLF ][I k ], (2) [V k+1 ] = [V 0 ] [ V k+1 ]. The soluton for dstrbuton load flow can be obtaned by solvng Eq. (2) teratvely. 3 Modfed dfferental evoluton algorthm Dfferental Evoluton Algorthm (DEA) s a smple populaton based, stochastc parallel search Evoluton algorthm for global optmzaton and s capable of handlng non-dfferentable, nonlnear and multmodal objectve functons. In DEA the populaton conssts of real-valued vectors wth dmenson D that equals the number of desgn parameters. The sze of the populaton s adjusted by the parameter N p. The ntal populaton s unformly dstrbuted n the search space. Modfcaton to DE algorthm s represented n [16]. 3.1 Intalzaton Typcally, each decson parameter n every vector of the ntal populaton s assgned a randomly chosen value from wthn ts correspondng feasble bounds: WJMS emal for contrbuton: submt@wjms.org.uk

3 World Journal of Modellng and Smulaton, Vol. 10 (2014) No. 3, pp X 0 j, = X mn j + µ j (X max j X mn j ), = 1,, N p, j = 1,, D, (3) where µ j denotes a unformly dstrbuted random number wthn the range [0, 1],generated anew for each value of j. Xj max j and Xj mn are the upper and lower bounds of the j th decson parameter, respectvely. 3.2 Mutaton The mutaton operator creates mutant vectors X by perturbng a randomly selected vector X a wth the dfference of two other randomly selected vectors X b and X c, accordng to the followng expresson: X (G) = X (G) a + F (X (G) b X (G) c ), = 1,, N p, (4) where a, b, and c are randomly chosen ndces, such that a, b, c {1,, N p } and a b c. It should be noted that new (random) values for a, b, and c have to be generated for each value of. The scalng factor F s an algorthm control parameter n the range [0, 2] whch s used to adjust the perturbaton sze n the mutaton operator and mprove algorthm convergence. Modfcaton to DE [16] : The frst modfcaton to DE s to replace the random base vector X n (G) a n the mutaton Eq. (5) wth the tournament best X (G) th. One hghly benefcal method that deserves specal menton s the DE/best/2/bn whch perturbs the best soluton found so far wth two dfference vectors based on a bnomal dstrbuton crossover scheme: X (G) = X (G) best + F (X(G) a X (G) b + X c (G) + X (G) d ), = 1,, N p, (5) where X a, X b, X c and X d are randomly chosen vectors from the set {1,, N p }, mutually dfferent and dfferent to the target vector. X a, X b, X c and X d are generated anew for each parent vector. X best s the best soluton found so far n the optmzaton process. Ths strategy dramatcally mproves the convergence rate of the algorthm. Also, nstead of usng a fxed F throughout a run of DE, we use a random F n for each mutated pont [16]. 3.3 Crossover In order to ncrease the dversty among the mutant parameter vectors, crossover s ntroduced. To ths end, a tral vector X s created from the components of each mutant vector X and ts correspondng target vector X, based on a seres of D-1 bnomal experments of the followng form: X (G) j, = { X (G) j,, f ρ j C R or j = p, X (G) j,, otherwse, = 1,, N P, j = 1,, D, (6) where ρ j denotes a unformly dstrbuted random number wthn the range [0, 1), generated anew for each value of j. The crossover constant C R whch s usually chosen from wthn the range [0, 1], s an algorthm parameter that controls the dversty of the populaton and ads the algorthm to escape from local mnma. q s a randomly chosen ndex {1,, D}, whch s used to ensure that the tral vector gets at least one parameter from the mutant vector. 3.4 Selecton The selecton operator forms the populaton by choosng between the tral vectors and ther predecessors (target vectors) those ndvduals that present a better ftness or are more optmal accordng to Eq. (7). X (G+1) = { X (G), f f(x (G) ) f(x (G) ), X (G), otherwse, = 1,, N p. (7) WJMS emal for subscrpton: nfo@wjms.org.uk

4 178 B. Kalesar: Conductor selecton optmzaton n radal dstrbuton system 3.5 Other modfcaton to DE: mgraton f necessary In order to effectvely enhance the nvestgaton to the search spaces and reduce the choce pressure to a small populaton, a mgraton operaton s ntroduced to regenerate a new dverse populaton of ndvduals. The new populatons are yelded based on the best ndvdual X G+1 h. The h th gene of the th ndvdual s as follows: ( ) round X (G+1) X (G+1) h + ρ 1 (X h mn X (G+1) hb ), f ρ 2 < X(G+1) h X h mn X h max X h mn, h = ( ) (8) round X (G+1) h + ρ 2 (X h mn X (G+1) hb ), otherwse, where ρ 1,ρ 2 are randomly generated numbers unformly dstrbuted n the range of [0, 1]; = l,, N p ; h = l,, n c. The mgraton n MDE s executed only f a measure fals to match the desred tolerance of populaton dversty. The measure s defned as follows: ρ = N p n c =1, b j=1 X j n c (N p 1) < ε 1, (9) where X 1, f G+1 X j = 0, otherwse. j X G+1 jb X G+1 jb > ε 2, (10) Parameter ε 1 [0, 1] and ε 2 [0, 1] respectvely express the desred tolerance for the populaton dversty and the gene dversty wth respect to the best ndvdual. Here X j s defned as an ndex of gene dversty. A value of zero of X j denotes that the j th gene of the th ndvdual s very close to the j th gene of the best ndvdual. From Eqs. (9) and (10), t can be seen that the value of ρ s n the range of [0, 1]. If ρ s smaller than ε 1, then the MDE performs the mgraton to generate a new populaton to escape the local pont; otherwse, the MDE breaks off the mgraton whch keeps an ordnary search drecton. 3.6 Termnaton crtera After the ftness has been calculated, t has to be determned f the termnaton crteron has been met. Ths can be done n several ways. The algorthm used here stops when a fnte generaton number has been reached and the best ft among the populaton s declared the wnner and soluton to the problem. 4 Problem formulaton The problem s to select conductor cross-secton from a set of nventory avalable such that the total cost consstng of the cost of the conductor and the cost of losses s mnmzed whle satsfyng the constrants on voltage drop at far end nodes and maxmum current carryng capacty of conductor. The problem may be stated as a mnmzaton of an objectve functon representng the fxed costs correspondent to the nvestment n lnes and the varable costs assocated to the operaton of the system, subject to voltage and current constrants, expressed by the followng equaton: J = mn(f 1 + F 2), n 1 F 1 = [α A (k) cost (k) Len () ], (11) k=1 n 1 F 2 = P loss (,k) (K P + K E 8760 LSF ). =1 WJMS emal for contrbuton: submt@wjms.org.uk

5 World Journal of Modellng and Smulaton, Vol. 10 (2014) No. 3, pp J = the cost functon to be mnmzed and conssts of: fxed cost (F 1 ) whch caused by nstallaton and mantenance cost of feeders and varable cost (F 2) assocated wth power and energy loss cost; P loss(j, k) : real power loss of branch wth k type of conductor n kw ; K P : Annual demand cost of power loss n Rs/kW ; K E : Annual demand cost of energy loss n Rs/kW h; Lsf : loss factor; α : nterest and deprecaton factor; A (k) : cross sectonal area of k type of conductor n mm 2 ; Cost k : cost of k type conductor n Rs/mm 2 /km; Len : length of branch n km. The power losses n the grd are calculated from load-flow results for the maxmum load condton. Then, the energy losses for the perod of one year are calculated multplyng the power losses for the maxmum load condton by the loss factor and by the number of hours n one year (8760 hr). The assocated cost of the energy losses s calculated accordng to the costs of the energy n ($/kw /year). 4.1 Constrants The optmzaton problem of conductor sze selecton n plannng radal dstrbuton systems s to select the conductor szes wth the mnmal total cost under the constrants of: Voltage: The voltage ampltude at every node n the feeder must be hgher than mnmum acceptable value of voltage (V mn ), means: V > V mn for = 2, 3,, n. (12) Current: Current flowng through secton j wth a gven type of conductor (K) should be less than the maxmum allowable current carryng capacty of K conductor (I max(k) ),.e. I jj,k < I max(k) for jj = 1, 2,, m. (13) For the sake of smplcty, the followng condtons apply n ths paper: 1- only a peak load for a plannng perod of one year s consdered. And 2- the feeder confguraton s known. In each generaton ftness value of J accordng to [10] wll be calculated that must be mnmzed n the optmzaton process. To succeed ths am the constrants lke maxmum allowable voltage drop and maxmum allowable current carryng capacty must be satsfed. The conductor selecton problem n under study radal dstrbuton system wll be solved wth MDE operator s mplementaton and consderng termnaton crteron of problem. 5 Test results The proposed method s mplemented on 32- bus radal dstrbuton system as Fg. 1. The lne and load data, also four dfferent types of conductors that are used for optmzaton s gven n [15]. The basc data are consdered for the cases as: K E = 0.5Rs/kW h; LSF = 0.2; K P = 2500Rs/kW ; Cost k = 500Rs/mm 2 /km; α = 0.1; T = 8760hour; A radal dstrbuton system has several branches. When these branches are re-conductored, t changes the resultng power losses and voltage profle. The re-conductored branches requre captal nvestment. The proposed algorthm to select the best conductor type for each branch of RDS, such that the resultng RDS requres the least re-conductorng costs, yelds the mnmum power losses and gves best voltage profle. 5.1 Wthout load growth In base case, all lnes conductor type are Weasel and mnmum voltage and total real power loss are p.u. and 25.4 kw respectvely. WJMS emal for subscrpton: nfo@wjms.org.uk

6 180 B. Kalesar: Conductor selecton optmzaton n radal dstrbuton system Fg. 1. Sngle lne dagram of 32- bus RDS [12] Table 1. Comparson of results before and after conductor gradng Mnmum Power loss Real power loss (kw ) Total cost (Rs) voltage (p.u.) reducton (kw ) Net savng (Rs) Base case Ref. [15] MDE The comparson of results for base case and after conductor gradng are shown n Tab. 1. Based on algorthm, the results of conductor type selecton are presented n Tab. 2. From Tab. 1, t can be seen that real power loss reduced to kw, mnmum voltage mproved to p.u. and cost functon reduced from (R s ) to (R s ) t means net savng of cost functon n comparson wth [15] has ncreased from (R s ) to (R s ). Fg. 2 represents the voltage profle before and after conductor optmzaton. 5.2 Wth future load growth Load growth n future can be modeled as follows: P L = P L0 (1 + g) n, (14) Q L = Q L0 (1 + g) n, where P L,Q L : Real and reactve load for n years; P L0,Q L0 : Real and reactve load at base condton; n : number of years; g : growth rate at 7%. The results after modfcaton of the conductors for n = 8 th and n = 9 th year are shown n Tabs. 3and 4. From Tabs. 3 and 4, t can be seen that n case of MDE algorthm results re-conductorng sn t necessary for the branches from 8 th year to 9 th year, but n results of [15] some modfcaton s necessary n the selecton of conductors. Ths result s an mportant advantage that there s no need to change conductors cross secton from a year to next year. The results of modfcaton n branch conductors for future load expanson for 32- bus network s shown n Tab. 5. It s observed that, the optmal conductor selecton s obtaned by the MDE algorthm s suffcent WJMS emal for contrbuton: submt@wjms.org.uk

7 World Journal of Modellng and Smulaton, Vol. 10 (2014) No. 3, pp Table 2. Results of MDE for conductor type wthout load growth Conductor type Conductor type usng MDE usng MDE Fg. 2. voltage profle before and after conductor optmzaton wthout load growth case to mantan voltage profle and reducton n power loss up to 8 years. From 9 th year the obtaned optmal selecton s not sutable to obtan maxmum net savngs, so, t s need to change some of the conductors by other type of conductors correspondng to Tabs. 3 and 4. It s observed from Tab. 5, the power loss s reduced from 76.5 kw to kw and net savng s ncreased to (R S ) usng MDE algorthm nstead of R S for the 8th year n [15]. Smlarly for the 9th year the power loss s reduced from 87.8 kw to kw and net savng s ncreased to (R S ) WJMS emal for subscrpton: nfo@wjms.org.uk

8 182 B. Kalesar: Conductor selecton optmzaton n radal dstrbuton system Table 3. Results after modfcaton of the conductors for n = 8 th year Conductor Conductor type Conductor Conductor type type [15] usng MDE type [15] usng MDE Table 4. Results after modfcaton of the conductors for n = 9 th year Conductor Conductor type Conductor Conductor type type [15] usng MDE type [15] usng MDE n comparson wth (R S ) wthout changes n the selecton of conductors. Fg. 3 represents the voltage profle before and after conductor optmzaton. WJMS emal for contrbuton: submt@wjms.org.uk

9 World Journal of Modellng and Smulaton, Vol. 10 (2014) No. 3, pp Table 5. Comparson of results before and after conductor gradng Scenaro Mnmum Real power voltage (p.u.) loss (kw) Total cost (Rs) Base case N = 8 th year Ref. [15] MDE Base case N = 9 th year Ref. [15] MDE Fg. 3. voltage profle before and after conductor optmzaton wth load growth case 6 Concluson Ths study has presented a robust and comprehensve approach to solve the optmal conductor selecton problem n a RDS. The proposed algorthm can be used n conductor selecton for plannng and optmzaton of radal dstrbuton networks. The objectves consdered attempt to mnmze of captal nvestment and power and energy loss, subject to voltage drop and current carryng capacty constrants. As two case studes, proposed algorthm s appled to 32- bus RDS wth satsfactory and comparable results to other paper. References [1] N. Boulaxs, M. Papadopoulos. Optmal feeder routng n dstrbuton system plannng usng dynamc programmng technque and gs facltes. IEEE Transactons on Power Delvery, 2002, 17(1). [2] H. Falagh, M. Ramezan, et al. Optmal selecton of conductors n radal dstrbuton systems wth tme varyng load. 18th Internatonal Conference on Electrcty Dstrbuton, WJMS emal for subscrpton: nfo@wjms.org.uk

10 184 B. Kalesar: Conductor selecton optmzaton n radal dstrbuton system [3] D. Kaur. A hybrd approach for rural feeder desgn. Journal of Engneerng Scence and Technology, 2012, 7(4): [4] D. Kaur, J. Sharma. An mproved heurstc approach for conductor sze selecton n plannng of branched radal feeder dstrbuton systems. Proceedngs of the 6th WSEAS Internatonal Conference on Power Systems, [5] D. Kaur, J. Sharma. Optmal conductor szng n radal dstrbuton systems plannng. Electrcal Power and Energy Systems, 2008, [6] S. Mandal, A. Pahwa. Optmal selecton of conductors for dstrbuton feeders. IEEE Transactons on Power Systems, 2002, 17(1). [7] B. Mohammad, A. Sef. Optmal conductor selecton n radal power dstrbuton system plannng usng genetc algorthm. Elxr Electronc Engneerng, 2011, [8] L. Mohammadan, S. Khan, et al. Usng a hybrd evolutonary method for optmal plannng, and reducng loss of dstrbuton networks. Internatonal Research Journal of Appled and Basc Scences, 2012, 3: [9] M. Mozaffar, R. Abdollahzadeh, et al. Conductor sze selecton n plannng of radal dstrbuton systems for productvty mprovement usng mperalst compettve algorthm. IJTPE Journal, 2013, 5(2): [10] R. Ranjan, A. Chaturved, et al. Optmal conductor selecton of radal dstrbuton feeders usng evolutonary programmng. IEEE Conference on Convergent Technologes for the Asa-Pacfc Regon, 2003, 1. [11] R. Ranjan, B. Venkatesh, et al. A new algorthm for power dstrbuton system plannng. Electrc Power Systems Research, [12] R. Rao. Optmal conductor selecton for loss reducton n radal dstrbuton systems usng dfferental evoluton. Internatonal Journal of Engneerng Scence and Technology, 2010, 2(7): [13] M. Sharaf, H. Samet, et al. Optmal conductor selecton of radal dstrbuton networks usng pso method. CIRED RegonalC Iran, [14] S. Svanagaraju, N. Sreenvasulu, et al. Optmal conductor selecton for radal dstrbuton systems. Electrc Power Systems Research, [15] M. Sreedhar, N. Vsal, et al. A novel method for optomal conductor selecton of radal dstrbuton feeders usng fuzzy evolutonary programmng. Internatonal Journal of Electrcal and Power Engneerng, 2008, 2(1): [16] S.Sayah, K.Zehar. Modfed dfferental evoluton algorthm for optmal power flow wth non-smooth cost functons. Energy Converson and Management, 2008, [17] J.-H. Teng. A drect approach for dstrbuton system load flow solutons. IEEE Transactons Power Delvery, 2003, 18(3). [18] H. Tram, D. Wall. Optmal conductor selecton n plannng radal dstrbuton systems. IEEE Transactons on Power Systems, 1998, 3(1). [19] Z. Wang, H. Lu, et al. A practcal approach to the conductor sze selecton n plannng radal dstrbuton systems. IEEE Transactons on Power Delvery, 2000, 15(1). WJMS emal for contrbuton: submt@wjms.org.uk

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

Differential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow

Differential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow 1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

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

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

More information

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

Economic dispatch solution using efficient heuristic search approach

Economic dispatch solution using efficient heuristic search approach Leonardo Journal of Scences Economc dspatch soluton usng effcent heurstc search approach Samr SAYAH QUERE Laboratory, Faculty of Technology, Electrcal Engneerng Department, Ferhat Abbas Unversty, Setf

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Capacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search

Capacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

Solving Nonlinear Differential Equations by a Neural Network Method

Solving Nonlinear Differential Equations by a Neural Network Method Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,

More information

Entropy Generation Minimization of Pin Fin Heat Sinks by Means of Metaheuristic Methods

Entropy Generation Minimization of Pin Fin Heat Sinks by Means of Metaheuristic Methods Indan Journal of Scence and Technology Entropy Generaton Mnmzaton of Pn Fn Heat Snks by Means of Metaheurstc Methods Amr Jafary Moghaddam * and Syfollah Saedodn Department of Mechancal Engneerng, Semnan

More information

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD 90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

Optimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search

Optimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular

More information

Optimal choice and allocation of distributed generations using evolutionary programming

Optimal choice and allocation of distributed generations using evolutionary programming Oct.26-28, 2011, Thaland PL-20 CIGRE-AORC 2011 www.cgre-aorc.com Optmal choce and allocaton of dstrbuted generatons usng evolutonary programmng Rungmanee Jomthong, Peerapol Jrapong and Suppakarn Chansareewttaya

More information

Appendix B: Resampling Algorithms

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

More information

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

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

Energy Conversion and Management

Energy Conversion and Management Energy Converson and Management 49 (2008) 3036 3042 Contents lsts avalable at ScenceDrect Energy Converson and Management ournal homepage: www.elsever.com/locate/enconman Modfed dfferental evoluton algorthm

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM

A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM IJCMA: Vol. 6, No. 1, January-June 2012, pp. 1-19 Global Research Publcatons A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM S. Kavtha and Nrmala

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

A Genetic algorithm based optimization of DG/capacitors units considering power system indices

A Genetic algorithm based optimization of DG/capacitors units considering power system indices A Genetc algorthm based optmzaton of DG/capactors unts consderng power system ndces Hossen Afrakhte 1, Elahe Hassanzadeh 2 1 Assstant Prof. of Gulan Faculty of Engneerng, ho_afrakhte@gulan.ac.r 2 Elahehassanzadeh@yahoo.com

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

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

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

En Route Traffic Optimization to Reduce Environmental Impact

En Route Traffic Optimization to Reduce Environmental Impact En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton

More information

VQ widely used in coding speech, image, and video

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

More information

A Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems

A Novel Evolutionary Algorithm for Capacitor Placement in Distribution Systems DOI.703/s40707-013-0003-x STF Journal of Engneerng Technology (JET), Vol. No. 3, Dec 013 A Novel Evolutonary Algorthm for Capactor Placement n Dstrbuton Systems J-Pyng Chou and Chung-Fu Chang Abstract

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

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

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

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

A Hybrid Differential Evolution Algorithm Game Theory for the Berth Allocation Problem

A Hybrid Differential Evolution Algorithm Game Theory for the Berth Allocation Problem A Hybrd Dfferental Evoluton Algorthm ame Theory for the Berth Allocaton Problem Nasser R. Sabar, Sang Yew Chong, and raham Kendall The Unversty of Nottngham Malaysa Campus, Jalan Broga, 43500 Semenyh,

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles

Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles 1 Internatonal Congress on Informatcs, Envronment, Energy and Applcatons-IEEA 1 IPCSIT vol.38 (1) (1) IACSIT Press, Sngapore Partcle Swarm Optmzaton wth Adaptve Mutaton n Local Best of Partcles Nanda ulal

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

Optimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement using CABC

Optimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement using CABC Internatonal Journal on Electrcal Engneerng and Informatcs - Volume 7, Number 4, Desember 2015 Optmal Placement and Szng of s n the Dstrbuton System for Loss Mnmzaton and Voltage Stablty Improvement usng

More information

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

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

Heuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems

Heuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems Internatonal Journal of Innovatve Research n Advanced Engneerng (IJIRAE) ISSN: 349-63 Volume Issue 6 (July 04) http://rae.com Heurstc Algorm for Fndng Senstvty Analyss n Interval Sold Transportaton Problems

More information

Numerical Heat and Mass Transfer

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

More information

A New Evolutionary Computation Based Approach for Learning Bayesian Network

A New Evolutionary Computation Based Approach for Learning Bayesian Network Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang

More information

Electrical double layer: revisit based on boundary conditions

Electrical double layer: revisit based on boundary conditions Electrcal double layer: revst based on boundary condtons Jong U. Km Department of Electrcal and Computer Engneerng, Texas A&M Unversty College Staton, TX 77843-318, USA Abstract The electrcal double layer

More information

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization

Transient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization Transent Stablty Constraned Optmal Power Flow Usng Improved Partcle Swarm Optmzaton Tung The Tran and Deu Ngoc Vo Abstract Ths paper proposes an mproved partcle swarm optmzaton method for transent stablty

More information

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department

More information

High resolution entropy stable scheme for shallow water equations

High resolution entropy stable scheme for shallow water equations Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

GEOSYNTHETICS ENGINEERING: IN THEORY AND PRACTICE

GEOSYNTHETICS ENGINEERING: IN THEORY AND PRACTICE GEOSYNTHETICS ENGINEERING: IN THEORY AND PRACTICE Prof. J. N. Mandal Department of cvl engneerng, IIT Bombay, Powa, Mumba 400076, Inda. Tel.022-25767328 emal: cejnm@cvl.tb.ac.n Module - 9 LECTURE - 48

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

Using Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*

Using Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,* Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton

More information

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY

CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 26 CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 2.1 INTRODUCTION Voltage stablty enhancement s an mportant tas n power system operaton.

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY (IJEET)

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY (IJEET) INTERNTINL JURNL F ELECTRICL ENINEERIN & TECHNLY (IJEET) Internatonal Journal of Electrcal Engneerng and Technology (IJEET), ISSN 0976 6545(rnt), ISSN 0976 6553(nlne) Volume 5, Issue 2, February (204),

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Operating conditions of a mine fan under conditions of variable resistance

Operating conditions of a mine fan under conditions of variable resistance Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety

More information

Research on Route guidance of logistic scheduling problem under fuzzy time window

Research on Route guidance of logistic scheduling problem under fuzzy time window Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

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

Solving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test

More information

VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS

VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS VOLTAGE SENSITIVITY BASED TECHNIQUE FOR OPTIMAL PLACEMENT OF SWITCHED CAPACITORS M. Rodríguez Montañés J. Rquelme Santos E. Romero Ramos Isotrol Unversty of Sevlla Unversty of Sevlla Sevlla, Span Sevlla,

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Multi-Objective Fuzzy Model in Optimal Siting and Sizing of DG for Loss Reduction

Multi-Objective Fuzzy Model in Optimal Siting and Sizing of DG for Loss Reduction World Academy of Scence, Enneerng and Technology Internatonal Journal of Electrcal and Computer Enneerng Mult-Objectve Fuzzy Model n Optmal Stng and Szng of DG for Loss Reducton H. Shayegh, B. Mohamad

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

ELE B7 Power Systems Engineering. Power Flow- Introduction

ELE B7 Power Systems Engineering. Power Flow- Introduction ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,

More information

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &

More information

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH

SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

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

HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Internatonal Journal of Fuzzy Logc Systems (IJFLS) Vol.2, No., February 22 HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Amt Saraswat and Ashsh San 2 Department

More information

Evolutionary Algorithm in Identification of Stochastic Parameters of Laminates

Evolutionary Algorithm in Identification of Stochastic Parameters of Laminates Evolutonary Algorthm n Identfcaton of Stochastc Parameters of Lamnates Potr Orantek 1, Wtold Beluch 1 and Tadeusz Burczyńsk 1,2 1 Department for Strength of Materals and Computatonal Mechancs, Slesan Unversty

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

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

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

More information

SIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM

SIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM SIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM Mr.M.Svasubramanan 1 Mr.P.Musthafa Mr.K Sudheer 3 Assstant Professor / EEE Assstant Professor / EEE Assstant Professor

More information

Constitutive Modelling of Superplastic AA-5083

Constitutive Modelling of Superplastic AA-5083 TECHNISCHE MECHANIK, 3, -5, (01, 1-6 submtted: September 19, 011 Consttutve Modellng of Superplastc AA-5083 G. Gulano In ths study a fast procedure for determnng the constants of superplastc 5083 Al alloy

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

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

Evolutionary Multi-Objective Environmental/Economic Dispatch: Stochastic vs. Deterministic Approaches Evolutonary Mult-Objectve Envronmental/Economc Dspatch: Stochastc vs. Determnstc Approaches Robert T. F. Ah Kng, Harry C. S. Rughooputh and Kalyanmoy Deb 2 Department of Electrcal and Electronc Engneerng,

More information

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for

More information

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,

A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) , A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites IOP Conference Seres: Materals Scence and Engneerng PAPER OPE ACCESS An dentfcaton algorthm of model knetc parameters of the nterfacal layer growth n fber compostes o cte ths artcle: V Zubov et al 216

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

Optimal Multi-Objective Planning of Distribution System with Distributed Generation

Optimal Multi-Objective Planning of Distribution System with Distributed Generation Optmal Mult-Objectve Plannng of Dstrbuton System wth Dstrbuted Generaton M. A. Golar 1 S. Hossenzadeh A. Hajzadeh 3 1 Assocated Professor, Electrcal Engneerng Department, K.N.Toos Unversty of Technology,

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng

More information

Extended Model of Induction Machine as Generator for Application in Optimal Induction Generator Integration in Distribution Networks

Extended Model of Induction Machine as Generator for Application in Optimal Induction Generator Integration in Distribution Networks Internatonal Journal of Innovatve Research n Educaton, Technology & Socal Strateges IJIRETSS ISSN Prnt: 2465-7298 ISSN Onlne: 2467-8163 Volume 5, Number 1, March 2018 Extended Model of Inducton Machne

More information

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3,

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, roceedngs of the 0th WSEAS Internatonal Confenrence on ALIED MATHEMATICS, Dallas, Texas, USA, November -3, 2006 365 Impact of Statc Load Modelng on Industral Load Nodal rces G. REZA YOUSEFI M. MOHSEN EDRAM

More information