An Elite-subspace Evolutionary Algorithm for Solving Function Optimization Problems

An effective evolutionary algorithm for solving function optimization problems is presented in ［1］. This algorithm is easy to implement and enables us to find the optimal solution within a fairly short period of time. In this paper, on the basis of this algorithm we present a elitesubspace evolutionary algorithm by adopting the elitepreservation strategy and enhancing the selection pressure of parents in the process of crossover. The numerical experiments show that the convergence of new algorithm is better than the algorithm in ［1］. The optimal solution can be found within a shorter period of time by using the new algorithm.