Abstract
In evolutionary multiobjective optimization, the Pareto front (PF) is approximated by using a set of representative candidate solutions with good convergence and diversity. However, most existing multiobjective evolutionary algorithms (MOEAs) have general difficulty in the approximation of PFs with complicated geometries. To address this issue, we propose a generic front modeling method for evolutionary multiobjective optimization, where the shape of the nondominated front is estimated by training a generalized simplex model. On the basis of the estimated front, we further develop an MOEA, where both the mating selection and environmental selection are driven by the approximate nondominated fronts modeled during the optimization process. For performance assessment, the proposed algorithm is compared with several state-of-the-art evolutionary algorithms on a wide range of benchmark problems with various types of PFs and different numbers of objectives. Experimental results demonstrate that the proposed algorithm performs consistently on a variety of multiobjective optimization problems.
| Original language | English |
|---|---|
| Article number | 8580560 |
| Pages (from-to) | 1106-1119 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Cybernetics |
| Volume | 50 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Mar 2020 |
| Externally published | Yes |
Keywords
- Evolutionary algorithm
- fitness function
- front modeling
- multiobjective and many-objective optimization
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'Guiding Evolutionary Multiobjective Optimization with Generic Front Modeling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver