Accelerating Differential Evolution Using an Adaptive Local Search

We propose a crossover-based adaptive local search (LS) operation for enhancing the performance of standard differential evolution (DE) algorithm. Incorporating LS heuristics is often very useful in designing an effective evolutionary algorithm for global optimization. However, determining a single LS length that can serve for a wide range of problems is a critical issue. We present a LS technique to solve this problem by adaptively adjusting the length of the search, using a hill-climbing heuristic. The emphasis of this paper is to demonstrate how this LS scheme can improve the performance of DE. Experimenting with a wide range of benchmark functions, we show that the proposed new version of DE, with the adaptive LS, performs better, or at least comparably, to classic DE algorithm. Performance comparisons with other LS heuristics and with some other well-known evolutionary algorithms from literature are also presented.

[1]  C. Fernandes,et al.  A study on non-random mating and varying population size in genetic algorithms using a royal road function , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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

[3]  A. Kai Qin,et al.  Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  Jouni Lampinen,et al.  A Trigonometric Mutation Operation to Differential Evolution , 2003, J. Glob. Optim..

[5]  N. K. H. P. Spaink,et al.  Evolutionary Algorithms , 2000, Natural Computing Series.

[6]  Yaochu Jin,et al.  Knowledge incorporation in evolutionary computation , 2005 .

[7]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

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

[9]  Jürgen Teich,et al.  Systematic integration of parameterized local search into evolutionary algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[10]  Amit Konar,et al.  Two improved differential evolution schemes for faster global search , 2005, GECCO '05.

[11]  Rainer Storn,et al.  System design by constraint adaptation and differential evolution , 1999, IEEE Trans. Evol. Comput..

[12]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[13]  Georges R. Harik,et al.  Foundations of Genetic Algorithms , 1997 .

[14]  Thomas Bck.  Introduction to the Special Issue: Self-Adaptation , 2001, Evolutionary Computation.

[15]  Hitoshi Iba,et al.  A new generation alternation model for differential evolution , 2006, GECCO '06.

[16]  Qingfu Zhang,et al.  DE/EDA: A new evolutionary algorithm for global optimization , 2005, Inf. Sci..

[17]  Robert G. Reynolds,et al.  CULTURAL ALGORITHMS: COMPUTATIONAL MODELING OF HOW CULTURES LEARN TO SOLVE PROBLEMS: AN ENGINEERING EXAMPLE , 2005, Cybern. Syst..

[18]  Jouni Lampinen,et al.  A Fuzzy Adaptive Differential Evolution Algorithm , 2005, Soft Comput..

[19]  Saku Kukkonen,et al.  Real-parameter optimization with differential evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[20]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[21]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[22]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[23]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[24]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 : Advanced Algorithms and Operators , 2000 .

[25]  Jinn-Moon Yang,et al.  Integrating adaptive mutations and family competition into genetic algorithms as function optimizer , 2000, Soft Comput..

[26]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[27]  Carlos A. Coello Coello,et al.  A comparative study of differential evolution variants for global optimization , 2006, GECCO.

[28]  Amit Konar,et al.  Improving particle swarm optimization with differentially perturbed velocity , 2005, GECCO '05.

[29]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[30]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[31]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[32]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[33]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

[34]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search , 2005, 2005 IEEE Congress on Evolutionary Computation.

[35]  Jim Smith,et al.  A Memetic Algorithm With Self-Adaptive Local Search: TSP as a case study , 2000, GECCO.

[36]  Gary B. Fogel,et al.  Noisy optimization problems - a particular challenge for differential evolution? , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[37]  Kalyanmoy Deb,et al.  On self-adaptive features in real-parameter evolutionary algorithms , 2001, IEEE Trans. Evol. Comput..

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

[39]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[40]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[41]  Shigeyoshi Tsutsui,et al.  Advances in Evolutionary Computing , 2003 .

[42]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[43]  Shigenobu Kobayashi,et al.  A real-coded genetic algorithm using the unimodal normal distribution crossover , 2003 .

[44]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[45]  Hitoshi Iba,et al.  Enhancing differential evolution performance with local search for high dimensional function optimization , 2005, GECCO '05.

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

[47]  Kalyanmoy Deb,et al.  A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization , 2002, Evolutionary Computation.

[48]  Hiroaki Satoh,et al.  Minimal generation gap model for GAs considering both exploration and exploitation , 1996 .

[49]  Xiao-Feng Xie,et al.  DEPSO: hybrid particle swarm with differential evolution operator , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[50]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..