Research on an adaptive directional mutation genetic algorithm

Based on the theory of simulated annealing, this paper presents an adaptive directional mutation strategy that adjusts the mutation step using the gradual information of the fitness function at the search point. This strategy makes the mutated individual approaching the local optimization and greatly improves the evolution speed and at the same time weakens the convergence possibility. Simulation results confirm that this algorithm not only takes on strong overall search ability but also improves the convergence speed greatly.