Abstract

It is known that many-objective optimization problems (MaOPs) often face the difficulty of maintaining good diversity and convergence in the search process due to the high-dimensional objective space. To address this issue, this article proposes a novel multiobjective framework for many-objective optimization (Mo4Ma), which transforms the many-objective space into multiobjective space. First, the many objectives are transformed into two indicative objectives of convergence and diversity. Second, a clustering-based sequential selection strategy is put forward in the transformed multiobjective space to guide the evolutionary search process. Specifically, the selection is circularly performed on the clustered subpopulations to maintain population diversity. In each round of selection, solutions with good performance in the transformed multiobjective space will be chosen to improve the overall convergence. The Mo4Ma is a generic framework that any type of evolutionary computation algorithm can incorporate compatibly. In this article, the differential evolution (DE) is adopted as the optimizer in the Mo4Ma framework, thus resulting in an Mo4Ma-DE algorithm. Experimental results show that the Mo4Ma-DE algorithm can obtain well-converged and widely distributed Pareto solutions along with the many-objective Pareto sets of the original MaOPs. Compared with seven state-of-the-art MaOP algorithms, the proposed Mo4Ma-DE algorithm shows strong competitiveness and general better performance.

Highlights

  • T HE EVOLUTIONARY computation community has been interested in multiobjective optimization problems (MOPs) [1]–[4] and their applications [5]–[7] over the last three decades

  • The normalized SDE (NSDE)-based selection priority is more reasonable which shows the effectiveness of NSDE, and it is easy to find that the infeasibility of shift-based density estimation (SDE) is due to the different scales of the objectives

  • Due to the limitation of computing Euclidean distance in bi-goal evolution (BiGE), the niche technology cannot play a sufficient role in guiding the evolution of the population, so the solution set is scattered in the search space

Read more

Summary

A Multiobjective Framework for Many-Objective Optimization

Abstract—It is known that many-objective optimization problems (MaOPs) often face the difficulty of maintaining good diversity and convergence in the search process due to the highdimensional objective space. To address this issue, this article proposes a novel multiobjective framework for many-objective optimization (Mo4Ma), which transforms the many-objective space into multiobjective space. In each round of selection, solutions with good performance in the transformed multiobjective space will be chosen to improve the overall convergence.

INTRODUCTION
RELATED WORK
PROPOSED MO4MA-DE ALGORITHM
General Framework of Mo4Ma-DE
DE-Based Evolutionary Operator
Calculation of Convergence
Calculation of Diversity
Clustering-Based Sequential Selection Strategy
15: End While
Experimental Design
Experimental Results and Comparisons
Effects of Main Components in Mo4Ma-DE
Parameter Sensitivity Analysis
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.