Enhancing the performance of evolutionary algorithms: A novel maturity-based adaptation strategy

Adapting genetic operators and parameter settings during the optimization process can improve the overall performance of evolutionary algorithms (EAs). In this paper, a novel maturity-based adaptation strategy for EAs is proposed. During the search process, a maturity degree of the population is calculated based on both the population distribution in the search space and that in the fitness space. According to the maturity degree, four evolution states of EAs are defined by a set of thresholds. As both the convergence of the genotypes (reflected by the geographical distance among the individuals) and that of the phenotypes (shown by the differentiation over individuals' fitness values) are taken into consideration, the estimation of the evolution state is very comprehensive. Then, a set of adaptation rules is applied to adapt the parameters and operators of EAs according to the maturity degree and evolution state. Implemented on genetic algorithm (GA), the probabilities of crossover and mutation are tuned to fulfill the current evolution requirement of the population. Meanwhile, a novel allele gene-based mutation scheme and the traditional mutation are alternately executed. Experimental results on eight benchmark functions show that the proposed maturity-based adaptation strategy can bring significant improvements in search speed, solution accuracy and robustness.

[1]  L. M. Patnaik,et al.  Adaptive Probabilities of Crossover Genetic in Mu tation and Algorithms , 1994 .

[2]  Jun Zhang,et al.  Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms , 2007, IEEE Transactions on Evolutionary Computation.

[3]  C.H. Dai,et al.  Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms Based on Cloud Model , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Jun Zhang,et al.  An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[6]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  P. Rocca,et al.  Differential Evolution as Applied to Electromagnetics , 2011, IEEE Antennas and Propagation Magazine.

[8]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[9]  Thomas Bäck,et al.  Extended Selection Mechanisms in Genetic Algorithms , 1991, ICGA.

[10]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, ANTS Conference.

[11]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[12]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

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

[14]  Xiaoming Dai,et al.  Allele Gene Based Adaptive Genetic Algorithm to the Code Design , 2011, IEEE Transactions on Communications.

[15]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[16]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[18]  John J. Grefenstette,et al.  How Genetic Algorithms Work: A Critical Look at Implicit Parallelism , 1989, ICGA.

[19]  Jun Zhang,et al.  Evolutionary Computation Meets Machine Learning: A Survey , 2011, IEEE Computational Intelligence Magazine.

[20]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[21]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[22]  Xin Yao,et al.  Self-adaptive differential evolution with neighborhood search , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[24]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.