A Novel Multiobjective Differential Evolutionary Algorithm Based on Subregion Search

A novel multiobjective DE algorithm using the subregion and external set strategy (MOEA/S-DE) is proposed in this paper, in which the objective space is divided into some subregions and then independently optimize each subregion. An external set is introduced for each subregion to save some individuals ever found in this subregion. An alternative of mutation operators based the idea of direct simplex method of mathematical programming are proposed: local and global mutation operator. The local mutation operator is applied to improve the local search performance of the algorithm and the global mutation operator to explore a wider area. Additionally, a reusing strategy of difference vector also is proposed. It reuses the difference vector of the better individuals according to a given probability. Compared with traditional DE, the crossover operator also is improved. In order to demonstrate the performance of the proposed algorithm, it is compared with the MOEA/DDE and the hybrid-NSGA-II-DE. The result indicates that the proposed algorithm is efficient.