An improved adaptive genetic algorithm

Abstract

Although the search process of GA may appear the global optimal solution, it can not guarantee that it is converged to the global optimal solution every time, but also the possibility of precocious defects occurs. For disadvantages of genetic algorithm, an improved adaptive GA is proposed with a real-coded, temporary memory set strategy, the improved cross-strategy and the improved mutation strategy. The results of demonstrate examples are proved that effectiveness of the improved GA is best. © 2012 Springer-Verlag GmbH Berlin Heidelberg.