DocumentCode :
2437083
Title :
Genetic Algorithm Improved by Checking Repetition
Author :
Li, Zhigang ; Guo, Weijia ; Zhang, Shanshu
Author_Institution :
Coll. of Comput. & Autom. Control, Hebei Polytech. Univ., Tangshan, China
Volume :
2
fYear :
2009
fDate :
26-27 Aug. 2009
Firstpage :
466
Lastpage :
469
Abstract :
Genetic algorithm is a classic algorithm for optimization. But there are some problems with it, such as prematurity, inefficiency. Another improved method is offered in the article. Some points in the article: first, make sure that all the chromosomes in the first generation are distributed. Second, in the crossover operation, decide if making a crossover between two chromosomes or not according to their generalized hamming distance. If the chromosomes matched can´t make a crossover, and then mutate the two chromosomes until they can. After mutation check all the chromosomes but the top one of the new generation. Revise all the repeated chromosomes by mutation until they aren´t. A test shows that the algorithm offered in the article can get the optimum result rapidly.
Keywords :
genetic algorithms; checking repetition; chromosome distribution; crossover operation; generalized hamming distance; genetic algorithm; mutation checking; optimization; Automatic control; Biological cells; Cybernetics; Educational institutions; Genetic algorithms; Genetic mutations; Hamming distance; Intelligent systems; Man machine systems; Optimization methods; crossover; generalized hamming distance; mutation; prematurity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Human-Machine Systems and Cybernetics, 2009. IHMSC '09. International Conference on
Conference_Location :
Hangzhou, Zhejiang
Print_ISBN :
978-0-7695-3752-8
Type :
conf
DOI :
10.1109/IHMSC.2009.239
Filename :
5335883
Link To Document :
بازگشت