Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations

Abstract

Differential evolution (DE) algorithm has been shown to be a very effective and efficient approach for solving global numerical optimization problems, which attracts a great attention of scientific researchers. Generally, most of DE algorithms only evolve one population by using certain kind of DE operators. However, as observed in nature, the working efficiency can be improved by using the concept of work specialization, in which the entire group should be divided into several sub-groups that are responsible for different tasks according to their capabilities. Inspired by this phenomenon, a novel adaptive multiple sub-populations based DE algorithm is designed in this paper, named MPADE, in which the parent population is split into three sub-populations based on the fitness values and then three novel DE strategies are respectively performed to take on the responsibility for either exploitation or exploration. Furthermore, a simple yet effective adaptive approach is designed for parameter adjustment in the three DE strategies and a replacement strategy is put forward to fully exploit the useful information from the trial vectors and target vectors, which enhance the optimization performance. In order to validate the effectiveness of MPADE, it is tested on 55 benchmark functions and 15 real world problems. When compared with other DE variants, MPADE performs better in most of benchmark problems and real-world problems. Moreover, the impacts of the MPADE components and their parameter sensitivity are also analyzed experimentally.