A hybrid genetic algorithm based on harmony search and its improving

Abstract

In order to deal with the shortages of simple genetic algorithm (GA) such as low convergence speed and prematurity, this chapter firstly introduced the main process of harmony search algorithm (HS). Then put forward a new hybrid algorithm based on it. This new algorithm integrated the harmony of HS with chromosome of GA appropriately. Furthermore, aiming at reducing computational complexity and saving time of the new algorithm, two improved strategies were given. The experimental results show the new algorithm and its improving are better than the simple genetic algorithm in solution quality, convergence speed and other indicators, and that two improved strategies have their own advantages respectively. It shows that the new hybrid algorithm and its improving are all feasible and effective. © 2013 Springer-Verlag.