A Particle Swarm Algorithm for Optimization of Complex System Reliability
|
|
- Ethel Cook
- 5 years ago
- Views:
Transcription
1 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 and AMAR KISHOR, SURAJ BHAN SINGH Department of Mathematcs, Unversty of Petroleum and Energy Studes, Dehradun, INDIA: 8007 Department of Electrcal and Electroncs, GEU, Dehradun, INDIA: 800 Department of Electroncs and Communcaton Scences Unt, Indan Statstcal Insttute Kolkata, INDIA: Department of Mathematcs, Statstcs and Computer Scence, G.B.Pant Unversty of Agrculture and Technology, Pantnagar, INDIA: 6 (Receved on January 8, 0, revsed on May 8, June 07 and July 6, 0) Abstract: In recent years, a broad class of stochastc metaheurstcs, such as Tabu search, smulated annealng, genetc algorthm, partcle swarm optmzaton, ant colony optmzaton etc. has been appled for relablty optmzaton problems. In ths paper a partcle swarm optmzaton algorthm s presented. Then, the performance of the proposed algorthm s tested on some complex engneerng optmzaton problems. They are three well-known complex relablty optmzaton problems. Fnally, the results are compared wth those gven by several well-known methods. Numercal experments demonstrate that the proposed method s promsng and the results obtaned by proposed algorthm are ether superor or comparable to the prevously best known results presented n lterature for relablty optmzaton of complex systems n terms of computaton tme as well as soluton qualty. Keywords: Relablty optmzaton, metaheurstcs, partcle swarm optmzaton, relablty allocaton, redundancy allocaton.. Introducton In the past fve decades the problem of relablty optmzaton and redundancy allocaton has been addressed n many studes. Important contrbutons have been devoted snce 970 [-] n order to cope wth optmzaton problem arsng n system relablty. The problem of relablty optmzaton has been wdely treated by many authors. To lst a few of them, Luss [] optmzed such problems by non lnear nteger programmng procedure, Mohan and Shankar [] appled random search technque to optmze complex system, Msra and Sharma [] developed MIP-Technque to solve nteger programmng problems arsng n system relablty desgn. Tllman et al. [6], Lad et al. [7], Chaturved and Msra [8] provded an excellent survey of earler approaches appled to solve these problems. Relablty optmzaton problems are categorzed nto three typcal problems accordng to the types of ther decson varables: () relablty allocaton, () redundancy allocaton, and () relablty-redundancy allocaton. From the vewpont of mathematcal programmng, relablty allocaton s a contnuous nonlnear programmng problem (NLP), redundancy allocaton s a pure nteger nonlnear programmng problem (INLP), and relablty-redundancy allocaton s a mxed nteger nonlnear programmng problem (MINLP). In general, achevng optmal relablty desgn s qute dffcult because relablty optmzaton problems are NP-hard [9]. Further, solvng such problems usng * Correspondng author s emal: pant.sangeet@gmal.com
2 Sangeeta Pant, Dhraj Anand, Amar Kshor and Suraj Bhan Sngh heurstcs or exact algorthms s more dffcult. Ths s because these optmzaton problems generate a very large search space, and searchng for optmal solutons usng exact methods or heurstcs wll necessarly be extremely tme consumng. Therefore, metaheurstc algorthms are more sutable for solvng relablty optmzaton problems. Recently, many metaheurstcs [0-9] have been employed to solve relablty optmzaton problems. In ths present paper, we appled a PSO to solve relablty optmzaton and redundancy allocaton problems of complex systems. The man concept of PSO s based on the food searchng behavor of brds flockng or fsh schoolng. When PSO s adopted to solve problems, each partcle has ts own locaton and velocty, whch determne the flyng drecton and dstance respectvely. Comparng wth other evolutonary approaches PSO has the followng advantages [0-]: () less parameters () easy mplementaton () fast convergence. These advantages are good for solvng the relablty optmzaton problems because a populaton of partcles n PSO can operate smultaneously so that the possblty of paralyss n the whole process can be reduced. The results obtaned by usng PSO approach are compared wth the results obtaned from other technques n the lterature. As reported, solutons obtaned by the proposed method are better than or as well as the prevously best-known solutons.. Partcle Swarm Optmzaton Partcle swarm optmzaton (PSO) s a populaton-based search algorthm based on the smulaton of the socal behavor of brds wthn a flock [-]. PSO s ntalzed wth randomly generated populaton of partcles (ntal swarm) and a random velocty s assgned to each partcle that propagates the partcle n search space towards optma over a number of teratons. Each partcle has a memory rememberng best poston attaned by t n the past, whch s called personal best poston (P best ). Each partcle has ts P best and the partcle wth the best value (maxmum or mnmum accordng to the problem) of ftness s called global best partcle (G best ). Suppose that the search space s D dmensonal, the th partcle of the populaton can be represented by a D-dmensonal vector D T X = ( x, x,..., x ). The velocty of ths partcle can be represented by another D-dmensonal vector D T V = ( v, v,..., v ).The prevously best vsted poston of th partcle s denoted by D T P = ( p, p,..., p ) and the best partcle n the swarm s denoted by D T P g = ( pg, pg,..., pg ). Partcle changes ts poston and velocty accordng to the followng equatons: k + k k k k Vd = wvd + cr [ pd ( t) xd ( t)] + cr [ pg ( t) xd ( t)] () k + k k + xd ( t + ) = xd ( t) + vd ( t + ) () where k = teraton number, d=,,, D; =,,.N; N= swarm sze, w = nerta weght, whch controls the momentum of partcle by weghng the contrbuton of prevous velocty, c and c are postve constants called acceleraton coeffcents; r and r random numbers unformly dstrbuted between [0,]. The partcle swarm optmzaton algorthm whch s appled presently to solve relablty optmzaton problem s smlar to the one used by [] for optmzaton of nonlnear taper but here we adopted dynamc changng acceleraton coeffcents as n [6]. These modfcatons can be mathematcally represented by equatons () and () respectvely.
3 Partcle Swarm Algorthm for Optmzaton of Complex System Relablty c ( t) = c + ( c f c )* ITER / ITERMAX () c ( t) = c + ( c f c )* ITER / ITERMAX () where, c and c are ntal values and c f and c f are fnal values of c and c respectvely, ITERMAX s maxmum number of teratons and ITER s the current teraton. The large value of c and small value of c at begnnng the partcles are allowed to explore new regons n search space nstead of chasng the global best partcle. On the contrary wth small value of c and a large value c allow partcles to move towards the populaton best. Also we set the constant value of nerta weght nstead of lnearly decreasng t and vary c and c accordng to equatons () and (). Maxmum velocty n each dmenson s restrcted tovmax = γ * X, where max γ s a constant and can take any value between 0 and (problem dependent). Also here we have restrcted velocty and poston of the partcle accordng to equatons () and (6) respectvely,. e. Vmax, f Vd > Vmax V d = Vmax, f Vd < V max () Vd, otherwse X max, f xd > X max x d = X mn, f xd < X mn (6) xd, otherwse. Problem Descrpton Relablty engneers often need to work not only on seres or parallel systems but also on the systems whch are nether purely connected n seres nor purely n parallel but may have mxed confguraton. Such systems are called complex systems. To evaluate the performance of the proposed approach two relablty optmzaton problems, () relablty allocaton and () redundancy allocaton, are consdered.. Relablty Allocaton Problems Under ths prsm two case studes are consdered. They are a lfe support system n space capsule and a complex brdge system... Lfe Support System n Space Capsule Fgure shows the frst complex system of the present study [6]. The system relablty R s and system cost C s of lfe support system n a space capsule are gven by: [( )( )] ( )[ { ( )( )}] RS = r r r r r r r (7) α α α α CS = Kr + K r + K r + K r (8) where, K =00, K =00, K =00, K =0and α = 0.6, =,,,. Ths problem s contnuous nonlnear optmzaton problem, where objectve s to determne the mnmum cost of system subject to the constrants on relablty of the system. The problem formulaton s as follows: Mnmze C S
4 6 Sangeeta Pant, Dhraj Anand, Amar Kshor and Suraj Bhan Sngh subject to 0. =,,, r 0.9 R S where, R s th component s relablty... Complex Brdge System Ths problem consders the relablty optmzaton of complex brdge network [,] as shown n the Fgure wth nonlnear constrant. The system relablty (R s ) and system cost (C s ) are gven by R S = r r + r r + r r r + r r r + r r r r r r r r r (9) r r r r r r r r r r r r r r r r b C S = a exp = ( r ) (0) The mathematcal expresson of the problem s Mnmze C S subject to 0 r, =,,,, a 0.99 R s, = and b =0. 000, for =,,,,. IN OUT IN OUT Fgure : Lfe-Support System n a Space Capsule Fgure : Complex Brdge System. Redundancy Allocaton Problems Here a mxed seres parallel system [] s consdered. The block dagram of a n-stage seres parallel system s presented n Fgure. IN OUT x x x n Fgure : Block Dagram of n-stage Seres Parallel System Ths problem s an nteger non lnear programmng problem where objectve s to fnd the optmal number of redundances n a multstage mxed system n order to acheve the maxmum relablty under the restrcton on cost, weght and volume.
5 Partcle Swarm Algorthm for Optmzaton of Complex System Relablty 7 Two dfferent cases for two dfferent values of n (n= and ) are consdered. As the value of n (no. of stages) ncreased the complexty of the system wll ncrease as well.... Case - Mxed Seres Parallel System wth Fve Parallel Unts The mathematcal formulaton of the problem s: Fnd the optmal x, =,,,, to maxmze R subject to V S S = = x ( r ) = = P x 0 x CS = C x + exp 7 = W exp 00 S = W x = x The relevant data for ths problem s gven n Table... Case - Mxed Seres Parallel System wth Ffteen Parallel Unts The problem formulaton s as follow: Fnd the optmal x, =,,,..., whch maxmzes R subject to C x S = [ ( r = = = 00 W x ) x ] Table : Data Used for Problem.. Table : Data Used for Problem.. r o r C W R C W Smulaton Results and Dscusson The PSO s coded n Bloodshed Dev C++. All the programs were run on an Intel (R) Pentum (R), D CPU,.86GHz processors wth 0.99 GB of Random Access Memory (RAM). Table shows the setup of parameters c c, c, c, γ and w used for, f f relablty optmzaton problems, whch affect convergence rate and robustness of the
6 8 Sangeeta Pant, Dhraj Anand, Amar Kshor and Suraj Bhan Sngh search procedure. Dfferent parameter settngs have been checked and tuned for each problem, the parameter settng correspondng to best results are reported n Table. Tables to 7 presents a comparson between the best results obtaned n ths paper wth other results n lterature. The comparson was made on the bass of the number of functon evaluatons as prevously have been done by [], [] and []. Table : Parameters for PSO Examples Pop sze Lfe support system n space capsule Complex brdge system Mxed seres parallel system consstng fve parallel unts Mxed seres parallel system consstng ffteen parallel unts For lfe support system n space capsule, as mentoned n Table, total 00 cost functon evaluatons are made and PSO provded 6.86 as the optmal system cost and wth system relablty. Results obtaned due to present study have been lsted along wth the results obtaned for the same n the past as gven n Table. ACO [] also obtaned same results but wth hgher (0,00) functon evaluatons. Whereas MGDA [] and C-SOMGA [] obtaned and optmal cost wth 6,60 and,00,000 functon evaluatons respectvely. Thus, for ths problem where objectve s to mnmze system cost subject to the constrants on system relablty, PSO obtaned the dentcal soluton wth ACO but consumed less functon evaluatons. Further, comparson ndcates that soluton obtaned by PSO scores over C-SOMGA [], MGDA [], RMMM-CES [7], INESA [] and SA [] n terms of both accuracy as well as convergence speed. Table : Result Comparson for Lfe Support System n Space Capsule PSO C-SOMGA MGDA ACO CEA (best) INESA SA r r r r R S C FE ,60 0, For the complex brdge system, Table presents the results obtaned by PSO along wth all prevously reported results. Table shows that PSO provdes most relevant mprovement to the prevous sx best known solutons. It obtaned mnmum system cost.0998 at,0,000 functon evaluatons. Although, t consumed more functon evaluatons than C-SOMGA [], MGDA [] and ACO [] but stll t s able to gve mnmum system cost.
7 Partcle Swarm Algorthm for Optmzaton of Complex System Relablty 9 Table : Result Comparson for Complex Brdge System PSO C SOMGA MGDA ACO I-NESA SA Random Search Technques[] r r r r r R S C S FE,0, , Same nvestgaton has been done for mxed seres parallel system wth consstng fve parallel unts. The results are presented n Table 6. Agan PSO s able to obtan best known solutons whch were earler obtaned by C-SOMGA [], ACO [], SA [], CEA [7], INESA [] and generalzed Lagrange functon approach [6]. PSO only requres 0 (lowest among all) functon evaluatons to acheve ths value. Thus PSO agan yelded superor soluton n comparson to all other sx methods n terms of consumpton of CPU tme. Table 6: Result Comparson for Mxed Seres Parallel System Consstng Fve Parallel Unts PSO C-SOMGA ACO CEA (best) INESA SA Generalzed Lagrange Functon Approach x x x x x Rs FE Fnally, for mxed seres parallel system wth consstng ffteen parallel unts, Table 7 shows the results obtaned by PSO along wth other past reported solutons. The best result yelded by PSO s (,, 6,,,,,,,,,,,, ). The system relablty and cost have been obtaned as 0.96 and 9.0 respectvely. The results are compared wth the results obtaned by other fve optmzaton methods, whch are C-SOMGA [], MGDA [], ACO [], INESA [], SA [] and nteger programmng technque []. MGDA and ACO obtaned the same system relablty wth 77 and 000 functon evaluatons. Hence t can be concluded easly that the accuracy obtaned by PSO, MGDA,
8 0 Sangeeta Pant, Dhraj Anand, Amar Kshor and Suraj Bhan Sngh ACO are exactly matchng. whle PSO found to be superor to MGDA, ACO when speed s compared. Whle C-SOMGA obtaned 0.90 system relablty wth functon evaluaton. Thus PSO acheved hgher relablty than C-SOMGA. Further, present study shows that results obtaned by PSO s agan far better than the earler reported results correspondng to INESA and SA both n terms of accuracy and speed. Thus, Observaton of Table 7 fnds that the soluton provded by PSO gves better relablty at relatvely lower functon evaluatons than C-SOMGA, MGDA, ACO, INESA and SA. Table 7: Result Comparson for Mxed Seres Parallel System Consstng Ffteen Parallel Unts PSO C- SOMGA MGDA ACO INESA SA Integer Programmng x x x x x x 6 x 7 x 8 x 9 x 0 x x x x x R S FE Concluson In ths paper, a new PSO was proposed for solvng complex network relablty. In general, system relablty optmzaton problems are nonlnear programmng problems and proved to be NP-hard from computatonal pont of vew. That s, they are more dffcult to solve than any general nonlnear programmng problem. Moreover, the comparson wth studes n the lterature nvolvng the same problems demonstrated that PSO has better effcency n solvng the complex network relablty optmzaton problem as t can provde a soluton whch s ether comparable to or superor to the best avalable results. The smulaton results ndcates that our approach s a vable alternatve snce PSO s able to obtan solutons not only n terms of accuracy and but also n terms of speed than those obtaned from prevously publshed n lterature. References [] Msra, K. B., and M. D. Ljubojevc. Optmal Relablty Desgn of A System: A New Look. IEEE Transactons on Relablty, 97; R-(): -8. [] Msra, K. B. Optmal Relablty Desgn of A System Contanng Mxed Redundances. IEEE Transactons on Power Apparatus & Systems, 97; 9(): [] Luus, R. Optmzaton of System Relablty by A New Nonlnear Integer Programmng Procedure. IEEE Transactons on Relablty, 97; R-(): -6.
9 Partcle Swarm Algorthm for Optmzaton of Complex System Relablty [] Mohan, C. and K. Shanker. Relablty Optmzaton of Complex Systems usng Random Search Technque. Mcroelectroncs Relablty, 988; 8 (): -8. [] Msra, K. B. and U. Sharma. An Effcent Algorthm to Solve Integer-Programmng Problems Arsng n System-Relablty Desgn. IEEE Transactons on Relablty, 99; 0(): 8-9. [6] Tllman, F. A., C. L. Hwang, and W. Kuo. Optmzaton of Systems Relablty. Marcel Dekker Inc., New York, 980. [7] Lad, B. K., M. S. Kulkarn, and K. B. Msra. Optmal Relablty Desgn of a System. In: Handbook of Performablty Engneerng. Msra, K. B. (Ed.) Sprnger, Verlag, London, 008, [8] Chaturved, S. K., and K. B. Msra. MIP: A Versatle Tool for Relablty Desgn of A System. In: Handbook of Performablty Engneerng. Msra, K.B. (Ed.) Sprnger Verlag, London, 008, -. [9] Chern, M. S. On the Computatonal Complexty of Relablty Redundancy Allocaton n a Seres System. Operatons Research Letters, 99; (): 09-. [0] Kuo, W., and R. Wan. Recent Advances n Optmal Relablty Allocaton. IEEE Transactons on System, Man and Cybernetcs, Part A: System Humans, 007; 7():- 6. [] Rav, V., B. S. N. Murty and J. Reddy. Nonequlbrum Smulated-Annealng Algorthm Appled to Relablty Optmzaton of Complex Systems. IEEE Transactons on Relablty, 997; 6(): -9. [] Shelokar, P. S., V. K. Jayaraman, and B.D. Kulkarn. Ant Algorthm for Sngle and Multobjectve Relablty Optmzaton Problems. Qualty and Relablty Engneerng Internatonal, 00; 8(6): 97-. [] Rav, V. Optmzaton of Complex System Relablty by A Modfed Great Deluge Algorthm. Asa-Pacfc Journal of Operatonal Research, 00; (): [] Deep, K., and Deept. Relablty Optmzaton of Complex Systems through C-SOMGA. Journal of Informaton and Computng Scence, 009; (): 6-7. [] Yeh, W. C. A Two-Stage Dscrete Partcle Swarm Optmzaton for the Problem of Multple Mult-Level Redundancy Allocaton n Seres Systems. Expert Systems wth Applcatons, 009; 6(): [6] Pant, S., and S. B. Sngh. Partcle Swarm Optmzaton to Relablty Optmzaton n Complex System. IEEE Int. Conf. on Qualty and Relablty, Bangkok, Thaland, Sept - 7, 0; -. [7] Ran, M., S. P. Sharma and H. Garg. A Novel Approach for Analyzng the Behavour of Industral Systems under Uncertanty. Internatonal Journal of Performablty Engneerng, 0; 9(): 0 0. [8] Zo, E., F. D Mao, and S. Martorell. Fuson of Artfcal Neural Networks and Genetc Algorthms for Mult-Objectve System Relablty Desgn Optmzaton. Journal of Rsk and Relablty, 008; (): -6. [9] Kshore, A., S. P. Yadav, and S. Kumar. A Mult Objectve Genetc Algorthm for Relablty Optmzaton Problem. Internatonal Journal of Performablty Engneerng, 009; (): 7. [0] Hassan, R., B. Cohanm, O. De Weck, and G. Venter. A Comparson of Partcle Swarm Optmzaton and the Genetc algorthm. In 6th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs, and Materals Conference, Austn, TX, Aprl 8-, 00. [] Clow, B., and T. Whte. An Evolutonary Race: A Comparson of Genetc Algorthms and Partcle Swarm Optmzaton used for Tranng Neural Networks. Int. Conf. on Artfcal Intellgence, Las Vegas, Nevada, USA, June -, 00; 8-88.
10 Sangeeta Pant, Dhraj Anand, Amar Kshor and Suraj Bhan Sngh [] Hodgson, R. J. W. Partcle Swarm Optmzaton appled to the Atomc Cluster Optmzaton Problem. The Genetc and Evolutonary Computaton Conference, New York, USA, July 9-, 00; [] Engelbrecht, A. P. Fundamentals of Computatonal Swarm Intellgence. Jhon Wley and Sons Ltd., Chchester, England, 00. [] Kennedy, J., and R. Eberhart. Partcle Swarm Optmzaton. IEEE Int. Conf. on Neural Networks, Perth, Australa, 7 Nov- Dec, 99; [] Chauhan, N., A. Mttal, D. Wagner, M. V. Kartkeyan, and M. K. Thumm. Desgn and Optmzaton of Nonlnear Tapers usng Partcle Swarm Optmzaton. Internatonal Journal of Infrared and Mllmeter Waves, 008; 9(8): [6] Ratnaweera, A., S. K. Halgamuge, and H. C. Watson. Self-Organzng Herarchcal Partcle Swarm Optmzer wth Tme-Varyng Acceleraton Coeffcents. IEEE Transactons on Evolutonary Computaton, 00; 8(): 0-. [7] Rocco, C. M., A. J. Mller, J. A. Moreno and N. A. Carrasquero. Cellular Evolutonary Approach Appled to Relablty Optmzaton of Complex Systems. Annual Relablty and Mantanablty Symposum, Los Angeles, CA, Jan -7, 000; 0-. Sangeeta Pant s currently workng as Assstant Professor n Unversty of Petroleum and Energy Studes, Dehradun, Inda. She holds Ph.D. n Mathematcs wth concentraton on Metaheurstcs and Relablty Optmzaton from G. B. Pant Unversty of Agrculture and Technology, Pantnagar, Inda. Dheeraj Anand holds B.Tech. n Electroncs & Communcaton Engneerng from Graphc Era Unversty, Dehradun, Inda. Hs area of nterest s computer programmng and on self-motvatng projects. Amar Kshor s currently a postdoctoral fellow at Electroncs and Communcaton Scences Unt, Indan statstcal Insttute Kolkata, Inda. Earler, he worked as Assstant professor, Department of Mathematcs, School of Engneerng and Technology, Sharda Unversty, Greater Noda, Inda. He Holds Ph.D. n Mathematcs from I. I. T. Roorkee. Hs current research areas nclude Aggregaton Operators, OWA Operators, Multobjectve Optmzaton, Relablty Optmzaton, Evolutonary Algorthms and Fuzzy Logc. Suraj Bhan Sngh s Professor n G. B. Pant Unversty of Agrculture and Technology, Pantnagar, Inda. He holds Ph.D. n Mathematcs. Hs current research area ncludes, Relablty Analyss and Operatons Research.
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 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 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 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 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 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 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 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 informationComparative Analysis of SPSO and PSO to Optimal Power Flow Solutions
Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons
More 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 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 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 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 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 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 informationPARTICLE SWARM OPTIMIZATION BASED OPTIMAL POWER FLOW FOR VOLT-VAR CONTROL
ARPN Journal of Engneerng and Appled Scences 2006-2012 Asan Research Publshng Networ (ARPN). All rghts reserved. PARTICLE SWARM OPTIMIZATION BASED OPTIMAL POWER FLOW FOR VOLT-VAR CONTROL M. Balasubba Reddy
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 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 informationOptimal Placement of Unified Power Flow Controllers : An Approach to Maximize the Loadability of Transmission Lines
S. T. Jaya Chrsta Research scholar at Thagarajar College of Engneerng, Madura. Senor Lecturer, Department of Electrcal and Electroncs Engneerng, Mepco Schlenk Engneerng College, Svakas 626 005, Taml Nadu,
More informationMODIFIED PARTICLE SWARM OPTIMIZATION FOR OPTIMIZATION PROBLEMS
Journal of Theoretcal and Appled Informaton Technology 3 st ecember 0. Vol. No. 005 0 JATIT & LLS. All rghts reserved. ISSN: 9985 www.jatt.org EISSN: 87395 MIFIE PARTICLE SARM PTIMIZATIN FR PTIMIZATIN
More informationResearch Article Multiobjective Economic Load Dispatch Problem Solved by New PSO
Advances n Electrcal Engneerng Volume 2015, Artcle ID 536040, 6 pages http://dx.do.org/10.1155/2015/536040 Research Artcle Multobjectve Economc Load Dspatch Problem Solved by New PSO Nagendra Sngh 1 and
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More 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 informationDecision Science Letters
Decson Scence Letters (5) 89 Contents lsts avalable at GrowngScence Decson Scence Letters homepage: www.growngscence.com/dsl Mult-objectve avalablty-redundancy allocaton problem for a system wth reparable
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 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 informationEvolutionary Computational Techniques to Solve Economic Load Dispatch Problem Considering Generator Operating Constraints
Internatonal Journal of Engneerng Research and Applcatons (IJERA) ISSN: 48-96 Natonal Conference On Advances n Energy and Power Control Engneerng (AEPCE-K1) Evolutonary Computatonal Technques to Solve
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
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 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 informationA New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane
A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,
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 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 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 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 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 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 informationAPPLICATION OF RBF NEURAL NETWORK IMPROVED BY PSO ALGORITHM IN FAULT DIAGNOSIS
Journal of Theoretcal and Appled Informaton Technology 005-01 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 APPLICATION OF RBF NEURAL NETWORK IMPROVED BY PSO ALGORITHM
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More 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 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 informationA 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 informationRiccardo Poli, James Kennedy, Tim Blackwell: Particle swarm optimization. Swarm Intelligence 1(1): (2007)
Sldes largely based on: Rccardo Pol, James Kennedy, Tm Blackwell: Partcle swarm optmzaton. Swarm Intellgence 1(1): 33-57 (2007) Partcle Swarm Optmzaton Sldes largely based on: Rccardo Pol, James Kennedy,
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 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 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 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 informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
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 informationArmy Ants Tunneling for Classical Simulations
Electronc Supplementary Materal (ESI) for Chemcal Scence. Ths journal s The Royal Socety of Chemstry 2014 electronc supplementary nformaton (ESI) for Chemcal Scence Army Ants Tunnelng for Classcal Smulatons
More informationOptimal 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 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 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 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 informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
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 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 New Quantum Behaved Particle Swarm Optimization
A New Quantum Behaved Partcle Swarm Optmzaton Mlle Pant Department of Paper Technology IIT Roorkee, Saharanpur Inda mllfpt@tr.ernet.n Radha Thangaraj Department of Paper Technology IIT Roorkee, Saharanpur
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
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 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 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 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 informationCHAPTER 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 informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
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 informationRECENTLY, the reliable supply of electric power has been
552 IEEE TRANSACTIONS ON ENERGY CONVERSION, VOL. 21, NO. 2, JUNE 2006 Multobjectve Control of Power Plants Usng Partcle Swarm Optmzaton Technques Jn S. Heo, Kwang Y. Lee, Fellow, IEEE, and Raul Garduno-Ramrez
More informationOdd/Even Scroll Generation with Inductorless Chua s and Wien Bridge Oscillator Circuits
Watcharn Jantanate, Peter A. Chayasena, Sarawut Sutorn Odd/Even Scroll Generaton wth Inductorless Chua s and Wen Brdge Oscllator Crcuts Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * School
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 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 informationSolving 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 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 informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationParameter Estimation for Dynamic System using Unscented Kalman filter
Parameter Estmaton for Dynamc System usng Unscented Kalman flter Jhoon Seung 1,a, Amr Atya F. 2,b, Alexander G.Parlos 3,c, and Klto Chong 1,4,d* 1 Dvson of Electroncs Engneerng, Chonbuk Natonal Unversty,
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
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 information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationA NUMERICAL COMPARISON OF LANGRANGE AND KANE S METHODS OF AN ARM SEGMENT
Internatonal Conference Mathematcal and Computatonal ology 0 Internatonal Journal of Modern Physcs: Conference Seres Vol. 9 0 68 75 World Scentfc Publshng Company DOI: 0.4/S009450059 A NUMERICAL COMPARISON
More informationImplementation of digital pheromones for use in particle swarm optimization
Mechancal Engneerng Conference Presentatons, Papers, and Proceedngs Mechancal Engneerng 006 Implementaton of dgtal pheromones for use n partcle swarm optmzaton Jung Leng Foo Iowa State Unversty Vjay Kalvarapu
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationExponential Type Product Estimator for Finite Population Mean with Information on Auxiliary Attribute
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 10, Issue 1 (June 015), pp. 106-113 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) Exponental Tpe Product Estmator
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 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 informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationTransient Stability Constrained Optimal Power Flow Using Improved Particle Swarm Optimization
Transent Stablty Constraned Optmal Power Flow Usng Improved Partcle Swarm Optmzaton Tung The Tran and Deu Ngoc Vo Abstract Ths paper proposes an mproved partcle swarm optmzaton method for transent stablty
More 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 informationarxiv: v1 [math.oc] 3 Aug 2010
arxv:1008.0549v1 math.oc] 3 Aug 2010 Test Problems n Optmzaton Xn-She Yang Department of Engneerng, Unversty of Cambrdge, Cambrdge CB2 1PZ, UK Abstract Test functons are mportant to valdate new optmzaton
More informationA SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]
Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes
More 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 informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
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 informationDiscrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations
Dscrete Partcle Swarm Optmzaton for TSP: Theoretcal Results and Expermental Evaluatons Matthas Hoffmann, Mortz Mühlenthaler, Sabne Helwg, Rolf Wanka Department of Computer Scence, Unversty of Erlangen-Nuremberg,
More informationAn Adaptive Learning Particle Swarm Optimizer for Function Optimization
An Adaptve Learnng Partcle Swarm Optmzer for Functon Optmzaton Changhe L and Shengxang Yang Abstract Tradtonal partcle swarm optmzaton (PSO) suffers from the premature convergence problem, whch usually
More informationApplication 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 informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More information