GM-EA: guided mutation evolutionary algorithm
基于有导向变异算子的GM-EA算法*

To design a more effective evolutionary algorithm, this paper introduced a new guided mutation evolutionary algorithm by combining Guotao algorithm with the idea from particle swarm optimization, which focused on exploiting the global best solution in population to direct the mutation. In order to preserve the components of building-blocks and avoid the premature problem, separated the search process as the exploration phase and exploitation phase, and in exploitation phase simulated annealing was applied as the replace policy. The experimental results show that the proposed algorithm is significantly superior to Guotao algorithm.