An Efficient Hybridized Genetic Algorithm

Abstract

Aiming at deficient hencies in global search and convergence speed of traditional basic genetic algorithm, a novel hybrid genetic algorithm based on simulated annealing is proposed. The proposed algorithm not only has all the features of traditional genetic algorithm, but also further improves the global searching ability, prevents it from premature convergence, obtains fast convergence and high computational precision. The numerical experiments show that this algorithm has great advantage of con-vengeance property, on-line and off-line programming over the original genetic algorithm.