A smoothing evolutionary algorithm based on square search and filled function for global optimization

Many effective algorithms have been proposed for the global optimization problems arisen in various practical fields. However, some of these problems exist many local optima, which may lead to premature for solution algorithms. In order to avoid entrapping in the local optima, a smoothing function and square search method were used in the designed evolutionary algorithm. Using smoothing function can flatten the hilltops of the original function and eliminate all local optimal solutions which are no better than the best one found so far. Based on the smoothing function, square search scheme is presented, which can fall in a lower valley easier. Then, a filled function and local search were used to update the better solution found so far. Simulation results on 9 high dimensional standard benchmark problems indicate the performance of the proposed evolutionary algorithm is effective and sound.

[1]  Michael N. Vrahatis,et al.  On the computation of all global minimizers through particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[2]  Xin Yao,et al.  Evolutionary programming using mutations based on the Levy probability distribution , 2004, IEEE Transactions on Evolutionary Computation.

[3]  Ge Renpu.  A filled function method for finding a global minimizer of a function of several variables , 1990 .

[4]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[5]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[6]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[7]  Xian Liu,et al.  A new filled function applied to global optimization , 2004, Comput. Oper. Res..

[8]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.

[9]  J. Ford,et al.  Hybrid estimation of distribution algorithm for global optimization , 2004 .

[10]  Francisco Herrera,et al.  Real-Coded Memetic Algorithms with Crossover Hill-Climbing , 2004, Evolutionary Computation.

[11]  Amit Konar,et al.  Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.

[12]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[13]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[14]  Arnold J. Stromberg,et al.  Number-theoretic Methods in Statistics , 1996 .

[15]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[16]  Terry Jones,et al.  Crossover, Macromutationand, and Population-Based Search , 1995, ICGA.

[17]  Yuping Wang,et al.  An Evolutionary Algorithm for Global Optimization Based on Level-Set Evolution and Latin Squares , 2007, IEEE Transactions on Evolutionary Computation.

[18]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[19]  Jeffrey A. Joines,et al.  Hybrid genetic algorithms and random linkage , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[20]  Tung-Kuan Liu,et al.  Hybrid Taguchi-genetic algorithm for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[21]  W. Hart.  Adaptive global optimization with local search , 1994 .

[22]  William E. Hart,et al.  A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search , 2001, Evolutionary Computation.

[23]  F. Oppacher,et al.  Hybridized crossover-based search techniques for program discovery , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.