Hybrid genetic algorithm based on an effective local search technique

Because the basic genetic algorithm can easily fall into local optimal solution and its late poor local capability,this paper presents a hybrid genetic algorithm(HGA) with a local search technique,which introduces local search technology into the genetic algorithm(GA).This local search technology sets a selection mechanism which utilizes the steepest descent method to determine convergence.Comparing the numerical results of the basic genetic algorithm(BGA) and the local search hybrid algorithm(HGA),it shows that the algorithm presented has high efficiency and good performance.