An improved multi-objective evolutionary algorithm based on point of reference
|
|
- Priscilla Moody
- 5 years ago
- Views:
Transcription
1 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. Sc. Eng Vew the artcle onlne for updates and enhancements. Ths content was downloaded from IP address on 3/0/08 at 00:0
2 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/0605 An mproved mult-objectve evolutonary algorthm based on pont of reference Boy Zhang, Xue Zhou,Yuqng Lu, Xangl Xu, Lbao Zhang * School of Informaton Scence and technology, Northeast Normal Unversty, Changchun, Chna Department of Informaton Operaton and Command Tranng, NDU of PLA, Bejng, Chna *Correspondng author e-mal: lbzhang@nenu.edu.cn Abstract. In the artcle presents a new evolutonary algorthms, ths algorthm s based on reference ponts. Ths algorthm accordng to a archve fnd the non-domnated soluton, and make ths soluton from large to small order accordng to crowdng dstance and let the space s dvded to several small space equdstant, n each the subspace to obtan ts centrod as the reference pont. The method used n ths paper are not predefned reference pont but n the course of evoluton accordng to the current state of dynamc reference pont partcles to gude the evoluton, fnally usng fve effectveness test functons prove algorthm.. Introducton The mult-objectve optmzaton problems(mop) has run through our lves. For eample the scentfc practce, the engneerng system desgn and the socal producton actvtes. The process of solvng MOP and sngle objectve optmzaton(sop) s dfferent. About ths, we can fnd the frst-rate soluton, whch s the mnmum or mamum value correspondng to the objectve functon. About the MOP, non-estent sngle optmum soluton [] because ths objectves are mutually conflctng. The resultng soluton s a set of compromse solutons, whch can not make the optmzaton on any object functon free from one other objectve functon at least. Ths soluton can be called a Pareto optmal soluton []. The tradtonal method to solve MOP needs a pror understandng about the problem such as transform nto a SOP. However such evolutonary based on operatng populaton may parallel seek multple soluton n the soluton space, and can use dfferent smlarty between the solutons to mprove the effcency of solvng, therefore ts very sutable for evolutonary computaton to solvng MOP. The typcal ntellgent optmzaton algorthm s partcle swarm optmzaton(pso) whch utlze the swarm teratve search. Advantage of ths algorthm are smple operaton and fast convergence. So the method whch applyng to solve mult-objectve problems has receved etensve attenton n academa [3]. At present, many scholars have proposed some mproved algorthms, such as Wckramasnghe [4] proposed a algorthm utlze the dstance measurement, no longer use Pareto domnance relaton to avod the problems caused by Pareto control. Brtto [5] proposed an mproved Content from ths work may be used under the terms of the Creatve Commons Attrbuton 3.0 lcence. Any further dstrbuton of ths work must mantan attrbuton to the author(s) and the ttle of the work, journal ctaton and DOI. Publshed under lcence by Ltd
3 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/0605 eternal fle mantenance strategy to ncrease the selecton pressure of swarm to solvng MOP.. The problem of Mult-objectve optmzaton The MOP mathematcally epress as follows: mn/ ma y { f( ), f( ),..., f g ( ) 0,,3,..., n n ( )} () The decson vector, The target vecton y The objectve functon, The constrant functon The followng defntons are gven: Defne : For any ponts n the space, for a certan pont y, f fy f always s true, call the Pareto optmal soluton. Defne : The sets consstng of all non-domnated optmal soluton can be called as non nferor optmum soluton set of MOP, the curve constructed by the soluton set s the Pareto optmal front. Defne 3: Let O be a collecton, the sze s m, each ndvdual has d attrbutes n O, the epresson s the evaluaton functon of the j attrbute of the frst I ndvdual, the relatonshps between ndvduals n the O can dvded nto the followng two: Domnance relaton: Any, y O arbtrary attrbute, there s and there s at least one property k, make, called the y s domnated by, s the domnant ndvdual, y s the domnated ndvdual. Non domnated relaton: f, y y, called and non domnant or rrelevant, the epress domnance relaton. Defne 4: For a gven ndvdual O, f there s no arbtrary y O, make y, and the s the non domnatng body. There s a collecton of non domnated ndvduals, can be called the non domnatng set [6]. 3. Related concepts of PSO About PSO, there are two concepts. One s the best soluton called pbest, the other one s the global soluton called gbest. In the PSO algorthm, f the partcle populaton sze as S, poston as (=,,...,S) partcle can epress as, the ndvdual etreme value s denoted as, The speed epress as v, global etremum s represented by. So the speed and poston [7] of the partcle wll update accordng to the followng formula: η, :learnng factor; rand, rand : random numbers on [0,]; w: nerta weght. () 4. A MOP based on reference ponts 4. related concepts of reference ponts In the target space, f the functon value s not bad for all the solutons, t becomes the global deal pont. As shown n (4): mn,,,, (3) When s the current populaton,,,, s the deal pont.
4 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/ The reference pont The reference pont n ths artcle s shown n fgure : Fgure. the generaton of reference ponts The partcle s sorted accordng to the crowdng dstance, optmzaton rules may be deleted accordng to the ndvdual domnated, then the target space s dvded nto equal spacng subspace, accordng to the dstrbuton of partcles and partcle crowdng dstance n the target space, respectvely, to fnd the mamum and the mnmum crowdng dstance values to generate the reference pont. Thus, n each subspace there are a number of unequal partcles, where there may be multple partcles n each unt nterval, and no partcles est. In the nterval of reference ponts, after clusterng, the center s taken as the fnal reference pont, and the reference pont s generated by usng remanng reference pont mappng at ntervals wthout reference ponts. 4.3 The ndvdual selecton based on reference ponts As mentoned earler, the evaluaton of partcles s based on the relatve poston between the partcle and the reference pont. In ths secton, ntroduce a method for calculatng the dstance between reference ponts and partcle. The Chebyshev dstance formula s used to calculate [8] : ma,,, (4) s Chebyshev dstance between reference ponts partcle and. And f domnates, s less than. About the PSO, we need select global optmum from fle to gude the populaton convergence, so the reference pont acts on the fle set. Algorthm flow: Step: ntalzaton, set the populaton, populaton number N and mamum teraton number ; set the fle. Step: adds the non domnated soluton of to form, let k k, updates the locaton of the partcles, and calculate the target functon values. Step3: compares n a populaton wth non domnated solutons n. If partcles domnate the old solutons n, or both do not domnate, the partcles are added to the, and the old solutons n the are deleted. Step4: sorts the soluton n accordng to crowdng dstance, and selects αn partcles wth large dstance. Step5: generates reference ponts accordng to solutons n, then connects all solutons to the correspondng reference ponts. Step6: calculates Chebyshev dstance between partcle and reference ponts, and chooses ndvdual wth small dstance as the fnal soluton. Step7: termnates the algorthm, and fnally outputs the non-domnated solutons n. 3
5 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/ Smulaton eperment and result analyss 5. The test functon and parameter settngs We use fve test functons to detect the performance. These functons are used n document [9], and are the most commonly used test functons for most mult-objectve evolutonary algorthms. Table. Test functons. Name Decson space ZDT 0, 30 ZDT 0, 30 ZDT3 0, 30 objectve functon mn f mn f g g g n mn f mn f g g g n mn f mn f g g sn 0 g g n Non nferorty optmal surface feature Conve Non conve Conve and dscontnuous ZDT4 0, and 5,5 9 n 0 0 cos 4 mn f mn f g g g n Non conve, locally optmal ZDT6 0, mn f ep sn 6 mn f g f g g n Non conve nhomogeneous 5. The algorthm performance evaluaton crtera Used followng two crtera to compare wth other algorthms and llustrate the performance[0]. For tested problem, t s assumed that the non domnated optmal target regon obtaned by the algorthm s z, and the theoretcally non domnated optmal target doman s z. ().The convergence, the convergence measure by the z and z wth the mnmum dstance between the average value, r mnz Z, z Z z zz The soluton wll close to the Pareto optmal soluton set when r s smaller. (). Measure by the type of dversty, 4
6 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/0605 d d f f d l d l Z d d ( Z ) d The better the optmal dversty when s smaller. 5.3 The epermental results and analyss The target number s 0, 50. The algorthm s run 0 tmes, each teraton of the 00 generaton and the dversty of the standard and the mnmum value n Table SPEA algorthm usng bnary encodng, run 0 tmes, each teraton of the 50 generaton results; NSGA s run 0 tmes, the 50 generaton teraton; tables and of ths algorthm s the mean, varance s below the last tme. Table. Convergence standard algorthms zdt zdt zdt3 zdt4 zdt6 SPEA NSGA Ths artcle E Table 3. Dversty standard algorthms zdt zdt zdt3 zdt4 zdt6 SPEA NSGA Ths artcle E E As can be seen from table, the convergence of the algorthm to the fve test functons s obvously better than that of SPEA, especally n ZDT, ZDT4 and ZDT6. For the NSGA algorthm, there are obvous advantages over ZDT3, ZDT4, and ZDT6, whle the other two functons are closer. Can be seen from table two, based on fve test functons than SPEA and NSGA n the soluton of dversty performance, look for SPEA n the functon of ZDT4 and ZDT6 have obvous advantages, for the NSGA algorthm n ZDT, ZDT, ZDT4 and ZDT6 have an obvous advantage n ZDT3 s close to. 6. Concluson Propose a mult-objectve optmzaton algorthm n vew of reference ponts. Accordng to a seres of ponts of reference eternal archve n the partcle space, accordng to relatve poston of the non domnated solutons, and select partcles wth better dversty and convergence as a reference pont to as global wzard, to gude the partcle to the true Pareto front unform convergence. In the eperment, we can see that although the algorthm needs to be mproved, the algorthm also ensures the convergence and dversty wth two benchmarks. Through eperment fve test functons and comparson wth other epermental results, the algorthm s llustrated. Acknowledgments Ths work was fnancally supported by the Natonal Nature Scence Fund of Chna(No ). 5
7 IOP Conf. Seres: Materals Scence and Engneerng (08) 0605 do:0.088/ x/3/6/0605 References [] Guoqang Deng,Zhangcan Hang, Objectve Optmzaton Algorthms and Performance metrcs[d], wuhan:wuhan Unversty of Technology, 007. [] C A Coello, A Comprehensve survey of evolutonary-based mult-objectve optmzaton, technques, Know ledge and Informaton Systems. (999) [3] Guang Lu, Desgn and Implementaton of the Port Schedulng System Based on the Mult-Objects PSO[D], Harbn:Harbn Engneerng Unversty. (008). [4] Wckramasnghe UK, Carrese R, L X, Desgnng arfols usng a reference pont based evolutonary many-objectve partcle swarm optmzaton algorthm[c], In Proceedngs of IEEE Congress on Evolutonary Computaton. IEEE. (00)-8. [5] Brtto A, Pozo A, Usng archvng methods to control convergence and dversty for many-objectve problems n partcle swarm optmzaton[c], In Proceedngs of IEEE Congress on Evolutonary Computaton, IEEE, (0) -8. [6] Guang Lu, Desgn and Implementaton of the Port Schedulng System Based on the Mult-Objects PSO[D], Harbn:Harbn Engneerng Unversty. (008). [7] Y S hand, R Eberhart, A modfed partcle swarm optmzer, IEEE Int' l Conf on Evolutonary Computaton, Anchorage, Alaska. (998). [8] K. Deb, J. Sundar, N, Udaya Bhaskara Rao, S, Chaudhur, Reference pont based mult-objectve optmzaton usng evolutonary algorthms, Internatonal Journal of Computatonal Intellgence Research (3) (006) [9] Ztzler E, Deb K, Thele L, Comparson of mult-objectve evolutonary algorthms: Emprcal results, Evolutonary Computaton. (000) [0] Deb K, Pratap A, Agarwal S, Meyarvan T, A fast and eltst mult-objectve genetc algorthm: NSGA, IEEE Transactons on Evolutonary Computaton. (00)
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 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 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 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 informationHYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE
Internatonal Journal of Fuzzy Logc Systems (IJFLS) Vol.2, No., February 22 HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Amt Saraswat and Ashsh San 2 Department
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAn Improved Clonal Algorithm in Multiobjective Optimization
976 JOURNAL OF SOFTWARE, VOL. 4, NO. 9, NOVEMBER 2009 An Improved Clonal Algorthm n Multobjectve Optmzaton Janyong Chen, Quzhen Ln and Qngbn Hu Department of Computer Scence and Technology, Shenzhen Unversty,
More informationMulti-agent system based on self-adaptive differential evolution for solving dynamic optimization problems
Mult-agent system based on self-adaptve dfferental evoluton for solvng dynamc optmzaton problems Aleš Čep Faculty of Electrcal Engneerng and Computer Scence Unversty of Marbor ales.cep@um.s ABSTRACT Ths
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 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 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 informationA Multi-Objective Gravitational Search Algorithm Based on Non-Dominated Sorting
32 Internatonal Journal of Swarm Intellgence Research, 3(3), 32-49, July-September 2012 A Mult-Obectve Gravtatonal Search Algorthm Based on Non-Domnated Sortng Had Nobahar, Sharf Unversty of Technology,
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 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 informationDEVELOPING NEW CHARGED SYSTEM SEARCH-BASED ALGORITHM: APPLICATION IN THE TIME-COST TRADE-OFF PROBLEMS
The Turksh Onlne Journal of Desgn, Art and Communcaton - TOJDAC August 06 Specal Edton DEVELOPING NEW CHARGED SYSTEM SEARCH-BASED ALGORITHM: APPLICATION IN THE TIME-COST TRADE-OFF PROBLEMS M.K. Sharbatdar
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 informationAn Improved Particle Swarm Optimization Algorithm based on Membrane Structure
IJCSI Internatonal Journal of Computer Scence Issues Vol. 10 Issue 1 No January 013 ISSN (Prnt): 1694-0784 ISSN (Onlne): 1694-0814 www.ijcsi.org 53 An Improved Partcle Swarm Optmzaton Algorthm based on
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
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 informationAn identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites
IOP Conference Seres: Materals Scence and Engneerng PAPER OPE ACCESS An dentfcaton algorthm of model knetc parameters of the nterfacal layer growth n fber compostes o cte ths artcle: V Zubov et al 216
More 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 informationNON-DOMINATED RANKED GENETIC ALGORITHM FOR SOLVING CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
NON-DOMINATED RANKED GENETIC ALGORITHM FOR SOLVING CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION PROBLEMS OMAR AL JADAAN, LAKSHMI RAJAMANI, 3 C. R. RAO Dept. CSE, EC. Osmana Unversty, Hyderabad 500-007, Inda.
More informationA Multi-modulus Blind Equalization Algorithm Based on Memetic Algorithm Guo Yecai 1, 2, a, Wu Xing 1, Zhang Miaoqing 1
Internatonal Conference on Materals Engneerng and Informaton Technology Applcatons (MEITA 1) A Mult-modulus Blnd Equalzaton Algorthm Based on Memetc Algorthm Guo Yeca 1,, a, Wu Xng 1, Zhang Maoqng 1 1
More informationAn Improved Clustering Based Genetic Algorithm for Solving Complex NP Problems
Journal of Computer Scence 7 (7): 1033-1037, 2011 ISSN 1549-3636 2011 Scence Publcatons An Improved Clusterng Based Genetc Algorthm for Solvng Complex NP Problems 1 R. Svaraj and 2 T. Ravchandran 1 Department
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 informationWavelet chaotic neural networks and their application to continuous function optimization
Vol., No.3, 04-09 (009) do:0.436/ns.009.307 Natural Scence Wavelet chaotc neural networks and ther applcaton to contnuous functon optmzaton Ja-Ha Zhang, Yao-Qun Xu College of Electrcal and Automatc Engneerng,
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
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 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 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 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 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 informationHIERARCHICAL RANK DENSITY GENETIC ALGORITHM FOR RADIAL-BASIS FUNCTION NEURAL NETWORK DESIGN
HIERARCHICAL RANK DEITY GENETIC ALGORITHM FOR RADIAL-BASIS FUNCTION NEURAL NETWORK DESIGN Gary G. Yen Hamng Lu Intellgent Systems and Control Laboratory School of Electrcal and Computer Engneerng Oklahoma
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 informationBayesian Planning of Hit-Miss Inspection Tests
Bayesan Plannng of Ht-Mss Inspecton Tests Yew-Meng Koh a and Wllam Q Meeker a a Center for Nondestructve Evaluaton, Department of Statstcs, Iowa State Unversty, Ames, Iowa 5000 Abstract Although some useful
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 informationMulti-objective optimization of water supply network rehabilitation
Proceedngs of the 2009 IEEE Internatonal Conference on Systems, Man, and Cybernetcs San Antono, TX, USA - October 2009 Mult-obectve optmzaton of water supply network rehabltaton Wenyan Wu Faculty of Computng,
More informationResearch Article Dynamic Environmental/Economic Scheduling for Microgrid Using Improved MOEA/D-M2M
Mathematcal Problems n Engneerng Volume 26, Artcle ID 26753, 4 pages http://dx.do.org/.55/26/26753 Research Artcle Dynamc Envronmental/Economc Schedulng for Mcrogrd Usng Improved MOEA/D-M2M Xn L and Yanjun
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 informationGlobal Optimization Using Hybrid Approach
Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw
More informationDesign of College Discrete Mathematics Based on Particle Swarm Optimization. Jiedong Chen1, a
4th Internatonal Conference on Mechatroncs, Materals, Chemstry and Computer Engneerng (ICMMCCE 205) Desgn of College Dscrete Mathematcs Based on Partcle Swarm Optmzaton Jedong Chen, a Automotve Department,
More informationThe optimal solution prediction for genetic and distribution building algorithms with binary representation
IOP Conference Seres: Materals Scence and Engneerng OPEN ACCESS The optmal soluton predcton for genetc and dstrbuton buldng algorthms wth bnary representaton To cte ths artcle: E Sopov and O Semenkna 05
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 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 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 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 informationRegular paper. New Approach to Solve Multiobjective. Economic Dispatch
Tawfk Guesm Hsan Hadj Abdallah Ahmed Toum Sfax Natonal Engneerng School, Electrcal Department. BP W, 3038 Sfax-Tunsa. gg_tawfk@yahoo.fr J. Electrcal Systems - (006): 64-8 Regular paper New Approach to
More informationA Novel Hybrid Bat Algorithm for the Multilevel Thresholding Medical Image Segmentation
RESEARCH ARTICLE Copyrght 2015 Amercan Scentfc Publshers All rghts reserved Prnted n the Unted States of Amerca Journal of Medcal Imagng and Health Informatcs Vol. 5, 1 5, 2015 A Novel Hybrd Bat Algorthm
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 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 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 informationV is the velocity of the i th
Proceedngs of the 007 IEEE Swarm Intellgence Symposum (SIS 007) Probablstcally rven Partcle Swarms for Optmzaton of Mult Valued screte Problems : esgn and Analyss Kalyan Veeramachanen, Lsa Osadcw, Ganapath
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 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 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 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 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 Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
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 informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
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 informationMulti-objective optimization in service systems
Mult-objectve optmzaton n servce systems Tad Gonsalves, Ke Yamagsh, Kyosh Itoh Department of Informaton and Communcaton Scences Faculty of Scence & Technology Sopha Unversty, 7-1 Kocho Chyoda-ku, Tokyo,
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 informationResearch Article A New Manufacturing Service Selection and Composition Method Using Improved Flower Pollination Algorithm
Mathematcal Problems n Engneerng Volume 2016, Artcle ID 7343794, 12 pages http://dx.do.org/10.1155/2016/7343794 Research Artcle A New Manufacturng Servce Selecton and Composton Method Usng Improved Flower
More informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
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 informationMicrowave Diversity Imaging Compression Using Bioinspired
Mcrowave Dversty Imagng Compresson Usng Bonspred Neural Networks Youwe Yuan 1, Yong L 1, Wele Xu 1, Janghong Yu * 1 School of Computer Scence and Technology, Hangzhou Danz Unversty, Hangzhou, Zhejang,
More informationAn Extended Hybrid Genetic Algorithm for Exploring a Large Search Space
2nd Internatonal Conference on Autonomous Robots and Agents Abstract An Extended Hybrd Genetc Algorthm for Explorng a Large Search Space Hong Zhang and Masum Ishkawa Graduate School of L.S.S.E., Kyushu
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 informationCoke Ratio Prediction Based on Immune Particle Swarm Neural Networks
Send Orders for Reprnts to reprnts@benthamscence.ae 576 The Open Cybernetcs & Systemcs Journal, 05, 9, 576-58 Open Access Coke Rato Predcton Based on Immune Partcle Swarm Neural Networks Yang Ka,,*, Jn
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 informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationSolving Design of Pressure Vessel Engineering Problem Using a Fruit Fly Optimization Algorithm
Solvng Desgn of Pressure Vessel Engneerng Problem Usng a Frut Fly Optmzaton Algorthm Xantng Ke, Yongsen Zhang, Yuchuan L,, * and Tngsong Du College of Scence, Chna Three Gorges Unversty, Ychang 44300,
More informationA DNA Coding Scheme for Searching Stable Solutions
A DNA odng Scheme for Searchng Stable Solutons Intaek Km, HeSong Lan, and Hwan Il Kang 2 Department of ommuncaton Eng., Myongj Unversty, 449-728, Yongn, South Korea kt@mju.ac.kr, hslan@hotmal.net 2 Department
More informationROUGH SESTS-INSPIRED EVOLUTIONARY ALGORITHM FOR ENGINEERING MULTIOBJECTIVE OPTIMIZATION PROBLEMS
Volume 1, No. 1, December 013 Journal of Global Research n Mathematcal Archves RESEARCH PAPER Avalable onlne at http://www.jgrma.nfo ROUGH SESTS-INSPIRED EVOLUTIONARY ALGORITHM FOR ENGINEERING MULTIOBJECTIVE
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 informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More information(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate
Internatonal Journal of Mathematcs and Systems Scence (018) Volume 1 do:10.494/jmss.v1.815 (Onlne Frst)A Lattce Boltzmann Scheme for Dffuson Equaton n Sphercal Coordnate Debabrata Datta 1 *, T K Pal 1
More informationA Study on Improved Cockroach Swarm Optimization Algorithm
A Study on Improved Cockroach Swarm Optmzaton Algorthm 1 epartment of Computer Scence and Engneerng, Huaan Vocatonal College of Informaton Technology,Huaan 223003, Chna College of Computer and Informaton,
More informationAnalytics on Fireworks Algorithm Solving Problems with. Shift in Decision Space and Objective Space
Analytcs on Frewors Algorthm Solvng Problems wth Sht n ecson Space and Objectve Space Sh Cheng, Unversty o Nottngham Nngbo Chna Quande Qn, Shenzhen Unversty, Chna Yuhu Sh, X'an Jaotong-Lverpool Unversty,
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
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 information