A Ga Algorithm Based on Niche and Discrete

Article Preview

Abstract:

To avoiding e the problem of premature convergence of GA algorithm, a novel algorithm was advanced based on niche and discrete. The improved GA algorithm use hierarchical coding and selection method in the classic GA to abundance the individual choices. Then use the multilevel optimization to quicken the algorithm. Tests show the new algorithm has better performance than classic GA in effect and time, especially suit to multi peak problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1546-1549

Citation:

Online since:

August 2013

Export:

Price:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

[1] Vic Ciesielski, Dylan Mawhinney. Prevention of Early Convergence in Genetic Programming by Replacement of Similar Programs[J]. Intelligent Automation and Soft Computing , 2012: 67-72.

Google Scholar

[2] Chinchin Lai. A Novel Clustering Approach Using Hierarchical Genetic Algorithms[J]. Intelligent Automation and Soft Computing, 2010, 11(3): 143-153.

DOI: 10.1080/10798587.2005.10642900

Google Scholar

[3] Matthew R. Glickman , Katiasycara. Reasons for Premature Convergence of Self- Adapting Mutation Rates[J]. Intelligent Control and Automation , 2000, 2(15): 62-69.

Google Scholar

[4] Rudolph G. Self-adaptive Mutations May Lead to Premature Convergence[J]. Evolutionary Computation, 2001, 8(16): 410-414.

DOI: 10.1109/4235.942534

Google Scholar

[5] Juan Liu, Zixing Cai. Premature Convergence in Genetic Algorithm: Analysis and Prevention Based on Chaos Operator[J]. Intelligent Control and Automation, 2000, 6(28): 495-499.

DOI: 10.1109/wcica.2000.860016

Google Scholar