Abstract: A new evolutionary algorithm is proposed based on Alopex. By randomly selecting two individuals and computing the probability of searching direction, the proposed algorithm can converge to the globally optimal value. This algorithm has not only the basic characteristic of evolutionary algorithms, but also the advantage of gradient methods and simulation anneal algorithm to some extend. The experiment results show that the proposed algorithm is superior to standard evolutionary algorithms, especially for multiapices function.