Adaptive genetic algorithm based on density distribution of population

The control parameters in evolutionary algorithms (EAs) have significant effects on the behavior and performance of the algorithm. Most existing parameter control mechanisms are based on either individual fitness or positional distribution of population. This paper proposes a parameter adaptation strategy which aims at evaluating the density distribution of population as well as both the fitness values comprehensively, and adapting the parameters accordingly. The proposed method partitions the individuals into clusters according to their positional distribution. In order to depict the density distribution of population, a variable termed relative cluster density is proposed. Rules are used to modify the values of px and pm based on the relative cluster density and the relative sizes of clusters containing the best and the worst individuals. Experiments are conducted on a set of benchmark functions to investigate the performance and behavior of the proposed method, and the results show that the strategy is promising.

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

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

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

[4]  L. Xinping,et al.  Notice of RetractionAdaptive Genetic Algorithm Based on Population Diversity , 2009, 2009 International Forum on Information Technology and Applications.

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

[6]  Shengxiang Yang,et al.  Adaptive Primal–Dual Genetic Algorithms in Dynamic Environments , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

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

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

[10]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

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

[12]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[13]  IEEE Computational Intelligence Magazine , 2006, IEEE Computational Intelligence Magazine.

[14]  T. Back,et al.  Evolutionary algorithms for real world applications [Application Notes] , 2008, IEEE Computational Intelligence Magazine.

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

[16]  Thomas Bäck,et al.  Evolutionary Algorithms for Real World Applications , 2008 .

[17]  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).