DocumentCode :
2192024
Title :
An Improved Genetic Algorithm Based on Polygymy
Author :
Min, Gu ; Feng, Yang
Author_Institution :
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear :
2010
fDate :
2-4 April 2010
Firstpage :
371
Lastpage :
373
Abstract :
In this paper, an improved genetic algorithm based on polygymy which means one father and many mothers is proposed. The population is divided into several sub-populations, and each sub-population is composed of a father, some mothers and some bachelors. Crossover is occurred between the father and the mothers. Mutation is occurred only among the bachelors. The function optimization results show that the proposed algorithm has higher convergence speed and alleviates the problem of premature convergence.
Keywords :
convergence; genetic algorithms; convergence speed; crossover; function optimization; genetic algorithm; mutation; polygymy; population; premature convergence; Clustering algorithms; Convergence; Electronics packaging; Genetic algorithms; Genetic engineering; Genetic mutations; Informatics; Information security; Information technology; Optimization methods; genetic algorithm; optimization; polygymy; premature convergence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on
Conference_Location :
Jinggangshan
Print_ISBN :
978-1-4244-6730-3
Electronic_ISBN :
978-1-4244-6743-3
Type :
conf
DOI :
10.1109/IITSI.2010.166
Filename :
5453597
Link To Document :
بازگشت