Modified Differential Evolution for Nonlinear Optimization Problems with Simple Bounds
|
|
- Coleen George
- 6 years ago
- Views:
Transcription
1 Modified Differential Evolution for Nonlinear Optimization Problems with Simple Bounds Md. Abul Kalam Azad a,, Edite M.G.P. Fernandes b a Assistant Researcher, b Professor Md. Abul Kalam Azad Algoritmi R&D Centre akazad@dps.uminho.pt URL: Department of Production and Systems School of Engineering, University of Minho, Portugal Presented By: May 2, 2009 M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
2 Outline of the Presentation 1 Introduction 2 Motivation 3 Differential Evolution 4 Modified Differential Evolution 5 Algorithm of Proposed Modified Differential Evolution 6 Experimental Results 7 Conclusions M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
3 Introduction CMS2009, May 1-3, 2009 Problems involving global optimization over continuous spaces are ubiquitous throughout the scientific community. The task is to optimize certain properties of a system by pertinently choosing its variables. The task of global optimization is to find a point where the objective function obtains its smallest value. Nonlinear optimization problems with simple bounds where min f(x) subject to x Ω, f : R n R with Ω = {x R n : lb j x j ub j, j = 1,...,n}, and lb, ub R n. (1) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
4 Introduction CMS2009, May 1-3, 2009 There exist many solution methods to solve (1). If the objective function is not differentiable or has no information about derivatives: Deterministic methods that guarantee to find a global optimum with a required accuracy: DIRECT, MCS, Pattern Search, Simplex Search, etc. Stochastic methods that find the global minimum only with high probability: GA, SA, PSO, DE, EM, etc. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
5 Motivation Differential Evolution (DE) is proposed by Storn and Price in DE is a population based heuristic approach. DE has only three parameters. DE has been shown to be very efficient. DE is applicable to derivative free nonlinear optimization problems. Proposed Method A modified differential evolution (mde) introducing self-adaptive parameters and the inversion operator for nonlinear optimization problems with simple bounds. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
6 Differential Evolution (DE) DE creates new candidate solutions by combining points of the same population. A candidate replaces a current solution only if it has better objective value. DE has three parameters: 1 Amplification factor of the difference vector F. 2 Crossover control parameter CR. 3 Population size NP. DE s operators 1 Mutation 2 Crossover 3 Selection M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
7 Outline of Differential Evolution Target Vector n- problem dimension, NP- population size. Target point is defined by x p,t = (x p1,t, x p2,t,...,x pn,t ) where t is the index of generation and p = 1, 2,...,NP. The target point at t = 1 is generated randomly with uniform distribution as x p,1 = lb + r (ub lb) (2) r U[0, 1]. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
8 Outline of Differential Evolution Mutation DE creates new points (mutant points) by adding the weighted difference between two points to a third point in a population. v p,t+1 = x r1,t +F(x r2,t x r3,t) (3) }{{}}{{} base differential Integer random numbers r 1, r 2, r 3 U{1, 2,...,NP} and r 1 r 2 r 3 p. F [0, 2] constant parameter which controls the amplification of the differential variation (x r2,t x r3,t). NP must be greater or equal to 4 M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
9 Outline of Differential Evolution Crossover [Trial Point] The mutant point s components are then mixed with the target point s components to yield the so-called trial point u p,t+1. { vpj,t+1 if (r u pj,t+1 = j CR) or j = z p, x pj,t if (r j > CR) and j z p j = 1, 2,...,n. (4) Random r j U[0, 1] which performs the mixing of jth component of points and CR [0, 1] is constant parameter. Random integer z p U{1, 2,...,n} which ensures that u p,t+1 gets at least one component from v p,t+1. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
10 Outline of Differential Evolution Bounds Check After crossover the bounds of each component must be checked. lb j if u pj,t+1 < lb j u pj,t+1 = ub j if u pj,t+1 > ub j otherwise u pj,t+1 (5) Selection The trial point u p,t+1 is compared to the target point x p,t to decide whether or not it should become a member of generation t + 1 as { up,t+1 if f(u x p,t+1 = p,t+1 ) f(x p,t ) otherwise. x p,t (6) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
11 Modified Differential Evolution According to Storn and Price, DE is sensitive to the choice of three control parameters. They suggested (i) F [0.5, 1]; (ii) CR [0.8, 1]; and (iii) NP = 10 n. Modification by Brest et al. Proposed self adaptive control parameters for F and CR. Point dependent parameters (F p,1, CR p,1 ), p = 1,...,NP. New control parameters for next generation F p,t+1 and CR p,t+1 are calculated as M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
12 Modification CMS2009, May 1-3, 2009 Modification by Brest et al. { Fl + λ F p,t+1 = 1 F u, if λ 2 < τ 1 F p,t, otherwise { λ3, if λ CR p,t+1 = 4 < τ 2 CR p,t, otherwise. (7) (8) Random λ U[0, 1] and τ 1 = τ 2 = 0.1 represent probabilities to adjust parameters F p and CR p, respectively. F l = 0.1 and F u = 1.0. So F p,t+1 [0.1, 1.0] and CR p,t+1 [0, 1]. F p,t+1 and CR p,t+1 are obtained before the mutation is performed. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
13 Modification CMS2009, May 1-3, 2009 Modification by Kaelo et al. Kaelo et al. proposed alternative technique for mutation. After choosing three points the best is selected for base point, Remaining two points are used as differential variation: v p,t+1 = x 1,t +F(x 2,t x 3,t ) }{{}}{{} base differential x 1,t = arg min{f(x r1,t), f(x r2,t), f(x r3,t)}. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
14 Our Modified Differential Evolution (mde) Our mde has previous modifications proposed by Kaelo et al. and Brest et al. We made small modification proposed by Kaelo et al. After every B generations we used best point found so far as the base point and two randomly chosen points in differential variation: v p,t+1 = x best,t +F(x r1,t x r2,t) }{{}}{{} base differential Inversion operator Our mde has inversion operator with some inversion probability (p inv [0, 1]) to points after crossover. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
15 Our Modified Differential Evolution (mde) Illustrative example of inversion: h k u p,t = u p1,t u p2,t u p3,t u p4,t u p5,t u p6,t u p7,t u p8,t h k u p,t = u p1,t u p2,t u p6,t u p5,t u p4,t u p3,t u p7,t u p8,t Termination condition t- current generation G max - maximum generations. The terminition condition is ((t > G max ) OR ( f max, t f min, t ɛ (= 10 6 ))). f max, t - max. function value f min, t - min. function value M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
16 Algorithm of Proposed Modified Differential Evolution 1 Set the values of parameters. 2 Set t = 1. Initialize the population x p, 1. 3 Calculate f max, 1 and f min, 1 and set f best = f min, 1 and x best = x min, 1. 4 If termination condition is met stop. Otherwise set t = t Compute mutant point v p, t by using mde. 6 Perform crossover by using mde to make point u p, t. 7 Perform inversion by using mde to make trial point u p, t. 8 Check the domains of the trial point. 9 Perform selection. If f p, t f p, t 1 then set x p, t = u p, t. Otherwise set f p, t = f p, t 1 and x p, t = x p, t Calculate f max, t and f min, t and set f best = f min, t and x best = x min, t. 11 Go to step 4. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
17 Experimental Results We coded all the variants of DE in C with AMPL interface. The name of the solvers are: DE Original mde[1] DE Kaelo mde[2] (with inversion) DE Brest We tested all the solvers on a set of 64 nonlinear optimization problems with simple bounds. We used same parameters for all solvers. We used same termination condition for all solvers. We run all solvers 30 times for each problem. After 30 runs we reported f best, f w, f avg, standard deviation of f, no. of function evaluations and no. of generations. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
18 Experimental Results Example Test Problems Ackley s Problem min x f(x) n n 20 exp 0.02 n 1 xj 2 exp n 1 cos(2πx j ) exp(1) j=1 j=1 subject to 30.0 x j 30.0, j = 1, 2,..., n. Griewank Problem min x f(x) n j=1 x 2 j ( ) n x j cos j j=1 subject to x j 600.0, j = 1, 2,...,n. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
19 Experimental Results Shekel 5 Problem 5 1 min f(x) x n i=1 j=1 (x j a ij ) 2 + c i subject to 0.0 x j 10.0, j = 1, 2,...,n. For the above 3 test problems for all solvers: Used same parameters. Used same termination condition. Plotted profile of objective function value at different generation. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
20 Experimental Results Ackley s Problem, n = 10, G max = 1000, f opt = 0.0 Profile of objective function value of ack after single run 2.5 DE_Original DE_Kaelo DE_Brest mde[1] mde[2] 2.0 Objective function value No. of generations M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
21 Experimental Results Griewank Problem, n = 10, G max = 1000, f opt = Profile of objective function value of gw after single run DE_Original DE_Kaelo DE_Brest mde[1] mde[2] Objective function value No. of generations M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
22 Experimental Results Shekel 5 Problem, n = 4, G max = 250, f opt = Profile of objective function value of s3 after single run DE_Original DE_Kaelo DE_Brest mde[1] mde[2] Objective function value No. of generations M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
23 Experimental Results Neumaier 3 Problem min x f(x) = n (x j 1) 2 j=1 n x j x j 1 j=2 subject to n 2 x j n 2, j = 1, 2,...,n. For above test problem for all solvers: Used n = 10, 20, 30, 40. Used same parameters. Used same termination condition. Run 30 times. Reported f best at every G max /50 generations and made average. Plotted profile of mean of best objective function value at every G max /50 generations. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
24 Experimental Results Neumaier 3 Problem, n = 10, G max = 500, f opt = Mean of best objective function value Profile of mean of best objective function value of nf3_10 after 30 runs 4500 DE_Original DE_Kaelo 4000 DE_Brest mde[1] 3500 mde[2] Mean of best objective function value Profile of mean of best objective function value of nf3_10 after 30 runs 3000 DE_Original DE_Kaelo DE_Brest 2500 mde[1] mde[2] No. of generations (a) No. of generations (b) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
25 Experimental Results Neumaier 3 Problem, n = 20, G max = 1500, f opt = Mean of best objective function value 16 x Profile of mean of best objective function value of nf3_20 after 30 runs 104 DE_Original DE_Kaelo 14 DE_Brest mde[1] mde[2] No. of generations (a) Mean of best objective function value x 10 4 Profile of mean of best objective function value of nf3_20 after 30 runs DE_Original DE_Kaelo DE_Brest mde[1] mde[2] No. of generations (b) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
26 Experimental Results Neumaier 3 Problem, n = 30, G max = 3000, f opt = Mean of best objective function value 12 x Profile of mean of best objective function value of nf3_30 after 30 runs 105 DE_Original DE_Kaelo DE_Brest 10 mde[1] mde[2] Mean of best objective function value 6 x 105 Profile of mean of best objective function value of nf3_30 after 30 runs DE_Original DE_Kaelo DE_Brest 5 mde[1] mde[2] No. of generations (a) No. of generations (b) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
27 Experimental Results Neumaier 3 Problem, n = 40, G max = 4000, f opt = Mean of best objective function value x 10 6 Profile of mean of best objective function value of nf3_40 after 30 runs DE_Original 6 DE_Kaelo DE_Brest mde[1] mde[2] Mean of best objective function value 3.5 x Profile of mean of best objective function value of nf3_40 after 30 runs 106 DE_Original DE_Kaelo DE_Brest 3 mde[1] mde[2] No. of generations (a) No. of generations (b) M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
28 Performance Profile CMS2009, May 1-3, 2009 Compared all solvers based on performance profile proposed by Dolan and Moré. P- set of all problems and S- set of all solvers. Performance metric found by solver s S on problem p P is m (p,s) = f (p,s) f opt f w f opt. f (p,s) - average/best function value after 30 runs. f opt - optimum value of problem p. f w - worst function value after 30 runs (for all solvers). m (p,s) = 0 if f (p,s) f opt 1 if f (p,s) = f w f (p,s) f opt f w f opt otherwise M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35 m f opt f w f
29 Performance Profile CMS2009, May 1-3, 2009 Since min{m (p,s) : s S} can be 0, the performance ratios are r (p,s) = 1 + m (p,s) min{m (p,s) : s S}, if min{m (p,s) : s S} < ɛ m (p,s) min{m (p,s) : s S}, otherwise for p P, s S and ɛ = The overall assessment of performance of a particular solver s ρ s (τ) = n P τ n P. n Pτ - number of problems in P with r (p,s) τ. n P - total number of problems in P. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
30 Performance Profile ρ s (τ) is the probability (for solver s S) that the performance ratio r (p,s) is within a factor τ R of the best possible ratio. The function ρ s is the cumulative distribution function for the performance ratio. The value of ρ s (1) gives the probability that the solver s will win over the others in the set. However, for large values of τ, the ρ s (τ) measures the solver robustness. The solver with largest ρ s (τ) is the one that solves more problems in the set P. We plotted performance profile based on f avg and f best after 30 runs for all problems with all solvers. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
31 Performance Profile CMS2009, May 1-3, 2009 performance profile based on f avg after 30 runs 1 Performance profile of f_avg after 30 runs ρ(τ) DE_Original 0.5 DE_Kaelo DE_Brest mde[1] mde[2] τ M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
32 Performance Profile CMS2009, May 1-3, 2009 performance profile based on f best after 30 runs 1.0 Performance profile of f_best after 30 runs 0.9 ρ(τ) DE_Original DE_Kaelo DE_Brest mde[1] mde[2] τ M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
33 Conclusions A modified differential evolution (mde) for nonlinear optimization problems with simple bounds is presented. A compartive study based on performance profile is presented. It is shown that our mde outperformed other variants of DE. Our mde wins over other DE based on robustness. For particular problem our mde also wins over other variants of DE. Future Study Now we are trying to implement our mde to general constrained nonlinear optimization problems and will consider mixed-integer problems in the future. M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
34 References CMS2009, May 1-3, 2009 [Ali2004] M.M. Ali and A. Törn, Population set based global optimization algorithms: Some modifications and numerical studies, Computer and Operration Research, vol. 31, no. 10, pp , [Ali2005] M.M. Ali, C. Khompatraporn and Z.B. Zabinsky, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems, Journal of Global Optimization, vol. 31, pp , [Boender1982] C.G.E. Boender, A.H.G. Rinnoy Kan, L. Stougie and G.T. Timmer, A Stochastic Method for Global Optimization, Mathematical Programming, vol. 22, pp , [Brest2006] J. Brest, S. Greiner, B. Bošković, M. Mernik and V. Žumer, Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems, IEEE Transactions on Evolutionary Computation, vol. 10. no. 6, pp , [Dolan2002] E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, series A 91, pp , [Kaelo2006] P. Kaelo and M.M. Ali, A numerical study of some modified differencial evolution algorithms, EJOR, vol. 169, pp , [Kim2007] H.-K. Kim, J.-K. Chong, K.-Y. Park and D.A. Lowther, Differential evolution strategy for constrained global optimization and application to practical engineering problems, IEEE Transactions on Magnetics, vol. 43, no. 4, pp , [Price1997] K. Price and R. Storn, Differential evolution - a simple evolution strategy for fast optimization, Dr. Dobb s Journal, vol. 22, no. 4, pp and 78, [Storn1997] R. Storn and K. Price, Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol. 11, pp , M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
35 Supported by under the grant C2007-UMINHO-ALGORITMI-04. and Thank You Very Much M. A. K. Azad (Algoritmi R&D Centre) University of Minho, Portugal May 2, / 35
Dynamic 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 informationAdaptive Differential Evolution and Exponential Crossover
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 927 931 ISBN 978-83-60810-14-9 ISSN 1896-7094 Adaptive Differential Evolution and Exponential Crossover
More informationCompetitive Self-adaptation in Evolutionary Algorithms
Competitive Self-adaptation in Evolutionary Algorithms Josef Tvrdík University of Ostrava josef.tvrdik@osu.cz Ivan Křivý University of Ostrava ivan.krivy@osu.cz Abstract Heuristic search for the global
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 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 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 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 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 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 informationTHE objective of global optimization is to find the
Large Scale Global Optimization Using Differential Evolution With Self-adaptation and Cooperative Co-evolution Aleš Zamuda, Student Member, IEEE, Janez Brest, Member, IEEE, Borko Bošković, Student Member,
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 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 informationOPTIMIZATION OF MODEL-FREE ADAPTIVE CONTROLLER USING DIFFERENTIAL EVOLUTION METHOD
ABCM Symposium Series in Mechatronics - Vol. 3 - pp.37-45 Copyright c 2008 by ABCM OPTIMIZATION OF MODEL-FREE ADAPTIVE CONTROLLER USING DIFFERENTIAL EVOLUTION METHOD Leandro dos Santos Coelho Industrial
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 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 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 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 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 informationA numerical study of some modified differential evolution algorithms
A numerical study of some modified differential evolution algorithms P. Kaelo and.. Ali School of Computational and Applied athematics, Witwatersrand University, Wits - 2050, Johannesburg Abstract odifications
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 informationMulti-start JADE with knowledge transfer for numerical optimization
Multi-start JADE with knowledge transfer for numerical optimization Fei Peng, Ke Tang,Guoliang Chen and Xin Yao Abstract JADE is a recent variant of Differential Evolution (DE) for numerical optimization,
More informationGradient-based Adaptive Stochastic Search
1 / 41 Gradient-based Adaptive Stochastic Search Enlu Zhou H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology November 5, 2014 Outline 2 / 41 1 Introduction
More informationA PARAMETER CONTROL SCHEME FOR DE INSPIRED BY ACO
A PARAMETER CONTROL SCHEME FOR DE INSPIRED BY ACO Dražen Bajer, Goran Martinović Faculty of Electrical Engineering, Josip Juraj Strossmayer University of Osijek, Croatia drazen.bajer@etfos.hr, goran.martinovic@etfos.hr
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 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 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 informationSolving Systems of Nonlinear Equations by Harmony Search
Proceedings of the 13th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2013 24 27 June, 2013. Solving Systems of Nonlinear Equations by Harmony Search
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 informationEgocentric Particle Swarm Optimization
Egocentric Particle Swarm Optimization Foundations of Evolutionary Computation Mandatory Project 1 Magnus Erik Hvass Pedersen (971055) February 2005, Daimi, University of Aarhus 1 Introduction The purpose
More informationCOMPETITIVE DIFFERENTIAL EVOLUTION
COMPETITIVE DIFFERENTIAL EVOLUTION Josef Tvrdík University of Ostrava, Department of Computer Science 30. dubna 22, 701 03 Ostrava, Czech Republic phone: +420/596160231, fax: +420/596120478 e-mail: tvrdik@osu.cz
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 informationDIFFERENTIAL EVOLUTION (DE) was proposed by
64 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 1, FEBRUARY 2008 Opposition-Based Differential Evolution Shahryar Rahnamayan, Member, IEEE, Hamid R. Tizhoosh, and Magdy M. A. Salama, Fellow,
More informationLearning Tetris. 1 Tetris. February 3, 2009
Learning Tetris Matt Zucker Andrew Maas February 3, 2009 1 Tetris The Tetris game has been used as a benchmark for Machine Learning tasks because its large state space (over 2 200 cell configurations are
More informationBenchmarking a Hybrid Multi Level Single Linkage Algorithm on the BBOB Noiseless Testbed
Benchmarking a Hyrid ulti Level Single Linkage Algorithm on the BBOB Noiseless Tested László Pál Sapientia - Hungarian University of Transylvania 00 iercurea-ciuc, Piata Liertatii, Nr., Romania pallaszlo@sapientia.siculorum.ro
More informationResearch Article Algorithmic Mechanism Design of Evolutionary Computation
Computational Intelligence and Neuroscience Volume 2015, Article ID 591954, 17 pages http://dx.doi.org/10.1155/2015/591954 Research Article Algorithmic Mechanism Design of Evolutionary Computation Yan
More informationOn the Pathological Behavior of Adaptive Differential Evolution on Hybrid Objective Functions
On the Pathological Behavior of Adaptive Differential Evolution on Hybrid Objective Functions ABSTRACT Ryoji Tanabe Graduate School of Arts and Sciences The University of Tokyo Tokyo, Japan rt.ryoji.tanabe@gmail.com
More informationx 2 i 10 cos(2πx i ). i=1
CHAPTER 2 Optimization Written Exercises 2.1 Consider the problem min, where = 4 + 4 x 2 i 1 cos(2πx i ). i=1 Note that is the Rastrigin function see Section C.1.11. a) What are the independent variables
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 informationARTIFICIAL NEURAL NETWORKS REGRESSION ON ENSEMBLE STRATEGIES IN DIFFERENTIAL EVOLUTION
ARTIFICIAL NEURAL NETWORKS REGRESSION ON ENSEMBLE STRATEGIES IN DIFFERENTIAL EVOLUTION Iztok Fister Jr. 1,Ponnuthurai Nagaratnam Suganthan 2, Damjan Strnad 1, Janez Brest 1,Iztok Fister 1 1 University
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 informationArtificial Intelligence Heuristic Search Methods
Artificial Intelligence Heuristic Search Methods Chung-Ang University, Jaesung Lee The original version of this content is created by School of Mathematics, University of Birmingham professor Sandor Zoltan
More informationBenchmarking Derivative-Free Optimization Algorithms
ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 Benchmarking Derivative-Free Optimization Algorithms Jorge J. Moré and Stefan M. Wild Mathematics and Computer Science Division
More informationECONOMETRIC INSTITUTE THE COMPLEXITY OF THE CONSTRAINED GRADIENT METHOD FOR LINEAR PROGRAMMING J. TELGEN REPORT 8005/0
ECONOMETRIC INSTITUTE THE COMPLEXITY OF THE CONSTRAINED GRADIENT METHOD FOR LINEAR PROGRAMMING ffaciundation OF AGRICULTIlt.E,C"..'NOMICE; 1LT- S E P 3 1/880 J. TELGEN REPORT 8005/0 ERASMUS UNIVERSITY
More informationHybrid Evolutionary and Annealing Algorithms for Nonlinear Discrete Constrained Optimization 1. Abstract. 1 Introduction
Hybrid Evolutionary and Annealing Algorithms for Nonlinear Discrete Constrained Optimization 1 Benjamin W. Wah and Yixin Chen Department of Electrical and Computer Engineering and the Coordinated Science
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 informationResearch Article A Convergent Differential Evolution Algorithm with Hidden Adaptation Selection for Engineering Optimization
Mathematical Problems in Engineering, Article ID 135652, 11 pages http://dx.doi.org/10.1155/2014/135652 Research Article A Convergent Differential Evolution Algorithm with Hidden Adaptation Selection for
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 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 informationGENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS
GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an
More informationParticle Swarm Optimization. Abhishek Roy Friday Group Meeting Date:
Particle Swarm Optimization Abhishek Roy Friday Group Meeting Date: 05.25.2016 Cooperation example Basic Idea PSO is a robust stochastic optimization technique based on the movement and intelligence of
More informationA multistart multisplit direct search methodology for global optimization
1/69 A multistart multisplit direct search methodology for global optimization Ismael Vaz (Univ. Minho) Luis Nunes Vicente (Univ. Coimbra) IPAM, Optimization and Optimal Control for Complex Energy and
More informationSegment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks
Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel
More informationStopping Rules for Box-Constrained Stochastic Global Optimization
Stopping Rules for Box-Constrained Stochastic Global Optimization I. E. Lagaris and I. G. Tsoulos Department of Computer Science, University of Ioannina P.O.Box 1186, Ioannina 45110 GREECE Abstract We
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 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 informationPageRank Method for Benchmarking Computational Problems and their Solvers
www.ici.org https://doi.org/10.5281/zenodo.1292395 1 agerank Method for Benchmarking Computational roblems and their olvers oseph Gogodze Institute of Control ystem, Georgian Technical University, Tbilisi,
More informationChapter 8: Introduction to Evolutionary Computation
Computational Intelligence: Second Edition Contents Some Theories about Evolution Evolution is an optimization process: the aim is to improve the ability of an organism to survive in dynamically changing
More informationAn Improved Differential Evolution Trained Neural Network Scheme for Nonlinear System Identification
International Journal of Automation and Computing 6(2), May 2009, 137-144 DOI: 10.1007/s11633-009-0137-0 An Improved Differential Evolution Trained Neural Network Scheme for Nonlinear System Identification
More informationParticle swarm optimization approach to portfolio optimization
Nonlinear Analysis: Real World Applications 10 (2009) 2396 2406 Contents lists available at ScienceDirect Nonlinear Analysis: Real World Applications journal homepage: www.elsevier.com/locate/nonrwa Particle
More informationOptimization Models and Applications
Optimization Models and Applications Martin Takáč ISE 316, Fall 2014, Lecture 1 September 3, 2014 Martin Takáč ISE 316 Fall 2014 1 / 33 Outline Course Information Example of an Optimization Problem Terminology
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process
Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard 1/30 Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard (USC) Joint work
More information3D HP Protein Folding Problem using Ant Algorithm
3D HP Protein Folding Problem using Ant Algorithm Fidanova S. Institute of Parallel Processing BAS 25A Acad. G. Bonchev Str., 1113 Sofia, Bulgaria Phone: +359 2 979 66 42 E-mail: stefka@parallel.bas.bg
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 informationDIFFERENTIAL evolution (DE) [3] has become a popular
Self-adative Differential Evolution with Neighborhood Search Zhenyu Yang, Ke Tang and Xin Yao Abstract In this aer we investigate several self-adative mechanisms to imrove our revious work on [], which
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 informationPermutation distance measures for memetic algorithms with population management
MIC2005: The Sixth Metaheuristics International Conference??-1 Permutation distance measures for memetic algorithms with population management Marc Sevaux Kenneth Sörensen University of Valenciennes, CNRS,
More informationAnt Colony Optimization: an introduction. Daniel Chivilikhin
Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling
More informationKey words. Global optimization, multistart strategies, direct-search methods, pattern search methods, nonsmooth calculus.
GLODS: GLOBAL AND LOCAL OPTIMIZATION USING DIRECT SEARCH A. L. CUSTÓDIO AND J. F. A. MADEIRA Abstract. Locating and identifying points as global minimizers is, in general, a hard and timeconsuming task.
More informationFractional Filters: An Optimization Approach
Fractional Filters: An Optimization Approach Carlos Matos and Manuel Duarte Ortigueira 2 UNINOVA and Escola Superior de Tecnologia, Instituto Politécnico de Setúbal, Portugal cmatos@est.ips.pt, 2 UNINOVA/DEE
More informationOptimization of Catalytic Naphtha Reforming Process Based on Modified Differential Evolution Algorithm
Preprints of the 9th International Symposium on Advanced Control of Chemical Processes The International Federation of Automatic Control MoPoster2.12 Optimization of Catalytic Naphtha Reforming Process
More informationThrough-wall Imaging of Conductors by Transverse Electric Wave Illumination
Journal of Applied Science and Engineering, Vol. 20, No. 4, pp. 477 482 (2017) DOI: 10.6180/jase.2017.20.4.09 Through-wall Imaging of Conductors by Transverse Electric Wave Illumination Wei Chien 1, Chien-Ching
More informationAdaptive Generalized Crowding for Genetic Algorithms
Carnegie Mellon University From the SelectedWorks of Ole J Mengshoel Fall 24 Adaptive Generalized Crowding for Genetic Algorithms Ole J Mengshoel, Carnegie Mellon University Severinio Galan Antonio de
More informationApplication Research of Fireworks Algorithm in Parameter Estimation for Chaotic System
Application Research of Fireworks Algorithm in Parameter Estimation for Chaotic System Hao Li 1,3, Ying Tan 2, Jun-Jie Xue 1 and Jie Zhu 1 1 Air Force Engineering University, Xi an, 710051, China 2 Department
More informationUsing Differential Evolution for GEP Constant Creation
Using Differential Evolution for GEP Constant Creation Qiongyun Zhang Department of Computer Science University of Illinois at Chicago Chicago, IL, 60607, USA qzhang@cs.uic.edu Chi Zhou Realization Research
More informationIMPROVED ARTIFICIAL BEE COLONY FOR DESIGN OF A RECONFIGURABLE ANTENNA ARRAY WITH DISCRETE PHASE SHIFTERS
Progress In Electromagnetics Research C, Vol. 25, 193 208, 2012 IMPROVED ARTIFICIAL BEE COLONY FOR DESIGN OF A RECONFIGURABLE ANTENNA ARRAY WITH DISCRETE PHASE SHIFTERS X. T. Li, X. W. Zhao, J. N. Wang,
More informationBandit Algorithms. Zhifeng Wang ... Department of Statistics Florida State University
Bandit Algorithms Zhifeng Wang Department of Statistics Florida State University Outline Multi-Armed Bandits (MAB) Exploration-First Epsilon-Greedy Softmax UCB Thompson Sampling Adversarial Bandits Exp3
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 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 informationCrossover and the Different Faces of Differential Evolution Searches
WCCI 21 IEEE World Congress on Computational Intelligence July, 18-23, 21 - CCIB, Barcelona, Spain CEC IEEE Crossover and the Different Faces of Differential Evolution Searches James Montgomery Abstract
More informationDetermination of Component Values for Butterworth Type Active Filter by Differential Evolution Algorithm
Determination of Component Values for Butterworth Type Active Filter by Differential Evolution Algorithm Bahadır Hiçdurmaz Department of Electrical & Electronics Engineering Dumlupınar University Kütahya
More informationAN ADAPTIVE DIFFERENTIAL EVOLUTION ALGORITHM FOR SOLVING SECOND-ORDER DIRICHLET PROBLEMS
Vol. 12, No. 1, pp. 143-161 ISSN: 1646-3692 AN ADAPTIVE DIFFERENTIAL EVOLUTION ALGORITHM FOR SOLVING SECOND-ORDER Hasan Rashaideh Department of Computer Science, Prince Abdullah Ben Ghazi Faculty of Information
More informationBio-inspired Continuous Optimization: The Coming of Age
Bio-inspired Continuous Optimization: The Coming of Age Anne Auger Nikolaus Hansen Nikolas Mauny Raymond Ros Marc Schoenauer TAO Team, INRIA Futurs, FRANCE http://tao.lri.fr First.Last@inria.fr CEC 27,
More informationEFFECT OF STRATEGY ADAPTATION ON DIFFERENTIAL EVOLUTION IN PRESENCE AND ABSENCE OF PARAMETER ADAPTATION: AN INVESTIGATION
JAISCR, 2018, Vol. 8, No. 3, pp. 211 235 10.1515/jaiscr-2018-0014 EFFECT OF STRATEGY ADAPTATION ON DIFFERENTIAL EVOLUTION IN PRESENCE AND ABSENCE OF PARAMETER ADAPTATION: AN INVESTIGATION Deepak Dawar
More informationOutline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature
DM812 METAHEURISTICS Outline Lecture 8 http://www.aco-metaheuristic.org/ 1. 2. 3. Marco Chiarandini Department of Mathematics and Computer Science University of Southern Denmark, Odense, Denmark
More informationAutomatic Loop Shaping in QFT by Using CRONE Structures
Automatic Loop Shaping in QFT by Using CRONE Structures J. Cervera and A. Baños Faculty of Computer Engineering Department of Computer and Systems Engineering University of Murcia (Spain) jcervera@um.es
More informationAre You a Good Beam or a Bad Beam Allen Holder Trinity University Mathematics University of Texas Health Science Center at San Antonio
Are You a Good Beam or a Bad Beam University of Texas Health Science Center at San Antonio Joint Work with Matthias Ehrgott and Josh Reese, with help from Bill Salter, Ryan Acosta, and Daniel Nevin www.trinity.edu/aholder
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 informationHigher-Order Methods
Higher-Order Methods Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. PCMI, July 2016 Stephen Wright (UW-Madison) Higher-Order Methods PCMI, July 2016 1 / 25 Smooth
More informationEfficient Haplotype Inference with Boolean Satisfiability
Efficient Haplotype Inference with Boolean Satisfiability Joao Marques-Silva 1 and Ines Lynce 2 1 School of Electronics and Computer Science University of Southampton 2 INESC-ID/IST Technical University
More informationSimple 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 informationAn Evolution Strategy for the Induction of Fuzzy Finite-state Automata
Journal of Mathematics and Statistics 2 (2): 386-390, 2006 ISSN 1549-3644 Science Publications, 2006 An Evolution Strategy for the Induction of Fuzzy Finite-state Automata 1,2 Mozhiwen and 1 Wanmin 1 College
More informationCapacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm
Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Bharat Solanki Abstract The optimal capacitor placement problem involves determination of the location, number, type
More informationA Fast Heuristic for GO and MINLP
A Fast Heuristic for GO and MINLP John W. Chinneck, M. Shafique, Systems and Computer Engineering Carleton University, Ottawa, Canada Introduction Goal: Find a good quality GO/MINLP solution quickly. Trade
More informationMeta-heuristics for combinatorial optimisation
Meta-heuristics for combinatorial optimisation João Pedro Pedroso Centro de Investigação Operacional Faculdade de Ciências da Universidade de Lisboa and Departamento de Ciência de Computadores Faculdade
More informationColored Bin Packing: Online Algorithms and Lower Bounds
Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date
More information3E4: Modelling Choice. Introduction to nonlinear programming. Announcements
3E4: Modelling Choice Lecture 7 Introduction to nonlinear programming 1 Announcements Solutions to Lecture 4-6 Homework will be available from http://www.eng.cam.ac.uk/~dr241/3e4 Looking ahead to Lecture
More informationComputational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
More informationMulti-objective Quadratic Assignment Problem instances generator with a known optimum solution
Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution Mădălina M. Drugan Artificial Intelligence lab, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussels,
More informationAn Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse
An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University
More informationImproving Search Space Exploration and Exploitation with the Cross-Entropy Method and the Evolutionary Particle Swarm Optimization
1 Improving Search Space Exploration and Exploitation with the Cross-Entropy Method and the Evolutionary Particle Swarm Optimization Leonel Carvalho, Vladimiro Miranda, Armando Leite da Silva, Carolina
More information