Decision Science Letters
|
|
- Nora Chapman
- 5 years ago
- Views:
Transcription
1 Decson Scence Letters (5) 89 Contents lsts avalable at GrowngScence Decson Scence Letters homepage: Mult-objectve avalablty-redundancy allocaton problem for a system wth reparable and non-reparable components Hossen Zoulfaghar a*, Al Zenal Hamadan a and Mostafa Aboue Ardakan b a Department of Industral and Systems Engneerng, Isfahan Unversty of Technology, Isfahan, Iran b Department of Industral Engneerng, Daneshpajoohan Hgher Educaton Insttute, Isfahan, Iran C H R O N I C L E A B S T R A C T Artcle hstory: Receved October 9, Receved n revsed format: March, 5 Accepted Aprl, 5 Avalable onlne Aprl 5 5 Keywords: System avalablty and relablty Mult-objectve optmzaton Redundancy allocaton Reparable and non-reparable components Genetc algorthm Relablty s one of the most mportant characterstcs of the electrcal and mechancal systems wth applcatons n the space communcaton ndustres, nternet networks, telecommuncaton systems, power generaton systems, and productve facltes. What adds to the mportance of relablty n these systems are system complcatons, nature of compettve markets, and ncreasng producton costs due to falures. Ths paper nvestgates avalablty optmzaton of a system usng both reparable and non-reparable components, smultaneously. The avalablty-redundancy allocaton problems nvolve the determnaton of component avalablty (.e., lfe tme and repar tme of the components) and the redundancy levels that produce maxmum system avalablty. These problems are often subject to some constrants on ther components such as cost, weght, and volume. To maxmze the avalablty and to mnmze the total cost of the system, a new Mxed Integer Nonlnear Programmng (MINLP) model s presented. To solve the proposed model, an mproved verson of the genetc algorthm s desgned as an effcent meta-heurstc algorthm. Fnally, n order to verfy the effcency of the proposed algorthm, a numercal example of a system s presented that conssts of both reparable and non-reparable components. 5 Growng Scence Ltd. All rghts reserved.. Introducton Relablty optmzaton s an mportant topc that has attracted the attenton of many researchers. In relablty optmzaton, the am s to desgn a system structure that acheves a hgher level of relablty at mnmum budget and recourses. In order to mprove the relablty of a specfc system, one of the followng approaches may be adopted: a) ncreasng the relablty of each component n the system, b) usng the redundant components n parallel, c) combnng (a) and (b) above, and d) reassgnment of nterchangeable components (Kuo & Prasad, ). * Correspondng author. Tel:(+98)9558 E-mal address: hamadan@cc.ut.ac.r (H. Zoulfaghar) 5 Growng Scence Ltd. All rghts reserved. do:.567/j.dsl.5..7
2 9 Many dfferent types of the relablty optmzaton problems have been encountered and nvestgated. However, the two common types nclude the Redundancy Allocaton Problem (RAP) and the Relablty-Redundancy Allocaton Problem (RRAP) (Kuo & Prasad, ). In RAP, there are dscrete component choces wth predefned characterstcs such as relablty, cost and weght, where the goal s to fnd the optmal number of redundances n each subsystem n order to maxmze system relablty consderng some system constrants. The Relablty-Redundancy Allocaton Problem (RRAP) s formulated as a mxed-nteger non-lnear programmng problem. It s a more complcated verson compared wth the RAP snce the relablty and, therefore, other related specfcatons of the components are not predetermned and consdered as decson varables. The purpose of RRAP s to maxmze system relablty by selectng component relablty and component redundancy levels, whch forms a dffcult but realstc optmzaton problem. Component specfcatons such as cost, weght, and volume are defned as ncreasng non-lnear functons of component relablty (Cot, ). Because of the complex nature of ths problem, most classcal mathematcal methods have faled to yeld optmal or near optmal solutons for ths problem (Coelho, 9). All prevous studes of RRAP consdered the system as a non-reparable one. In ths paper, we consdered, for the frst tme, RRAP when the system conssts of both reparable and non-reparable components. Therefore, the problem may be renamed as the Avalablty-Redundancy Allocaton Problem (ARAP). Generally, the relablty of a system (or a component) s the probablty that t wll adequately perform ts specfed purpose for a specfed perod of tme under specfed envronmental condtons (Barlow & Proschan, 98) and avalablty s defned as the probablty that a system s n ts ntended functonal condton and, therefore, capable of beng used n a stated envronment (Hamadan, 98). The man dfference between these two concepts s that avalablty s used for reparable components whle relablty s a functonal ndex for the non-reparable ones. Furthermore, the term relablty can be used for the frst falure of a reparable component whle the term avalablty s used for the entre lfe of reparable components. A system usually conssts of a number of subsystems n whch each subsystem uses several components n parallel. These components are placed n each subsystem accordng to the system applcaton requrements; and each component has ts own predefned avalablty (relablty), weght, volume, and cost, whch should be consdered n desgnng the system and n determnng ts optmzaton condtons. Optmzaton of such a system can be turned nto a mult-objectve problem due to the presence of several and, sometmes, conflctng objectves such as maxmzng avalablty (or relablty), mnmzng system cost, weght, and volume. Snce RAP and RRAP belong to the NP-hard class of optmzaton problems (Chern, 99; Ha & Kuo, 6) they are generally too dffcult and tme-consumng to solve usng tradtonal optmzaton methods. More specfcally when the problem sze s large, most classcal mathematcal methods have faled to handle these optmzaton problems properly (Soltan, ). Dfferent methods have been developed for solvng the RAPs. Exact optmzaton methods lke dynamc programmng (Fyffe et al., 968; Ng & Sancho, ), nteger programmng (Msra & Sharma, 99), Lagrangean multplers (Msra, 97), and varous types of the meta-heurstc algorthms such as genetc algorthm (Hamadan & Khorshd, ; Ardakan & Hamadan, ; Ardakan et al., 5), ant-colony optmzaton (Cha & Smth, ), Immune algorthm (Chen & You, ), the surrogate constrant method (Onsh et al., 7), varable neghborhood search (VNS) algorthms (Lang & Chen, 7), Tabu search (TS) algorthm (Ouzneb et al., 8), and partcle swarm optmzaton (Bej et al., ; Wu et al., ; Garg, ) have been used for maxmzng system relablty. For solvng the RRAPs, numerous meta-heurstc algorthms such as genetc algorthm (Zoulfaghar et al., ; Ardakan & Hamadan, ), artfcal bee colony algorthm (Yeh & Hseh, ), Partcle
3 H. Zoulfaghar et al. / Decson Scence Letters (5) 9 Swarm Optmzaton (Coelho, 9), harmony search (Zou et al., ; Wang & L, ; Zou et al., ), cuckoo search algorthm (Valan, ; Valan et al., ), and mperalst compettve algorthm (Afonso et al., ) have been wdely employed over the past decade. As already mentoned, ths paper deals wth the RRAPs whose man dfference from smlar problems les n the assumpton that the system nvolves both reparable and non-reparable components; hence t must be consdered as ARAP. To solve ths problem, a new mxed nteger non-lnear programmng model s ntroduced and solved by an mproved verson of Genetc Algorthm (GA). To solve the proposed mathematcal model and to show the capablty of the proposed GA n handlng the problem, a modfed problem from the lterature s consdered and the GA results are compared wth those of the Improved Partcle Swarm Optmzaton (IPSO) algorthm (Wu et al., ) as one of the best algorthms reported n the lterature. In contrast to the studes conducted on relablty optmzaton, fewer studes have been devoted to the avalablty allocaton and optmzaton to nvestgate the optmal falure and repar rates of each component n a system amed at maxmzng (or mnmzng) the objectves. In most cases, the problem of avalablty allocaton and optmzaton can be defned as a mult-objectve optmzaton problem, whch ams to maxmze system avalablty and mnmze tts cost (Elegbede & Adjallah, ). Levtn and Lsnansk () ntroduced a model n whch the cost of desgnng the system s fxed and ts purpose s to optmze system avalablty. Also, Zo and Bazzo () presented an analyss on level dagrams of Pareto front for the redundancy allocaton problem. Ther ams were to maxmze system avalablty and mnmze the cost and weght of the whole system. Chang and Chen (7) proposed a new mult-objectve genetc algorthm, namely the smulated annealng based on a multobjectve genetc algorthm (MOGA), to resolve the avalablty allocaton and optmzaton problems of a reparable system. In the exstng lterature, a number of researchers have nvestgated the theoretcal problems of avalablty modelng (Srvasvata & Fahm, 988; Zhao, 99; Lee, ; Cao et al., ; Sercola, 999; Ma et al., ; Dewnter, ). The present artcle ams at both avalablty and relablty allocaton and avalablty optmzaton. The rest of the paper s organzed as follows. In Secton, the structure of the problem s presented and the proposed model s establshed. A descrpton of the proposed genetc algorthm s provded n Secton and a numercal example for the problem s gven Secton. Fnally, the paper concludes wth results, conclusons, and some suggestons for future study.. Problem defnton and the proposed model Seres-parallel systems are used here as a well-known system structure for descrbng the proposed model. The common structure of a seres-parallel system s llustrated n Fg..,, M, , j, j M, j, K, K M, K m Fg.. General structure of seres-parallel system.
4 9 Wthout loss of generalty, t s supposed that all the components n each subsystem are dentcal (the components have the same relablty and avalablty). In general, one has two objectves for these types of systems: maxmzng system avalablty and mnmzng system cost (Elegbede & Adjallah, ). As already mentoned n the prevous sectons, most studes on redundancy allocaton problems have consdered optmzaton of system relablty and t has been supposed that all the components are nonreparable, at the cost of neglectng the avalablty and mantanablty of components. Furthermore, n cases where system avalablty s consdered, t has been assumed that the system conssts of only reparable components. Ths s whle n real world condtons, there are a few systems that are desgned to use ether reparable or non-reparable components. In fact, most complcated systems consst of both reparable and non-reparable subsystems. Examples nclude systems composed of electronc and mechancal sectons such as automoble motor systems, and arplane systems, producton systems, where the electronc sectons consst of non-reparable components whle the mechancal sectons have reparable ones. Recently, Zoulfaghar et al. () presented a mathematcal model for such a system consstng of both reparable and non-reparable components. They developed the model for the case n whch the relablty or avalablty of the components are pre-determned. As an extenson to that study, a new model s developed n ths paper to consder the problem for the case n whch the relablty and avalablty of the components are not gven n advance but they are consdered as decson varables. Ths problem can be called the avalablty-redundancy allocaton problem. It s, therefore, assumed that some subsystems use non-reparable components whle others have reparable ones. In ths case, t wll not be possble to use the relablty formulaton for the objectve functon snce some of the components are reparable. It follows then that the modelng should be accomplshed n such a way that the objectve functon s consdered for maxmzng system avalablty. In the next subsectons, notatons and relatons used n the proposed mxed nteger non-lnear programmng model and the mathematcal representaton of the model are presented.. Notaton ( ) Asys t Avalablty of the system at tme t, C sys Cost of the system, R ( t) Relablty of the component used n the subsystem at tme t, A ( t) Avalablty of the component used n the subsystem at tme t, Av ( t) Avalablty of the subsystem at tme t, s Number of total subsystems, s Number of subsystems that nclude non-reparable components, A Set of subsystems ncludng reparable components, R Set of subsystems ncludng non-reparable components, n Number of components n subsystem, α, β Constants representng the physcal characterstc of each component n subsystem, T Operatng tme durng whch the component must not fal, a, b, q and p Real numbers used to calculate the cost of reparable component n subsystem, E( X), EY ( ) Average lfe tme and repar tme of reparable components,
5 H. Zoulfaghar et al. / Decson Scence Letters (5) 9 w, wv Real numbers used to calculate the weght and volume of components n subsystem, V Maxmum permtted volume of the system, W Maxmum permtted weght of the system, N Maxmum permtted number of components n subsystem, P Mnmum permtted number of components n subsystem L, U Lower and upper bounds of relablty n subsystem, R R L, U Lower and upper bounds of avalablty n subsystem. A A. The mathematcal model In ths secton, a b-objectve mathematcal model s developed and presented for the problem. The proposed model s as follows: n ( ( t ) ) f : Max Asys () t = Max Av () n n = Max ( ( R() t ) ) ( ( A( t) ) ) R A () β n p q T s f : Mn Csys = α n + e + n( a + b ) R ln R A E( X) E( Y) () n s wne W () s.t: ( A R) ( A R) wv n V p n N, ( A R) n Z +, ( A R) LR R U, R R L A U, A A A In ths model, Eq. () denotes the frst objectve functon for maxmzng system avalablty. The functon s a multplcaton of two parts: the frst maxmzes the relablty of non-reparable subsystems whle the second maxmzes the avalablty of the subsystems wth reparable components. Eq. () s the second objectve functon whch s related to the total cost of the system. Ths functon also conssts s of two parts: the frst one calculates the cost of reparable components. In ths part, e accounts for the nterconnectng hardware, α and β are the constants representng the physcal characterstc of each component n subsystem R, and T s the operatng tme durng whch the component must not fal (Dhngra, 99). The second part calculates the cost of reparable components, where a, b, and q are postve real numbers, whle p s negatve, ( A) (Chang & Chen,7). Eq. () shows the constrant on maxmum weght, whle Eq. () ndcates the constrant of maxmum volume for the system. Constrant (5) s related to the maxmum and mnmum numbers of permtted components n each subsystem and constrant (6) shows the condtons of the decson varables. Constrant (7) denotes the doman of relablty for non-reparable components and constrant (8) denotes the doman of n () (5) (6) (7) (8)
6 9 avalablty for reparable components. For the purposes of system avalablty analyss and calculaton, we assume that the lfe tme and repar tme are exponental dstrbutons. Therefore: n f : Max Asys ( t) = Max ( ( Av ( t)) ) f t( ) λt n λ µ + λ µ n = ( ( e ) ) ( ( e ) λ + µ λ + µ R A β n : T s ( p q MnC ( ) ( ) ) sys = α n + e + n a λ + b µ R λt A (9) () subject to n () s wne W ( A R) ( A R) wv n V p n N, ( A R), ( A R) λ U, ( A R) n Z + L L λ λ µ µ µ U, A Chern (99) proved that the redundancy allocaton problem n ts smplest form of seres system was an NP-hard problem. Therefore, the proposed model whch s more complcated than the model gven by Chern would also be NP-hard. In order to maxmze the objectve functon of ths model, t s reasonable to use a meta-heurstc method such as GA as used n ths paper.. The proposed genetc algorthm Genetc algorthm (GA) was frst proposed by Holland (975) and has been one of the most applcable meta-heurstc methods for solvng combnatoral optmzaton problems over the past three decades. Generally, GA s employed for solvng models wth one objectve functon. In ths paper, ths algorthm s used to solve the proposed b-objectve model. In the frst step, theε -constraned method s used to determne the optmzed value for the second objectve functon (cost). Ths value s then used n the problem constrants, and the sngle-objectve problem s solved by the genetc algorthm. Snce the value obtaned for the second objectve functon s the mnmum value of the system cost, by the optmal value for the frst objectve functon can also be obtaned by the gradual ncrease of ths value n the constrant. It s clear that whenever the cost ncreases, due to releases n the added constrant, avalablty of the problem should be better than before. Ths trend produces dfferent solutons for the problem for dfferent levels of costs and avalablty, whch makes the decson makers able to select approprate solutons by consderng dfferent crtera. Below s presented a complete descrpton of the proposed genetc algorthm.. Chromosome defnton For the proposed GA, each chromosome ncludes s genes where the frst row presents the number of components used n subsystems, the second row presents the lfe tmes of the components n each subsystem and the thrd row shows the repar tmes of the components n the reparable subsystems. These genes are randomly produced at gven ntervals. In other words, the value for each gene should () () () (5) (6)
7 H. Zoulfaghar et al. / Decson Scence Letters (5) 95 be verfed n constrants (), (5), and (6). Fg. represents the chromosome structure consdered for ths problem. Components level Lfe tme n n λ λ Non-Reparable n s λ s n s λ s n s + λ s + Repar Tme µ s + Reparable n s + λ s + µ s + ns n s λs λ s µ s µ s Fg.. Chromosome (soluton representaton). Ftness functon As mentoned above, to solve the proposed b-objectve model by GA, the second objectve s consdered as a constrant so that the model becomes a sngle-objectve one. Ftness functon (ff) s the value of the frst objectve functon (system avalablty) plus the penalty for constrant volaton. In other words, the problem constrants are added to the objectve functon n such a way that f one soluton goes beyond the constrants, a relatvely large amount of penalty s added to the objectve functon. Ths penalty keeps the feasblty of the fnal soluton whle t also provdes the search n the nfeasble space of the problem. The search n the nfeasble space leads to an approprate dversty for the genetc algorthm.. Intal populaton In order to produce an ntal populaton, Pop chromosomes are randomly generated. In ths paper, populaton sze (Pop) s equal to. Ths number of populaton has been used n prevous studes such as Safar () and Debb et al. (). Safar () states that n problems wth a bg soluton space, the number of prmary populaton should be more than.. Selecton In order to select the requred chromosomes n the crossover operaton, the followng steps need to be taken. The ftness functon (ff) s calculated for all the exstng chromosomes (Pop) n the present populaton. Then, from Pop present chromosomes, k chromosomes are randomly selected and sorted based on ff. The chromosome wth the largest ftness functons (avalablty-penaltes) s selected as the parent for generatng a new populaton. Ths process wll be repeated Pop tmes untl Pop parents are fnally selected for the crossover and mutaton operators..5 Crossover Crossover takes place at a certan rate. Usng the crossover operaton, sx offsprng are generated from each two parents. The two parents and the sx offsprng create eght chromosomes and the two premer chromosomes based on ff are selected to transfer to the next generaton. As a result, there wll be Pop populaton at the end of the crossover operatons. In order to produce these sx offsprng from the two selected parents, the followng steps are taken: Step : Two random numbers (, ) s selected from s + to s. m m are selected such that m s n the nterval ( to s ) and m
8 96 Step : The genes n the nterval ( to m ) for each parent are exchanged to produce two offsprng. Step : The genes n the nterval ( s + to m ) for each parent are exchanged to produce two other offsprng. Step : The genes n the nterval ( to m ) and those n the nterval ( s + to m ) for each parent are exchanged at the same tme to produce the last two offsprng. Ths knd of crossover leads to n the enhanced capablty of the algorthm for fndng better solutons. Here, an llustratve example s used to explan the crossover operaton. Suppose that for the case n Fg., there s a system wth 6 subsystems, of whch nclude non-reparable components and nclude ' reparable ones whle: m=, m = ; n 5 =,,...,6 ;. λ. =,,...,6 ;. µ.5 =,5, 6. Now, there are eght chromosomes and we should select two superor ones. For ths selecton, ff s calculated for all the eght chromosomes and they are compared wth each other. Fnally, two chromosomes wth the hghest value of ff are selected..6 Mutaton The mutaton operator s also used at a certan rate whch s less than that of the crossover operator. The man purpose of applyng the mutaton operator s to ncrease dversty and to avod trappng n the local optmzaton. In ths operator, one offsprng s randomly selected from among two chromosomes produced by the crossover operator. Non-reparable reparable Frst Parent Second Parent Frst Chld Second Chld Thrd Chld Fourth Chld Ffth Chld Sxth Chld Fg.. Crossover Operaton
9 H. Zoulfaghar et al. / Decson Scence Letters (5) 97 ' ' ' ' Two random numbers ( m, m ) are consdered such that m s selected from ( to s ) and m s selected from ( s + to s ) and the values of these two genes are exchanged. Then, ff s calculated for the muted offsprng and compared wth the value for ff of the pre-mutaton chromosome. If the value for ff of the new offsprng s greater than that of the prevous one, t wll then be replaced by the newly generated offsprng. Otherwse, the prevous offsprng remans as the superor ones. For example, suppose that n ' ' Fg., the offsprng has been selected for mutaton, m = and m = 5. Fg. represents the mutaton operator for these random values. Chld before mutaton Non-reparable reparable..7.. Chld after mutaton Fg.. Mutaton Operaton Stoppng crtera The GA process wll contnue untl a predefned number of teratons (Gen). In ths paper, the number of teratons s set equal to 5 generatons. 5. A numercal example Ths part of the paper ncludes an example whose data s a combnaton of those appled n Zou et al. () and Chang and Chen (7). In ths example, the system ncludes subsystems where subsystems to 5 have non-reparable components whle subsystems 6 to have reparable components. Maxmum allowable weght and volume for the system are (unts of weght) and 8 (unts of volume), respectvely. Maxmum and mnmum numbers of allowable components n each subsystem have been consdered as 5 and, respectvely. Other detals are presented n Table. To solve ths problem, the mproved genetc algorthm proposed n ths paper has been used. The mproved GA desgned here has been coded by MATLAB software and run on a computer wth G of RAM. In ths paper, some prelmnary experments were used and the crossover and mutaton rates were set to.9 and., respectvely. Also, the populaton sze and maxmum generatons were taken to be and 5, respectvely. Table detals of problem nonreparable Reparable w wv α 5 β a b Sub Sub Sub Sub Sub Sub Sub Sub Sub Sub p q L λ U λ L µ U µ
10 98 In order to show the capablty of the genetc algorthm, the problem has also been solved by the Improved Partcle Swarm Optmzaton (IPSO) algorthm proposed n Wu et al. (), whch s consdered as one of the best algorthms n RAP so far. They demonstrated that IPSO s an algorthm wth a great capablty for solvng these problems. Therefore, ths algorthm was selected as sutable for makng comparsons. Also, for the IPSO, the populaton sze was selected to be PS =, maxmal number of teratons was set at K=5, and the mutaton probablty to p m =.5. The two algorthms were run tmes for each value of cost movng from to 5 and the results were presented n Table. In ths Table, SD represents standard devaton whch s based on the convergng values of the objectve functon. SD s expressed as follows: SD = f f ( k ) (7) k = where, f k s the k th convergng value of the objectve functon, and f represents the average value (medan) of the objectve functon. Based on the four crtera (Best, Worst, Medan, and SD) n Table, the mproved GA proposed here outperformed IPSO for all groups of cost values. The outperformance of the mproved GA s due to the use made of the crossover and mutaton operatons desgned here. These results also show that the avalablty of the system ncreases wth ncreasng cost. The solutons thus obtaned are shown n Table and the detaled soluton for the cost value of s presented n Table. Table Comparson of results for example between GA and IPSO Soluton number Cost Algorthm Best Worst Medan SD GA e- IPSO e-5 5 GA e-5 IPSO e- GA e-5 IPSO e-5 5 GA e- IPSO e- 5 GA e-5 IPSO e- 6 5 GA e-5 IPSO e- 7 GA e- IPSO e- 8 5 GA e-5 IPSO e- Fg. 5 shows the convergence of the objectve functon value n each generaton. Ths soluton belongs to one of the teratons for a cost equal to. The near-optmal soluton (objectve functon value = ) was acheved after approxmately 5 generatons. Table Detals of soluton number wth cost= Sub. Sub. Sub. Sub. Sub.5 Sub.6 Sub.7 Sub.8 Sub.9 Sub. n λ µ
11 H. Zoulfaghar et al. / Decson Scence Letters (5) 99 Objectve functon value generaton Fg. 5. Objectve functon value convergence The Pareto front results are llustrated n Fg. 6 by usng the medan of avalablty. Ths Fgure shows that for each value of cost, the avalablty obtaned by GA s better than that obtaned by IPSO. Avalablty Medan GA IPSO Cost Fg. 6. Pareto front of results for GA and IPSO These results also demonstrated that the convergence and stablty of the proposed GA are better than those of the IPSO algorthm. Fg. 7 shows that n 7 out of 8 cases, the value of SD for GA was smaller than that for IPSO. The precson of the genetc algorthm s also observed to be hgher than that of the IPSO algorthm. These ndcate that the proposed GA s a robust optmzaton algorthm. SD 9.E- 8.E- 7.E- 6.E- 5.E-.E-.E-.E-.E-.E Soluton Number GA IPSO Fg. 7. Compare stablty algorthms
12 6. Summary and Conclusons In redundancy allocaton problems (RAPs), t s commonly assumed that the system conssts of ether only reparable or non-reparable components. As an extenson to ths assumpton, a system consstng of both reparable and non-reparable components was consdered n ths paper and a new mathematcal model was developed for the system. The problem has been formulated as a nonlnear nteger programmng model subject to a number of gven constrants. Snce the RAPs belong to the NP-hard class of optmzaton problems, t s not easy to solve the proposed model n real cases, especally for large systems. Therefore, meta-heurstc methods are suggested for solvng such a hard and complex problem. In ths paper, an mproved genetc algorthm (GA) was developed as an effectve metaheurstc algorthm for solvng the RAP. The results obtaned by the genetc algorthm showed the satsfactory and approprate avalablty of the system. In addton, the precson of the genetc algorthm was shown to be hgh when compared wth one of the best algorthms reported n the lterature. For future work, the authors are nvestgatng the extenson of the proposed model by ntroducng fuzzy numbers. References Ardakan, M. A., & Hamadan, A. Z. (). Relablty redundancy allocaton problem wth coldstandby redundancy strategy. Smulaton Modellng Practce and Theory,, 7-8. Ardakan, M. A., & Hamadan, A. Z. (). Relablty optmzaton of seres parallel systems wth mxed redundancy strategy n subsystems. Relablty Engneerng & System Safety,, -9. Ardakan, M. A., Hamadan, A. Z., & Alnaghan, M. (5). Optmzng b-objectve redundancy allocaton problem wth a mxed redundancy strategy. ISA transactons, 55, 6 8. Afonso, L. D., Maran, V. C., & dos Santos Coelho, L. (). Modfed mperalst compettve algorthm based on attracton and repulson concepts for relablty-redundancy optmzaton. Expert Systems wth Applcatons, (9), Barlow RE, Proschan F. (98).Statstcal theory of relablty and lfe testng probablty model. Slver sprng. Bej, N., Jarbou, B., Eddaly, M., & Chabchoub, H. (). A hybrd partcle swarm optmzaton algorthm for the redundancy allocaton problem. Journal of Computatonal Scence, (), Cao, Y., Sun, H., Trved, K. S., & Han, J. J. (). System avalablty wth non-exponentally dstrbuted outages. Relablty, IEEE Transactons on, 5(), Chen, T. C., & You, P. S. (5). Immune algorthms-based approach for redundant relablty problems wth multple component choces. Computers n Industry, 56(), Chern, M. S. (99). On the computatonal complexty of relablty redundancy allocaton n a seres system. Operatons Research Letters, (5), 9-5. Lang, Y. C., & Smth, A. E. (). An ant colony optmzaton algorthm for the redundancy allocaton problem (RAP). Relablty, IEEE Transactons on,5(), 7-. Chang, C. H., & Chen, L. H. (7). Avalablty allocaton and mult-objectve optmzaton for parallel seres systems. European journal of operatonal research, 8(), -. dos Santos Coelho, L. (9). An effcent partcle swarm approach for mxed-nteger programmng n relablty redundancy optmzaton applcatons.relablty Engneerng & System Safety, 9(), Cot, D. W. (). Maxmzaton of system relablty wth a choce of redundancy strateges. IIE transactons, 5(6), Deb, K., Pratap, A., Agarwal, S., & Meyarvan, T. A. M. T. (). A fast and eltst mult-objectve genetc algorthm: NSGA-II. Evolutonary Computaton, IEEE Transactons on, 6(), DeWnter, F. A., Paes, R., Vermaas, R., & Glks, C. (). Maxmzng large drve avalablty. Industry Applcatons Magazne, IEEE, 8(), Dhngra, A. K. (99). Optmal apportonment of relablty and redundancy n seres systems under multple objectves. Relablty, IEEE Transactons on,(),
13 H. Zoulfaghar et al. / Decson Scence Letters (5) Elegbede, C., & Adjallah, K. (). Avalablty allocaton to reparable systems wth genetc algorthms: a mult-objectve formulaton. Relablty Engneerng & System Safety, 8(), 9-. Fyffe, D. E., Hnes, W. W., & Lee, N. K. (968). System relablty allocaton and a computatonal algorthm. Relablty, IEEE Transactons on, 7(), Garg, H. (). Performance analyss of complex reparable ndustral systems usng PSO and fuzzy confdence nterval based methodology. ISA transactons, 5(), 7-8. Ha, C., & Kuo, W. (6). Relablty redundancy allocaton: An mproved realzaton for non-convex nonlnear programmng problems. European Journal of Operatonal Research, 7(), -8. Hamadan, A. Z., & Khorshd, H. A. (). System relablty optmzaton usng tme value of money. The Internatonal Journal of Advanced Manufacturng Technology, 66(-), Hamadan A.Z. (98). Avalablty and Relablty Modelng, Ph.D. thess, Unversty of Bradford, England. Holland JH. (975). Adaptaton n natural and artfcal systems. Mchgan: Unversty of Mchgan Press. Kuo, W., & Prasad, V. R. (). An annotated overvew of system-relablty optmzaton. Relablty, IEEE Transactons on, 9(), Lee, K. W. (). Stochastc models for random-request avalablty. Relablty, IEEE Transactons on, 9(), 8-8. Levtn, G., & Lsnansk, A. (). A new approach to solvng problems of mult state system relablty optmzaton. Qualty and relablty engneerng nternatonal, 7(), 9-. Lang, Y. C., & Chen, Y. C. (7). Redundancy allocaton of seres-parallel systems usng a varable neghborhood search algorthm. Relablty Engneerng & System Safety, 9(), -. Ma, Y., Han, J. J., & Trved, K. S. (). Composte performance and avalablty analyss of wreless communcaton networks. Vehcular Technology, IEEE Transactons on, 5(5), 6-. Msra, K. B., & Sharma, U. (99). An effcent algorthm to solve nteger-programmng problems arsng n system-relablty desgn. Relablty, IEEE Transactons on, (), 8-9. Msra, K. B. (97). Relablty optmzaton of a seres-parallel system. Relablty, IEEE Transactons on, (), -8. Ng, K. Y., & Sancho, N. G. F. (). A hybrd dynamc programmng/depth-frst search algorthm, wth an applcaton to redundancy allocaton. IIE Transactons, (), Onsh, J., Kmura, S., James, R. J., & Nakagawa, Y. (7). Solvng the redundancy allocaton problem wth a mx of components usng the mproved surrogate constrant method. Relablty, IEEE Transactons on, 56(), 9-. Ouzneb, M., Nourelfath, M., & Gendreau, M. (8). Tabu search for the redundancy allocaton problem of homogenous seres parallel mult-state systems. Relablty Engneerng & System Safety, 9(8), Safar, J. (). Mult-objectve relablty optmzaton of seres-parallel systems wth a choce of redundancy strateges. Relablty Engneerng & System Safety, 8, -. Sercola, B. (999). Avalablty analyss of reparable computer systems and statonary detecton. Computers, IEEE Transactons on, 8(), Soltan, R. (). Relablty optmzaton of bnary state non-reparable systems: A state of the art survey. Internatonal Journal of Industral Engneerng Computatons, 5(), 9-6. Srvastava, V. K., & Fahm, A. (988). k-out-of-m system avalablty wth mnmum-cost allocaton spares. Relablty, IEEE Transactons on, 7(), Valan, E., & Valan, E. (). A cuckoo search algorthm by Lévy flghts for solvng relablty redundancy allocaton problems. Engneerng Optmzaton,5(), Valan, E., Tavakol, S., Mohanna, S., & Hagh, A. (). Improved cuckoo search for relablty optmzaton problems. Computers & Industral Engneerng, 6(), Wang, L., & L, L. P. (). A co-evolutonary dfferental evoluton wth harmony search for relablty redundancy optmzaton. Expert Systems wth Applcatons, 9(5), Wu, P., Gao, L., Zou, D., & L, S. (). An mproved partcle swarm optmzaton algorthm for relablty problems. ISA transactons, 5(), 7-8.
14 Yeh, W. C., & Hseh, T. J. (). Solvng relablty redundancy allocaton problems usng an artfcal bee colony algorthm. Computers & Operatons Research, 8(), Zhao, M. (99). Avalablty for reparable components and seres systems. Relablty, IEEE Transactons on, (), 9-. Zo, E., & Bazzo, R. (). Level Dagrams analyss of Pareto Front for mult-objectve system redundancy allocaton. Relablty Engneerng & System Safety, 96(5), Zou, D., Gao, L., Wu, J., L, S., & L, Y. (). A novel global harmony search algorthm for relablty problems. Computers & Industral Engneerng, 58(), 7-6. Zou, D., Gao, L., L, S., & Wu, J. (). An effectve global harmony search algorthm for relablty problems. Expert Systems wth Applcatons, 8(), Zoulfaghar, H., Hamadan, A. Z., & Ardakan, M. A. (). B-objectve redundancy allocaton problem for a system wth mxed reparable and non-reparable components. ISA transactons, 5(), 7-.
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 informationDesign 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 informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationA Variable Neighbourhood Descent Algorithm for the Redundancy Allocation Problem
EMS Vol. 4, No., pp. 94-0, June 2005. A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem Yun-Cha Lang Cha-Chuan u Department of ndustral Engneerng and Management, Yuan Ze Unversty
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationResource 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 informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationMarkov 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 informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationSolving 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 informationSpeeding 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 informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationA 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 informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationSOLVING 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 informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More informationDifferential 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 informationNumerical 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 informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationABSTRACT
RELIABILITY AND SENSITIVITY ANALYSIS OF THE K-OUT-OF-N:G WARM STANDBY PARALLEL REPAIRABLE SYSTEM WITH REPLACEMENT AT COMMON-CAUSE FAILURE USING MARKOV MODEL M. A. El-Damcese 1 and N. H. El-Sodany 2 1 Mathematcs
More informationLOW 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 informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationUncertain Models for Bed Allocation
www.ccsenet.org/ghs Global Journal of Health Scence Vol., No. ; October 00 Uncertan Models for Bed Allocaton Lng Gao (Correspondng author) College of Scence, Guln Unversty of Technology Box 733, Guln 54004,
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationUsing 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 informationIrene Hepzibah.R 1 and Vidhya.R 2
Internatonal Journal of Scentfc & Engneerng Research, Volume 5, Issue 3, March-204 374 ISSN 2229-558 INTUITIONISTIC FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (IFMOLPP) USING TAYLOR SERIES APPROACH
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationAn improved multi-objective evolutionary algorithm based on point of reference
IOP Conference Seres: Materals Scence and Engneerng PAPER OPEN ACCESS An mproved mult-objectve evolutonary algorthm based on pont of reference To cte ths artcle: Boy Zhang et al 08 IOP Conf. Ser.: Mater.
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationEvolutionary Multi-Objective Environmental/Economic Dispatch: Stochastic vs. Deterministic Approaches
Evolutonary Mult-Objectve Envronmental/Economc Dspatch: Stochastc vs. Determnstc Approaches Robert T. F. Ah Kng, Harry C. S. Rughooputh and Kalyanmoy Deb 2 Department of Electrcal and Electronc Engneerng,
More informationA 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 informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationThe Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems
The Convergence Speed of Sngle- And Mult-Obectve Immune Algorthm Based Optmzaton Problems Mohammed Abo-Zahhad Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut,
More informationAppendix 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 informationOperating 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 informationEntropy 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 informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More informationParticle 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 informationResearch 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 informationStatistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA
14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationA Particle Swarm Algorithm for Optimization of Complex System Reliability
Internatonal Journal of Performablty Engneerng Vol., No., January 0, pp. -. RAMS Consultants Prnted n Inda A Partcle Swarm Algorthm for Optmzaton of Complex System Relablty SANGEETA PANT *, DHIRAJ ANAND
More informationSelf-adaptive Differential Evolution Algorithm for Constrained Real-Parameter Optimization
26 IEEE Congress on Evolutonary Computaton Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 26 Self-adaptve Dfferental Evoluton Algorthm for Constraned Real-Parameter Optmzaton V.
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationA 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 informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationAmiri 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 informationGeneralized 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 informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationMulti-Robot Formation Control Based on Leader-Follower Optimized by the IGA
IOSR Journal of Computer Engneerng (IOSR-JCE e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 1, Ver. III (Jan.-Feb. 2017, PP 08-13 www.osrjournals.org Mult-Robot Formaton Control Based on Leader-Follower
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationDouble Acceptance Sampling Plan for Time Truncated Life Tests Based on Transmuted Generalized Inverse Weibull Distribution
J. Stat. Appl. Pro. 6, No. 1, 1-6 2017 1 Journal of Statstcs Applcatons & Probablty An Internatonal Journal http://dx.do.org/10.18576/jsap/060101 Double Acceptance Samplng Plan for Tme Truncated Lfe Tests
More information4DVAR, 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 informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationInternational Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN
Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY
More informationDUE: 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 informationNON-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 informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationA 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 informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationHongyi 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 informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationMODIFIED PREDATOR-PREY (MPP) ALGORITHM FOR CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION
EVOLUTIONARY METHODS FOR DESIGN, OPTIMIZATION AND CONTROL T. Burczynsk and J. Péraux (Eds.) CIMNE, Barcelona, Span 29 MODIFIED PREDATOR-PREY () ALGORITHM FOR CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION Souma
More information