Title :
A New Crossover Operator for Improving Ability of Global Searching
Author :
Jin, Da-jiang ; Zhang, Ji-ye
Author_Institution :
Southwest Jiaotong Univ., Chengdu
Abstract :
Considering the deficiency of the traditional crossover operator of Genetic Algorithms (GAs) in global searching, the partheno-crossover operator is proposed in this paper. The partheno-crossover, a new crossover operator, still uses the traditional method of crossover. The individual of the population doesn´t cross over the individual of the same population but the individual of the completely different with it. When these two individuals have many offspring, only the fittest offspring can replace his father´s position in the population. So this offspring either inherits the father´s good gene fragments or have a better gene fragments. It both ensures that the population develops to excellent direction, and avoids that the population converges to a local optimal solution. Compared to the Standard Genetic Algorithm (SGA), the traditional improved Genetic Algorithm (TIGA) and the Partheno-Genetic Algorithm (PGA), the improved Genetic Algorithm used the partheno-crossover operator (PCGA) allows better stability of global convergence and some comparative results relative to the optimization of test functions has increase of 10 times, even Several decuples.
Keywords :
convergence; genetic algorithms; mathematical operators; search problems; stability; convergence stability; genetic algorithms; improved genetic algorithm; partheno-crossover operator; partheno-genetic algorithm; standard genetic algorithm; traditional improved genetic algorithm; Cybernetics; Electronic mail; Electronics packaging; Genetic algorithms; Genetic mutations; Hamming distance; Laboratories; Machine learning; Stability; Testing; Crossover operator; Genetic algorithm; Improved algorithm; Stability of convergence;
Conference_Titel :
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-0973-0
Electronic_ISBN :
978-1-4244-0973-0
DOI :
10.1109/ICMLC.2007.4370534