Research of Dynamic Parameters Design on Genetic Algorithm

Article Preview

Abstract:

To quickly get the global optimum by genetic algorithm, calculated the average and standard deviation of the adaptabilities of chromosomes of one generation, designed the selection operator and the mutation operator by the average and the standard deviation, dynamically adjusted the probability of selection operator and mutation operator and decreased the blindness of genetic algorithm, increased the multiplicity of chromosomes by multiple-point crossover and repetitiveness check. The test shows that the algorithm offered in the article is feasible and effective.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2282-2286

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] X.X. Cui: Multiple-Target Evolution Algorithm and Its Application (National Defense Industry Press, CHINA 2006) (In Chinese).

Google Scholar

[2] M. Srinivas L.M. Patnaik: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms, IEEE Transaction on Systems, Vol. 24(1994), pp.656-667.

DOI: 10.1109/21.286385

Google Scholar

[3] M. Hu: Application of Genetic Algorithm in Query's Optimization of Relational Database[D]. College of Software, Tongji University, 2008 (In Chinese).

Google Scholar

[4] F. Cai: Investment Combination Research Based on Improved Genetic Algorithm[D], College of Computer, Inner Mongolia University, 2009 (In Chinese).

Google Scholar

[5] Z.G. Li,W.J. Guo, and S.S. Zhang, Genetic Algorithm Improved by Checking Repetition,. in Proceedings of the First International Conference on Intelligent Human-Machine Systems and Cybernetics, HangZhou, China, pp.466-469, (2009).

DOI: 10.1109/ihmsc.2009.239

Google Scholar