Adaptive Dynamic Disturbance Strategy for Differential Evolution Algorithm

• Main Authors: Tiejun Wang, Kaijun Wu, Tiaotiao Du, Xiaochun Cheng
• Format: Article
• Language: English
• Published: MDPI AG 2020-03-01
• Series: Applied Sciences
• Subjects: differential evolution algorithm; adaptive dynamic disturbance strategy; gauss perturbation; benchmark functions
• Online Access: https://www.mdpi.com/2076-3417/10/6/1972

To overcome the problems of slow convergence speed, premature convergence leading to local optimization and parameter constraints when solving high-dimensional multi-modal optimization problems, an adaptive dynamic disturbance strategy for differential evolution algorithm (ADDSDE) is proposed. Firstly, this entails using the chaos mapping strategy to initialize the population to increase population diversity, and secondly, a new weighted mutation operator is designed to weigh and combinemutation strategies of the standard differential evolution (DE). The scaling factor and crossover probability are adaptively adjusted to dynamically balance the global search ability and local exploration ability. Finally, a Gauss perturbation operator is introduced to generate a random disturbance variation, and to accelerate premature individuals to jump out of local optimization. The algorithm runs independently on five benchmark functions 20 times, and the results show that the ADDSDE algorithm has better global optimization search ability, faster convergence speed and higher accuracy and stability compared with other optimization algorithms, which provide assistance insolving high-dimensionaland complex problems in engineering and information science.