An evolutionary algorithm with sorted race mechanism for global optimization

There are often problems of search effectiveness and maintaining the diversity of population in solving single objective optimization problems by evolutionary algorithm. In order to improve search efficiency, the algorithm in this paper regards the current optimal individual as a search starting point, and designs efficient crossover and mutation operator with simulated annealing to search optimal solutions. A sorted race-based selection mechanism is taken to update current population to overcome premature and maintaining the diversity of population. The selection compares the similar individuals to select the best one to keep the population diversity. At last, we test a large number of single-objective test functions to compare and analyze the numerical results with existing algorithms. The results show that our algorithm is very effective