Optimization of Mechanical Design Problems Using Improved Differential Evolution Algorithm
|
|
- Julian Booth
- 5 years ago
- Views:
Transcription
1 International Journal of Recent Trends in Enineerin Vol. No. 5 May 009 Optimization of Mechanical Desin Problems Usin Improved Differential Evolution Alorithm Millie Pant Radha Thanaraj and V. P. Sinh Department of Paper Technoloy Indian Institute of Technoloy Roorkee India. millifpt@iitr.ernet.in t.radha@ieee.or sinhfpt@iitr.ernet.in Abstract Differential Evolution (DE) is a novel evolutionary approach capable of handlin nondifferentiable non-linear and multi-modal objective functions. DE has been consistently ranked as one of the best search alorithm for solvin lobal optimization problems in several case studies. This paper presents an Improved Constraint Differential Evolution (ICDE) alorithm for solvin constrained optimization problems. The proposed ICDE alorithm differs from unconstrained DE alorithm only in the place of initialization selection of particles to the net eneration and sortin the final results. Also we implemented the new idea to five versions of DE alorithm. The performance of ICDE alorithm is validated on four mechanical enineerin problems. The eperimental results show that the performance of ICDE alorithm in terms of final objective function value number of function evaluations and converence time. Inde Terms Differential Evolution optimization Mechanical desin problems constraint optimization. I. INTRODUCTION Many real-world optimization problems are solved subject to sets of constraints. The search space in COPs consists of two kinds of solutions: feasible and infeasible. Feasible points satisfy all the constraints while infeasible points violate at least one of them. Therefore the final solution of an optimization problem must satisfy all constraints. A constrained optimization problem may be distinuished as a Linear Prorammin Problem (LPP) and Nonlinear Prorammin Problem (NLP). In this paper we have considered NLP problems where either the objective function or the constraints or both are nonlinear in nature. The eneral NLP is iven by nonlinear objective function f which is to be minimized/maimized with respect to the desin variables =... ) and ( n the nonlinear inequality and equality constraints. This can be formulated by Minimize / Maimize f () : j ( ) 0 j =... p () h k ( ) = 0 k =... q () i min i i ma ( i =... n). where p and q are the number of inequality and equality constraints respectively. There are many traditional methods in the literature for solvin NLP. However most of the traditional methods require certain auiliary properties (like conveity continuity etc.) of the problem and also most of the traditional techniques are suitable for only a particular type of problem (for eample Quadratic Prorammin Problems Geometric Prorammin Problems etc). Keepin in view the limitations of traditional techniques researchers have proposed the use of stochastic optimization methods and intellient alorithms for solvin NLP which may be constrained or unconstrained. Some eamples are: Genetic Alorithms [] [] Ant Colony Optimization [4] Chaos Optimization Alorithm [5] Particle Swarm Optimization [6] Differential Evolution [7] etcetera. Based on the research efforts in literature constraint handlin methods have been cateorized in a number of classes [8] - [0]: Reject infeasible solutions Penalty function methods Convert the constrained problem to an unconstrained problem Preservin feasibility methods Pareto rankin methods Repair methods In the present research paper we have concentrated our work to DE which is comparatively a newer addition to the class of population based search techniques. DE is a stochastic population based search stratey developed by Storn and Price [7] in 995. It is a novel evolutionary approach capable of handlin no-differentiable nonlinear and multimodal objective functions. DE has been desined as a stochastic parallel direct search method which utilizes concepts borrowed from the broad class of EAs. The method typically requires few easily chosen control parameters. This paper presents an Improved Constraint Differential Evolution (ICDE) alorithm for solvin constrained optimization problems. The structure of the paper is as follows: in section II we have briefly eplained the Differential Evolution Alorithm in section III; we have defined and eplained the proposed ICDE alorithm. Section IV deals with eperimental settins and test problems Section V ives the numerical results and discussion and finally the paper conclude with section VI. II. DIFFERENTIAL EVOLUTION ALGORITHM DE shares a common terminoloy of selection crossover and mutation operators with GA however it is the application of these operators that make DE different from GA. Whereas in GA crossover plays a sinificant 009 ACADEMY PUBLISHER
2 International Journal of Recent Trends in Enineerin Vol. No. 5 May 009 role it is the mutation operator which effects the workin of DE []. The workin of DE may be described as follows: Mutation: For a D-dimensional search space for each taret vector X i at the eneration its associated mutant vector is enerated via certain mutation stratey. The most frequently used mutation strateies implemented in the DE codes are listed below. DE/rand/(S): Vi = X r *( ) + F X r X r () DE/rand/ (S): Vi = X r *( ) *( ) + F X r X r + F X r4 X r5 (4) DE/best/ (S): Vi = Xbest + F *( X r ) X r (5) DE/best/ (S4): Vi = X best + F *( X r ) *( ) X r + F X r X r4 (6) DE/rand-to-best/ (S5): Vi = X r *( ) *( ) + F X best X r + F X r X r4 (7) where r r r r4 r5 {... NP} are randomly chosen inteers must be different from each other and also different from the runnin inde i. F (>0) is a scalin factor which controls the amplification of the difference vector. X best is the best individual vector with the best fitness value in the population at eneration. Crossover: In order to increase the diversity of the perturbed parameter vectors crossover is introduced []. The parent vector is mied with the mutated vector to produce a trial vector u ji + v ji + if ( rand j CR) or ( j = j u ji + = rand ) (8) ji if ( rand j > CR) and ( j jrand ) where j = D; rand [0] ; CR is the crossover constant takes values in the rane [0 ] and j rand (... D) is the randomly chosen inde. Selection: Selection is the step to choose the vector between the taret vector and the trial vector with the aim of creatin an individual for the net eneration. The simple flow of DE alorithm is iven in Fi. Initialize the population Calculate the fitness value for each particle Do For i = to number of particles Do mutation Crossover and Selection. Until stoppin criteria is reached. Fi Flow of DE alorithm III. PROPOSED ICDE ALGORITHM The proposed alorithm ICDE is a simple alorithm for solvin constraint optimization problems it is easy to implement. It differs from unconstrained optimization j alorithm only in the place of initialization selection of particles to the net eneration and sortin the final results. The proposed ICDE alorithm uses the mean zero standard deviation one normal distribution for initializin the population and uses the followin three selection criteria: After calculatin the trial vector (i) If the trial vector and the taret vector are feasible then select the best one (ii) If both the particles are infeasible then select the one havin smaller constraint violation (iii) If one is feasible and the other one is infeasible then select the feasible one. Also at the end of every iteration the particles are sorted by usin the three criteria: (a) Sort feasible solutions in front of infeasible solutions (b) Sort feasible solutions accordin to their fitness function values (c) Sort infeasible solutions accordin to their constraint violations. The computational steps of ICDE alorithm is iven below: Step Initialize the population usin normal distribution with mean zero and standard deviation one. Step Evaluate the objective function Calculate the constraint violation Step While stoppin criterion is not satisfied Do Step. Mutation Generate a mutated vector V i correspondin to the taret vector X i via one of the equations () to (7) Step. Crossover //Generate trial vector U i Select j rand { D} For j = to D If (rand(0) CR or j= j rand ) Then U i = V i Else U i = X i End if Step. Selection Set X i+ accordin to the three selection criteria Step.4 Sort the particles usin the three sortin rules Step.5 Go to net eneration Step 4 End while IV. EXPERIMENTAL SETTINGS AND TEST PROBLEMS In order to make a fair comparison of all versions of DE alorithms we fied the same seed for random number eneration so that the initial population is same for both the alorithms. The population size is taken as 009 ACADEMY PUBLISHER
3 International Journal of Recent Trends in Enineerin Vol. No. 5 May The crossover constant CR is set as 0.95 and the scalin factor F is set as 0.7. For each alorithm the stoppin criteria is to terminate the search process when one of the followin conditions is satisfied: () the maimum number of enerations is reached (assumed 0000 enerations) () f ma - f min < 0-4 where f is the value of objective function. A total of 0 runs for each eperimental settin were conducted. If the run satisfies the second stoppin condition then that run is called successful run. Also we implemented the new idea to five versions of DE alorithm. To check the efficiency of the proposed ICDE alorithm we have tested it on four optimization problems arisin commonly in the field of Mechanical enineerin. All the problems considered here are hihly non linear in nature and are subject to various constraints. The mathematical models of these problems may be iven as: A. Weiht Minimization of a Speed Reducer (WMSR) [] The mathematical model of this problem is Min f ) = ( ) (.508 ( ) ( ) ( ) A B Where A = [( ) ] B = 0. 6 A B Where A = [( ) ] B = B. Heat Echaner Network Desin (HEND) [4] The mathematical model is Minimize f ( ) = ( 4 + 6) ( ) ( 8 5 ) i 0000 ( i = ) 0 i 000 ( i = 4...8) Fi Heat Echaner Network Desin Problem C. Gas Transmission Compressor Desin (GTCD) [5] The mathematical model is 5 / / / 4 f ( ) = D. Optimal Desin of Industrial refrieration System (ODIRS) [6] The mathematical model is.664 f ( ) = i 5 i =... 4 V. EXPERIMENTAL RESULTS AND DISCUSSION Tables I IV ives the numerical results iven four real life constrained optimization problems. These problems occur frequently in the field of mechanical desins. The comparison criteria for the alorithms is done in terms of best averae and worst fitness function values NFE std SR and time. For all the alorithms NFE represents the number of function evaluations which helps in determinin the converence of the alorithm. Lesser value of NFE implies faster ACADEMY PUBLISHER
4 International Journal of Recent Trends in Enineerin Vol. No. 5 May 009 converence. std represents the standard deviation which tells the stability of the alorithms. Smaller std implies that the alorithm is more stable. SR represents the success rate which sinifies the efficiency of an alorithm. It tells us how many times the alorithm was able to convere successfully within % of the true lobal optima. For all the problems we compared our results with those available in literature. Form Tables I to IV the results obtained by the different DE versions and the ones available in literature are iven. From the numerical results it is quite visible that the versions of DE ave better results than the ones available in literature. In terms of best averae and worst fitness function values all the alorithms ave more or less similar results. However in terms of NFE SR and time taken the alorithms showed different behavior. TABLE I COMPARISON RESULTS OF WMSR TABLE II COMPARISON RESULTS OF HEND TABLE III COMPARISON RESULTS OF GTCD TABLE IV COMPARISON RESULTS OF ODIRS Item DE/rand/ DE/rand/ DE/best/ DE/best/ DE/randto-best/ Result in [] Best Averae NA- Worst NA- Std.56e-05.84e NA- NFE NA- SR 00% 00% 00% 00% 00% -NA- Time (sec) NA- Item DE/rand/ DE/rand/ DE/best/ DE/best/ DE/randto-best/ Result in [4] Best Averae NA- Worst NA- Std 6.7e-05.e e-05.45e-05 -NA- NFE SR 00% 00% 96% 00% 00% 88% Time (sec) Item DE/rand/ DE/rand/ DE/best/ DE/best/ DE/rand-tobest/ Result in [5] Best.96e+06.96e+06.96e+06.96e+06.96e+06.99e+06 Averae.96e+06.96e+06.96e+06.96e+06.96e+06 -NA- Worst.96e+06.96e+06.96e+06.96e+06.96e+06 -NA- Std 8.79e e-06.7 e e e-06 -NA- NFE NA- SR 00% 00% 00% 00% 00% -NA- Time (sec) NA- Item DE/rand/ DE/rand/ DE/best/ DE/best/ DE/randto-best/ Result in [6] Best Averae NA- Worst NA- Std 7.8e NA- NFE NA- SR 00% 0% 96% 0% 0% -NA- Time (sec) NA ACADEMY PUBLISHER
5 International Journal of Recent Trends in Enineerin Vol. No. 5 May 009 The first problem is involves the desin of a speed reducer for small aircraft enine. It has a nonlinear objective function and it consists of eleven inequality constraints and seven unknown variables. For this problem all the DE versions ave same results in terms of best worst and averae fitness function values. If we compare the NFC and converence time then DE/rand-tobest/ is better than all other versions. The second problem addresses the desin of a heat echaner network as shown in Fi. It has three equality constraints three inequality constraints and eiht decision variables. For this problem also all the alorithms ave same result in comparison best fitness function value. In comparison of averae fitness value DE/best/ ave slihtly worse value than other alorithms. But in terms of converence time it is better than all other versions. The third problem is a as transmission compressor desin problem. For this problem DE/best/ ave better result in terms of standard deviation NFE and converence time. DE/rand/ ave better result than other alorithms in terms of best fitness function value. VI CONCLUSION In this paper we proposed an Improved DE alorithm called ICDE for solvin constrained optimization problems. ICDE differs from the basic DE in the initialization selection and sortin phases. These modifications are embedded on various versions of DE and their efficiency is validated on a set of four real life enineerin desin problems occurrin frequently in the field of mechanical enineerin. We would like to add that in the present article thouh we have considered only four problems the preliminary numerical results obtained show that the proposed modifications are beneficial for solvin constrained optimization problems effectively. Moreover this is a eneral technique/ modification and can be applied to any population based search technique like Genetic Alorithms Particle Swarm Optimization etc. REFERENCES [] Y. Li M.Gen Non-linear mied inteer prorammin problems usin enetic alorithm and penalty function In Proc. of IEEE Int. Conf. on SMC pp [] Y. Takao M. Gen T. Takeaki Y. Li A method for interval 0- number non-linear prorammin problems usin enetic alorithm Computers and Industrial Enineerin Vol. 9 pp [] J. F. Tan D.Wan et al. A hybrid enetic alorithm for a type of nonlinear prorammin problem Computer Math. Applic Vol. 6(5) pp [4] M. Dorio V. Maniezzo A. Colori Ant system optimization by a colony of cooperatin aents IEEE Trans. on system Man and Cybernetics Vol. 6() pp [5] Z. L. Wan L. Qiu L. Function C. Lian Application of chaos optimization alorithm to nonlinear constrained prorammin Journal of North China Institute of Water Conservancy and Hydroelectric Power Vol. () pp [6] J. Kennedy and R. Eberhart Particle Swarm Optimization IEEE International Conference on Neural Networks (Perth Australia) IEEE Service Center Piscataway NJ IV pp [7] R. Storn and K. Price Differential Evolution a simple and efficient adaptive scheme for lobal optimization over continuous spaces Technical Report International Computer Science Institute Berkley 995. [8] G. Coath S. K. Halamue A Comparison of Constraint- Handlin Methods for the Application of Particle Swarm Optimization to Constrained Nonlinear Optimization Problems In Proc. of the IEEE Conress on Evolutionary Computation Vol. 4 pp [9] S. Koziel Z. Michalewicz Evolutionary Alorithms Homomorphus Mappins and Constrained Optimization Evolutionary Computation Vol. 7() pp [0] Z. Michalewicz A Survey of Constraint Handlin Techniques in Evolutionary Computation Methods In Proc. of the Fourth Annual Conf. on Evolutionary Prorammin pp [] D. Karaboa and S. Okdem A simple and Global Optimization Alorithm for Enineerin Problems: Differential Evolution Alorithm Turk J. Elec. Enin. () 004 pp [] R. Storn and K. Price Differential Evolution a simple and efficient Heuristic for lobal optimization over continuous spaces Journal Global Optimization. 997 pp [] Floudas C.A. Pardalos P.M. A collection of test problems for constrained lobal optimization alorithms LNCS. Spriner Germany 990. [4] B. V. Babu and R. Anira Optimization of Industrial Processes Usin Improved and Modified Differential Evolution Studies in Fuzziness and Soft Computin Vol pp.. [5] Beihtler C. S and Phillips D. T Applied Geometric Prorammin Jhon Wiley & Sons New York 976. [6] Paul H and Tay Optimal Desin of an Industrial Refrieration System In Proc. of Int. Conf. on Optimization Techniques and Applications 987 pp ACADEMY PUBLISHER
Simple Optimization (SOPT) for Nonlinear Constrained Optimization Problem
(ISSN 4-6) Journal of Science & Enineerin Education (ISSN 4-6) Vol.,, Pae-3-39, Year-7 Simple Optimization (SOPT) for Nonlinear Constrained Optimization Vivek Kumar Chouhan *, Joji Thomas **, S. S. Mahapatra
More informationBespoke Shuffled Frog Leaping Algorithm and its Engineering Applications
I.J. Intellient Systems and Applications, 5,, - Published Online March 5 in MECS (http://www.mecs-press.or/ DOI:.585/ijisa.5.. Bespoke Shuffled Fro Leapin Alorithm and its Enineerin Applications Anura
More informationMulti-objective Emission constrained Economic Power Dispatch Using Differential Evolution Algorithm
Multi-objective Emission constrained Economic Power Dispatch Using Differential Evolution Algorithm Sunil Kumar Soni, Vijay Bhuria Abstract The main aim of power utilities is to provide high quality power
More informationEmotional Optimized Design of Electro-hydraulic Actuators
Sensors & Transducers, Vol. 77, Issue 8, Auust, pp. 9-9 Sensors & Transducers by IFSA Publishin, S. L. http://www.sensorsportal.com Emotional Optimized Desin of Electro-hydraulic Actuators Shi Boqian,
More informationInvestigation of Mutation Strategies in Differential Evolution for Solving Global Optimization Problems
Investigation of Mutation Strategies in Differential Evolution for Solving Global Optimization Problems Miguel Leon Ortiz and Ning Xiong Mälardalen University, Västerås, SWEDEN Abstract. Differential evolution
More informationMODIFIED PARTICLE SWARM OPTIMIZATION WITH TIME VARYING VELOCITY VECTOR. Received June 2010; revised October 2010
International Journal of Innovative Computing, Information and Control ICIC International c 2012 ISSN 1349-4198 Volume 8, Number 1(A), January 2012 pp. 201 218 MODIFIED PARTICLE SWARM OPTIMIZATION WITH
More informationDecomposition and Metaoptimization of Mutation Operator in Differential Evolution
Decomposition and Metaoptimization of Mutation Operator in Differential Evolution Karol Opara 1 and Jaros law Arabas 2 1 Systems Research Institute, Polish Academy of Sciences 2 Institute of Electronic
More informationSolving the Constrained Nonlinear Optimization based on Imperialist Competitive Algorithm. 1 Introduction
ISSN 1749-3889 (print), 1749-3897 (online) International Journal of Nonlinear Science Vol.15(2013) No.3,pp.212-219 Solving the Constrained Nonlinear Optimization based on Imperialist Competitive Algorithm
More informationOnline Supplement for. Engineering Optimization
Online Supplement for Constrained Optimization by Radial Basis Function Interpolation for High-Dimensional Expensive Black-Box Problems with Infeasible Initial Points Engineering Optimization Rommel G.
More informationEvolutionary Functional Link Interval Type-2 Fuzzy Neural System for Exchange Rate Prediction
Evolutionary Functional Link Interval Type-2 Fuzzy Neural System for Exchange Rate Prediction 3. Introduction Currency exchange rate is an important element in international finance. It is one of the chaotic,
More informationA Scalability Test for Accelerated DE Using Generalized Opposition-Based Learning
009 Ninth International Conference on Intelligent Systems Design and Applications A Scalability Test for Accelerated DE Using Generalized Opposition-Based Learning Hui Wang, Zhijian Wu, Shahryar Rahnamayan,
More informationMODULE - 2 LECTURE NOTES 3 LAGRANGE MULTIPLIERS AND KUHN-TUCKER CONDITIONS
Water Resources Systems Plannin and Manaement: Introduction to Optimization: arane Multipliers MODUE - ECTURE NOTES 3 AGRANGE MUTIPIERS AND KUHN-TUCKER CONDITIONS INTRODUCTION In the previous lecture the
More informationPerformance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems
Performance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems Saku Kukkonen, Student Member, IEEE and Jouni Lampinen Abstract This paper presents
More informationConstrained Optimization by the Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites
2006 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 6-2, 2006 Constrained Optimization by the Constrained Differential Evolution with Gradient-Based
More informationResearch Article A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems
Journal of Applied Mathematics Volume 2013, Article ID 757391, 18 pages http://dx.doi.org/10.1155/2013/757391 Research Article A Novel Differential Evolution Invasive Weed Optimization for Solving Nonlinear
More informationThree Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms
Three Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms Yong Wang and Zhi-Zhong Liu School of Information Science and Engineering Central South University ywang@csu.edu.cn
More informationThree Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms
Three Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms Yong Wang and Zhi-Zhong Liu School of Information Science and Engineering Central South University ywang@csu.edu.cn
More informationBeta Damping Quantum Behaved Particle Swarm Optimization
Beta Damping Quantum Behaved Particle Swarm Optimization Tarek M. Elbarbary, Hesham A. Hefny, Atef abel Moneim Institute of Statistical Studies and Research, Cairo University, Giza, Egypt tareqbarbary@yahoo.com,
More informationSolving Numerical Optimization Problems by Simulating Particle-Wave Duality and Social Information Sharing
International Conference on Artificial Intelligence (IC-AI), Las Vegas, USA, 2002: 1163-1169 Solving Numerical Optimization Problems by Simulating Particle-Wave Duality and Social Information Sharing Xiao-Feng
More information/07/$ IEEE
An Application of Interactive Fuzzy Satisficing Approach with Particle Swarm Optimization for Multiobjective Emergency Facility Location Problem with A-distance Takeshi Uno, Kosuke Kato, Hideki Katagiri
More informationMetaheuristics and Local Search
Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :
More informationConstrained Real-Parameter Optimization with Generalized Differential Evolution
2006 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 2006 Constrained Real-Parameter Optimization with Generalized Differential Evolution
More informationAn Adaptive Population Size Differential Evolution with Novel Mutation Strategy for Constrained Optimization
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 An Adaptive Population Size Differential Evolution with Novel Mutation Strategy for Constrained Optimization Yuan
More informationMetaheuristics and Local Search. Discrete optimization problems. Solution approaches
Discrete Mathematics for Bioinformatics WS 07/08, G. W. Klau, 31. Januar 2008, 11:55 1 Metaheuristics and Local Search Discrete optimization problems Variables x 1,...,x n. Variable domains D 1,...,D n,
More informationInteger weight training by differential evolution algorithms
Integer weight training by differential evolution algorithms V.P. Plagianakos, D.G. Sotiropoulos, and M.N. Vrahatis University of Patras, Department of Mathematics, GR-265 00, Patras, Greece. e-mail: vpp
More informationOptimization of Threshold for Energy Based Spectrum Sensing Using Differential Evolution
Wireless Engineering and Technology 011 130-134 doi:10.436/wet.011.3019 Published Online July 011 (http://www.scirp.org/journal/wet) Optimization of Threshold for Energy Based Spectrum Sensing Using Differential
More informationStability Analysis of Nonlinear Systems using Dynamic-Routh's Stability Criterion: A New Approach
Stability Analysis of Nonlinear Systems usin Dynamic-Routh's Stability Criterion: A New Approach Bast Kumar Sahu, St. M., IEEE Centre for Industrial Electronics d Robotics National Institute of Technoloy
More informationEvolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution
Evolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution Michael G. Epitropakis, Member, IEEE, Vassilis P. Plagianakos and Michael N. Vrahatis Abstract In
More informationQuantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 31, 1757-1773 (2015) Quantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem DJAAFAR ZOUACHE 1 AND ABDELOUAHAB MOUSSAOUI
More informationGeneralization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Tadahiko Murata 1, Shiori Kaige 2, and Hisao Ishibuchi 2 1 Department of Informatics, Kansai University 2-1-1 Ryozenji-cho,
More informationPopulation Variance Based Empirical Analysis of. the Behavior of Differential Evolution Variants
Applied Mathematical Sciences, Vol. 9, 2015, no. 66, 3249-3263 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.54312 Population Variance Based Empirical Analysis of the Behavior of Differential
More informationResearch Article A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution
Mathematical Problems in Engineering Volume 2015, Article ID 769245, 16 pages http://dx.doi.org/10.1155/2015/769245 Research Article A Hybrid Backtracking Search Optimization Algorithm with Differential
More informationStochastic learning feedback hybrid automata for dynamic power management in embedded systems
Electrical and Computer Enineerin Faculty Publications Electrical & Computer Enineerin 2005 Stochastic learnin feedback hybrid automata for dynamic power manaement in embedded systems T. Erbes Eurecom
More informationMulti-objective approaches in a single-objective optimization environment
Multi-objective approaches in a single-objective optimization environment Shinya Watanabe College of Information Science & Engineering, Ritsumeikan Univ. -- Nojihigashi, Kusatsu Shiga 55-8577, Japan sin@sys.ci.ritsumei.ac.jp
More informationHybrid particle swarm algorithm for solving nonlinear constraint. optimization problem [5].
Hybrid particle swarm algorithm for solving nonlinear constraint optimization problems BINGQIN QIAO, XIAOMING CHANG Computers and Software College Taiyuan University of Technology Department of Economic
More informationStochastic programming decision for inland container liner route stowage planning with uncertain container weight
Stochastic prorammin decision for inland container liner route stowae plannin with uncertain container weiht Jun Li a, Yu Zhan a*, Sanyou Ji a, Jie Ma b a School of Loistics Enineerin, Wuhan University
More informationNonlinear Model Reduction of Differential Algebraic Equation (DAE) Systems
Nonlinear Model Reduction of Differential Alebraic Equation DAE Systems Chuili Sun and Jueren Hahn Department of Chemical Enineerin eas A&M University Collee Station X 77843-3 hahn@tamu.edu repared for
More informationDifferential Evolution: a stochastic nonlinear optimization algorithm by Storn and Price, 1996
Differential Evolution: a stochastic nonlinear optimization algorithm by Storn and Price, 1996 Presented by David Craft September 15, 2003 This presentation is based on: Storn, Rainer, and Kenneth Price
More informationA COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION Vu Truong Vu Ho Chi Minh City University of Transport, Faculty of Civil Engineering No.2, D3 Street, Ward 25, Binh Thanh District,
More informationA COMPARATIVE STUDY ON OPTIMIZATION METHODS FOR THE CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS
A COMPARATIVE STUDY ON OPTIMIZATION METHODS FOR THE CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS OZGUR YENIAY Received 2 August 2004 and in revised form 12 November 2004 Constrained nonlinear programming
More informationARTIFICIAL NEURAL NETWORK WITH HYBRID TAGUCHI-GENETIC ALGORITHM FOR NONLINEAR MIMO MODEL OF MACHINING PROCESSES
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1455 1475 ARTIFICIAL NEURAL NETWORK WITH HYBRID TAGUCHI-GENETIC
More informationDE/BBO: A Hybrid Differential Evolution with Biogeography-Based Optimization for Global Numerical Optimization
1 : A Hybrid Differential Evolution with Biogeography-Based Optimization for Global Numerical Optimization Wenyin Gong, Zhihua Cai, and Charles X. Ling, Senior Member, IEEE Abstract Differential Evolution
More informationDynamic Optimization using Self-Adaptive Differential Evolution
Dynamic Optimization using Self-Adaptive Differential Evolution IEEE Congress on Evolutionary Computation (IEEE CEC 2009), Trondheim, Norway, May 18-21, 2009 J. Brest, A. Zamuda, B. Bošković, M. S. Maučec,
More informationTHIS paper considers the general nonlinear programming
IEEE TRANSACTIONS ON SYSTEM, MAN, AND CYBERNETICS: PART C, VOL. X, NO. XX, MONTH 2004 (SMCC KE-09) 1 Search Biases in Constrained Evolutionary Optimization Thomas Philip Runarsson, Member, IEEE, and Xin
More informationTwo new spectral conjugate gradient algorithms based on Hestenes Stiefel
Research Article Two new spectral conjuate radient alorithms based on Hestenes Stiefel Journal of Alorithms & Computational Technoloy 207, Vol. (4) 345 352! The Author(s) 207 Reprints and permissions:
More informationMultiobjective Optimization of Cement-bonded Sand Mould System with Differential Evolution
DOI: 10.7763/IPEDR. 013. V63. 0 Multiobjective Optimization of Cement-bonded Sand Mould System with Differential Evolution T. Ganesan 1, I. Elamvazuthi, Ku Zilati Ku Shaari 3, and P. Vasant + 1, 3 Department
More informationConstraint-Handling in Evolutionary Algorithms. Czech Institute of Informatics, Robotics and Cybernetics CTU Prague
in Evolutionary Algorithms Jiří Kubaĺık Czech Institute of Informatics, Robotics and Cybernetics CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a0m33eoa/start pmotivation The general nonlinear programming
More informationRobust Multi-Objective Optimization in High Dimensional Spaces
Robust Multi-Objective Optimization in High Dimensional Spaces André Sülflow, Nicole Drechsler, and Rolf Drechsler Institute of Computer Science University of Bremen 28359 Bremen, Germany {suelflow,nd,drechsle}@informatik.uni-bremen.de
More informationRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
Iranian Journal of Fuzzy Systems Vol. 15, No. 2, (2018) pp. 109-131 109 RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
More informationIEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1 Intervention in Gene Reulatory Networks via a Stationary Mean-First-Passae-Time Control Policy Golnaz Vahedi, Student Member, IEEE, Babak Faryabi, Student
More information2 Differential Evolution and its Control Parameters
COMPETITIVE DIFFERENTIAL EVOLUTION AND GENETIC ALGORITHM IN GA-DS TOOLBOX J. Tvrdík University of Ostrava 1 Introduction The global optimization problem with box constrains is formed as follows: for a
More informationDifferential Evolution Based Particle Swarm Optimization
Differential Evolution Based Particle Swarm Optimization Mahamed G.H. Omran Department of Computer Science Gulf University of Science and Technology Kuwait mjomran@gmail.com Andries P. Engelbrecht Department
More informationAn Introduction to Differential Evolution. Kelly Fleetwood
An Introduction to Differential Evolution Kelly Fleetwood Synopsis Introduction Basic Algorithm Example Performance Applications The Basics of Differential Evolution Stochastic, population-based optimisation
More informationBlend of Local and Global Variant of PSO in ABC
Blend of Local and Global Variant of PSO in ABC Tarun Kumar Sharma School of Mathematics and Computer Applications Thapar University Patiala, India taruniitr@gmail.com Millie Pant Department of Applied
More informationWeight minimization of trusses with natural frequency constraints
th World Congress on Structural and Multidisciplinary Optimisation 0 th -2 th, June 20, Sydney Australia Weight minimization of trusses with natural frequency constraints Vu Truong Vu Ho Chi Minh City
More informationLinearized optimal power flow
Linearized optimal power flow. Some introductory comments The advantae of the economic dispatch formulation to obtain minimum cost allocation of demand to the eneration units is that it is computationally
More informationThe Computational Complexity Analysis of a MINLP-Based Chemical Process Control Design
J.Oto.Ktrl.Inst (J.Auto.Ctrl.Inst Vol (, 00 ISSN : 085-57 Abstract The Computational Complexity Analysis of a MINLP-Based Chemical Process Control Desin E. Ekawati, S. Yuliar Center for Instrumentation
More informationBinary Particle Swarm Optimization with Crossover Operation for Discrete Optimization
Binary Particle Swarm Optimization with Crossover Operation for Discrete Optimization Deepak Singh Raipur Institute of Technology Raipur, India Vikas Singh ABV- Indian Institute of Information Technology
More informationAn artificial chemical reaction optimization algorithm for. multiple-choice; knapsack problem.
An artificial chemical reaction optimization algorithm for multiple-choice knapsack problem Tung Khac Truong 1,2, Kenli Li 1, Yuming Xu 1, Aijia Ouyang 1, and Xiaoyong Tang 1 1 College of Information Science
More informationDESIGN OF MULTILAYER MICROWAVE BROADBAND ABSORBERS USING CENTRAL FORCE OPTIMIZATION
Progress In Electromagnetics Research B, Vol. 26, 101 113, 2010 DESIGN OF MULTILAYER MICROWAVE BROADBAND ABSORBERS USING CENTRAL FORCE OPTIMIZATION M. J. Asi and N. I. Dib Department of Electrical Engineering
More informationOn the Usefulness of Infeasible Solutions in Evolutionary Search: A Theoretical Study
On the Usefulness of Infeasible Solutions in Evolutionary Search: A Theoretical Study Yang Yu, and Zhi-Hua Zhou, Senior Member, IEEE National Key Laboratory for Novel Software Technology Nanjing University,
More informationAdjustment of Sampling Locations in Rail-Geometry Datasets: Using Dynamic Programming and Nonlinear Filtering
Systems and Computers in Japan, Vol. 37, No. 1, 2006 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J87-D-II, No. 6, June 2004, pp. 1199 1207 Adjustment of Samplin Locations in Rail-Geometry
More informationJournal of American Science 2015;11(8) Solving of Ordinary differential equations with genetic programming
Journal of American Science 015;11(8) http://www.jofamericanscience.org Solving of Ordinary differential equations with genetic programming M.E. Wahed 1, Z.A. Abdelslam, O.M. Eldaken 1 Department of Computer
More informationGenetic Algorithm for Solving the Economic Load Dispatch
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 5 (2014), pp. 523-528 International Research Publication House http://www.irphouse.com Genetic Algorithm
More informationSecurity Constrained Optimal Power Flow
Security Constrained Optimal Power Flow 1. Introduction and notation Fiure 1 below compares te optimal power flow (OPF wit te security-constrained optimal power flow (SCOPF. Fi. 1 Some comments about tese
More informationANALYTIC CENTER CUTTING PLANE METHODS FOR VARIATIONAL INEQUALITIES OVER CONVEX BODIES
ANALYI ENER UING PLANE MEHODS OR VARIAIONAL INEQUALIIES OVER ONVE BODIES Renin Zen School of Mathematical Sciences honqin Normal Universit honqin hina ABSRA An analtic center cuttin plane method is an
More informationWORST CASE OPTIMIZATION USING CHEBYSHEV INEQUALITY
WORST CASE OPTIMIZATION USING CHEBYSHEV INEQUALITY Kiyoharu Tagawa School of Science and Engineering, Kindai University, Japan tagawa@info.kindai.ac.jp Abstract In real-world optimization problems, a wide
More informationA Constant Complexity Fair Scheduler with O(log N) Delay Guarantee
A Constant Complexity Fair Scheduler with O(lo N) Delay Guarantee Den Pan and Yuanyuan Yan 2 Deptment of Computer Science State University of New York at Stony Brook, Stony Brook, NY 79 denpan@cs.sunysb.edu
More informationFinding Multiple Global Optima Exploiting Differential Evolution s Niching Capability
Finding Multiple Global Optima Exploiting Differential Evolution s Niching Capability Michael G. Epitropakis Computational Intelligence Laboratory, Department of Mathematics, University of Patras, Greece.
More informationIntuitionistic Fuzzy Estimation of the Ant Methodology
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,
More informationB-Positive Particle Swarm Optimization (B.P.S.O)
Int. J. Com. Net. Tech. 1, No. 2, 95-102 (2013) 95 International Journal of Computing and Network Technology http://dx.doi.org/10.12785/ijcnt/010201 B-Positive Particle Swarm Optimization (B.P.S.O) Muhammad
More informationImproving Differential Evolution Algorithm by Synergizing Different Improvement Mechanisms
Improving Differential Evolution Algorithm by Synergizing Different Improvement Mechanisms M. ALI and M. PANT Indian Institute of Technology Roorkee, India AND A. ABRAHAM Machine Intelligence Research
More informationCONVERGENCE ANALYSIS OF DIFFERENTIAL EVOLUTION VARIANTS ON UNCONSTRAINED GLOBAL OPTIMIZATION FUNCTIONS
CONVERGENCE ANALYSIS OF DIFFERENTIAL EVOLUTION VARIANTS ON UNCONSTRAINED GLOBAL OPTIMIZATION FUNCTIONS G.Jeyakumar 1 C.Shanmugavelayutham 2 1, 2 Assistant Professor Department of Computer Science and Engineering
More informationThe 10 th international Energy Conference (IEC 2014)
The 10 th international Enery Conference (IEC 2014) Wind Turbine Interated Control durin Full Load Operation 1. Hamed Habibi and 2. Ahil Yousefi-Koma 1. MSc, Centre of Advanced Systems and Technoloies
More informationZebo Peng Embedded Systems Laboratory IDA, Linköping University
TDTS 01 Lecture 8 Optimization Heuristics for Synthesis Zebo Peng Embedded Systems Laboratory IDA, Linköping University Lecture 8 Optimization problems Heuristic techniques Simulated annealing Genetic
More informationPath Loss Prediction in Urban Environment Using Learning Machines and Dimensionality Reduction Techniques
Path Loss Prediction in Urban Environment Usin Learnin Machines and Dimensionality Reduction Techniques Mauro Piacentini Francesco Rinaldi Technical Report n. 11, 2009 Path Loss Prediction in Urban Environment
More informationRATE OPTIMIZATION FOR MASSIVE MIMO RELAY NETWORKS: A MINORIZATION-MAXIMIZATION APPROACH
RATE OPTIMIZATION FOR MASSIVE MIMO RELAY NETWORKS: A MINORIZATION-MAXIMIZATION APPROACH Mohammad Mahdi Nahsh, Mojtaba Soltanalian, Petre Stoica +, Maryam Masjedi, and Björn Ottersten Department of Electrical
More information10log(1/MSE) log(1/MSE)
IROVED MATRI PENCIL METHODS Biao Lu, Don Wei 2, Brian L Evans, and Alan C Bovik Dept of Electrical and Computer Enineerin The University of Texas at Austin, Austin, T 7872-84 fblu,bevans,bovik@eceutexasedu
More informationCongestion Management by integrating Distributed Generation using Cuckoo Search Algorithm
Conestion Manaement by interatin Distributed Generation usin Cuckoo Search Alorithm Subhasish Deb, Assistant Professor, Mizoram University, Aizawl, India. subhasishdeb30@yahoo.co.in Abstract - Power system
More informationApplying Linguistic Cognitive Map Method to Deal with Multiple Criteria Decision-making Problems
Journal of Economics and Manaement, 2018, Vol. 14, No. 2, 133-146 Applyin Linuistic Conitive Map Method to Deal with Multiple Criteria Decision-makin Problems Chen-Tun Chen Department of Information Manaement,
More informationResearch Article A Novel Ranking Method Based on Subjective Probability Theory for Evolutionary Multiobjective Optimization
Mathematical Problems in Engineering Volume 2011, Article ID 695087, 10 pages doi:10.1155/2011/695087 Research Article A Novel Ranking Method Based on Subjective Probability Theory for Evolutionary Multiobjective
More informationDifferential Evolution: Competitive Setting of Control Parameters
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 207 213 ISSN 1896-7094 c 2006 PIPS Differential Evolution: Competitive Setting of Control Parameters
More informationReactive Power and Voltage Control of Power Systems Using Modified PSO
J. Energy Power Sources Vol. 2, No. 5, 2015, pp. 182-188 Received: March 29, 2015, Published: May 30, 2015 Journal of Energy and Power Sources www.ethanpublishing.com Reactive Power and Voltage Control
More informationA Particle Swarm Optimization (PSO) Primer
A Particle Swarm Optimization (PSO) Primer With Applications Brian Birge Overview Introduction Theory Applications Computational Intelligence Summary Introduction Subset of Evolutionary Computation Genetic
More informationStrategies for Sustainable Development Planning of Savanna System Using Optimal Control Model
Strateies for Sustainable Development Plannin of Savanna System Usin Optimal Control Model Jiabao Guan Multimedia Environmental Simulation Laboratory School of Civil and Environmental Enineerin Georia
More informationApplication of GA and PSO Tuned Fuzzy Controller for AGC of Three Area Thermal- Thermal-Hydro Power System
International Journal of Computer Theory and Engineering, Vol. 2, No. 2 April, 2 793-82 Application of GA and PSO Tuned Fuzzy Controller for AGC of Three Area Thermal- Thermal-Hydro Power System S. K.
More informationANALYSIS OF CORRELATION BASED DIMENSION REDUCTION METHODS
Int. J. Appl. Math. Comput. Sci., 211, Vol. 21, No. 3, 549 558 DOI: 1.2478/v16-11-43-9 ANALYSIS OF CORRELATION BASED DIMENSION REDUCTION METHODS YONG JOON SHIN, CHEONG HEE PARK Department of Computer Science
More informationUsefulness of infeasible solutions in evolutionary search: an empirical and mathematical study
Edith Cowan University Research Online ECU Publications 13 13 Usefulness of infeasible solutions in evolutionary search: an empirical and mathematical study Lyndon While Philip Hingston Edith Cowan University,
More informationQuad-trees: A Data Structure for Storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism
Quad-trees: A Data Structure for Storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism Sanaz Mostaghim 1 and Jürgen Teich 2 1 Electrical Engineering Department University of Paderborn,
More informationAn Improved Model of Ceramic Grinding Process and its Optimization by Adaptive Quantum inspired Evolutionary Algorithm
An Improved Model of Ceramic Grinding Process and its Optimization by Adaptive Quantum inspired Evolutionary Algorithm Ashish Mani University Science Instrumentation Centre Dayalbagh Educational Institute
More informationTHE SIGNAL ESTIMATOR LIMIT SETTING METHOD
' THE SIGNAL ESTIMATOR LIMIT SETTING METHOD Shan Jin, Peter McNamara Department of Physics, University of Wisconsin Madison, Madison, WI 53706 Abstract A new method of backround subtraction is presented
More informationA Performance Comparison Study with Information Criteria for MaxEnt Distributions
A Performance Comparison Study with nformation Criteria for MaxEnt Distributions Ozer OZDEMR and Aslı KAYA Abstract n statistical modelin, the beinnin problem that has to be solved is the parameter estimation
More informationDRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT --
Conditions for the Convergence of Evolutionary Algorithms Jun He and Xinghuo Yu 1 Abstract This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary
More informationGenetic Algorithm Approach to Nonlinear Blind Source Separation
Genetic Alorithm Approach to Nonlinear Blind Source Separation F. Roas, C.G. Puntonet, I.Roas, J. Ortea, A. Prieto Dept. of Computer Architecture and Technoloy, University of Granada. fernando@atc.ur.es,
More informationA Comparative Study of Differential Evolution, Particle Swarm Optimization, and Evolutionary Algorithms on Numerical Benchmark Problems
A Comparative Study of Differential Evolution, Particle Swarm Optimization, and Evolutionary Algorithms on Numerical Benchmark Problems Jakob Vesterstrøm BiRC - Bioinformatics Research Center University
More informationRunning time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem
Research Collection Working Paper Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem Author(s): Laumanns, Marco; Thiele, Lothar; Zitzler, Eckart;
More informationOPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION
OPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION Onah C. O. 1, Agber J. U. 2 and Ikule F. T. 3 1, 2, 3 Department of Electrical and Electronics
More informationDeterministic Algorithm Computing All Generators: Application in Cryptographic Systems Design
Int. J. Communications, Networ and System Sciences, 0, 5, 75-79 http://dx.doi.or/0.436/ijcns.0.5074 Published Online November 0 (http://www.scirp.or/journal/ijcns) Deterministic Alorithm Computin All Generators:
More informationBracketing an Optima in Univariate Optimization
Bracketing an Optima in Univariate Optimization Pritibhushan Sinha Quantitative Methods & Operations Management Area Indian Institute of Management Kozhikode Kozhikode 673570 Kerala India Email: pritibhushan.sinha@iimk.ac.in
More informationSelf-Adaptive Ant Colony System for the Traveling Salesman Problem
Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Self-Adaptive Ant Colony System for the Traveling Salesman Problem Wei-jie Yu, Xiao-min
More information