A Self-adaptive Genetic Algorithm Based on the Principle of Searching for Things

This paper proposes a new self-adaptive genetic algorithm 。 This new algorithm divides the whole evolution process into three stages. At each stage, the new algorithm adopts different operation method. The main ideas are grading balance selection, continuous crossover operation. The new algorithm designs especially self-adaptive mutation probability according to the principle of searching for things. Numerical experiments show that the new algorithm is more effective than the comparative algorithm in realizing the high convergence precision, reducing the convergence generation and good at keeping the stability of the adaptive genetic algorithm.

[1]  Cong Wang,et al.  An adaptive genetic algorithm and its application in bilateral multi-issue negotiation , 2008 .

[2]  Changyong Liang,et al.  A novel small-population genetic algorithm based on adaptive mutation and population entropy sampling , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[3]  蔡自兴,et al.  An adaptive genetic algorithm with diversity-guided mutation and its global convergence property , 2004 .

[4]  Helio J. C. Barbosa,et al.  A genetic algorithm encoding for cardinality constraints and automatic variable linking in structural optimization , 2008 .

[5]  Limin Liu,et al.  A Kind of Composite Genetic Algorithm Based on Extreme Pre-Judgement , 2007, 2007 11th International Conference on Computer Supported Cooperative Work in Design.

[6]  Tao Ma,et al.  Genetic algorithm for autonomic joint radio resource management in end-to-end reconfigurable systems , 2008 .

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

[8]  Liu Sheng.  An improved adaptive genetic algorithm and its application in function optimization , 2007 .

[9]  Cai Zi-xing,et al.  An adaptive genetic algorithm with diversity-guided mutation and its global convergence property , 2004 .

[10]  Xuelong Hu,et al.  Optimal approximation of Head-related Transfor Function based on adaptive genetic algorithm , 2008, 2008 International Conference on Neural Networks and Signal Processing.

[11]  万仲平,et al.  An adaptive genetic algorithm for solving bilevel linear programming problem , 2007 .

[12]  Wang Zhiliang.  A new adaptive algorithm for regulating the probabilities of crossover and mutation , 2008 .

[13]  Liang Liao,et al.  Genetic algorithm based on multipopulation competitive coevolution , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[14]  Chak-Kuen Wong,et al.  A new model of simulated evolutionary computation-convergence analysis and specifications , 2001, IEEE Trans. Evol. Comput..

[15]  Rashmi R. Sinha,et al.  Comparing Recommendations Made by Online Systems and Friends , 2001, DELOS.

[16]  Jintao Zhang,et al.  A Genetic Algorithm for Finding Minimal Multi-homogeneous Bézout Number , 2008, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008).

[17]  Zhang Cui-fang.  Adaptive Compact Genetic Algorithm and Simulation , 2008 .

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

[19]  Zhou Cui-hong.  Strategy for Generic Algorithms to Solve TSP Problem Quickly , 2008 .

[20]  Cai Liang-wei.  Real-coded adaptive genetic annealing algorithm based on distance measurement , 2004 .