Evolutionary strategy algorithm based on bi-group

Abstract

Aiming at the problems of premature convergence and slow convergence of traditional evolution strategy,a Modified Evolutionary Strategies(MES) algorithm based on bi-group was proposed.In the new algorithm,the group was divided into two sub-groups,general sub-group and elite sub-group.The size of general sub-group was larger than the size of elite sub-group,in which the best individuals were stored.Evolution of the two sub-groups was parallel performed with different mutation strategies respectively,and then the group could not only explore the solution space separately,but also searched the local part in detail.Performance of this algorithm was analyzed in theory.Experimental results demonstrate that the MES algorithm is more efficient to improve convergence speed and avoid premature convergence than classical evolution strategies.