Differential evolutionary using opposition-based learning for multimodal multi-objective optimization

Abstract

The correspondence between the decision space and the objective space is often many-to-one in multi-objective optimization problems. Therefore, a class of problems with such mapping relationships is defined as a MMOPs. For these problems, how to ensure the final solution converges to each Pareto solution set and guarantees the diversity of the algorithm is an urgent problem. The method of the paper with opposition-based strategy, a multimodal multi-objective optimization algorithm, is proposed. The algorithm proposed is called MMODE_OP, which is framed by a differential evolutionary algorithm, and opposition-based learning is applied to the initialization phase and generation-hopping phase to filter out the more promising individuals in the population for iteration to enhance the global search capability and the diversity of population. In addition, different Gaussian perturbation strategies are adopted with iteration to achieve the search of the neighborhood, which can further not only improve the quality of the Pareto solution set but also enable the convergence of the Pareto solution set quickly. This method improves the algorithm’s local and global search ability, and enables multiple the Pareto solution set and improving the convergence. In the meantime, adaptive scaling factors and crossover factors are designed in this paper to enhance the improved search capability. Finally, the experiment results of MMODE_OP and other excellent algorithms on 13 test problems corroborate the proposed methods have superior performance.