Identifying Pareto Fronts Reliably Using a Multi-Stage Reference-vector-based Framework
Evolutionary multi-objective and many-objective optimization (EMO and EMaO) algorithms are increasingly being used to identify the true shape and location of the Paretooptimal front using a few representative well-converged and welldistributed solutions. The reason for their popularity is due to the...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on evolutionary computation 2023-02, p.1-1 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Evolutionary multi-objective and many-objective optimization (EMO and EMaO) algorithms are increasingly being used to identify the true shape and location of the Paretooptimal front using a few representative well-converged and welldistributed solutions. The reason for their popularity is due to their ability to provide a better understanding of objective relationships for optimal solutions, and also to facilitate the choice of a preferred solution using an interactive or postoptimal multi-criterion decision analysis. However, since EMO and EMaO algorithms are stochastic, a single application may not provide a true representative set with a desired number of Pareto solutions reliably in repetitive runs and importantly with a well-distributed set of solutions. In this paper, we propose a multistage framework involving reference-vector based evolutionary multi-and many-objective algorithms (MuSt-EMO and MuSt-EMaO) that attempts to recursively rectify shortcomings of previous stages by careful executions of subsequent stages so that a prescribed number of well-distributed and well-converged solutions are achieved at the end. The proposed multi-stage approach is implemented to a number of popular reference vector based EMO/EMaO algorithms and is applied on various multiand many-objective test and real-world problems. |
---|---|
ISSN: | 1089-778X |
DOI: | 10.1109/TEVC.2023.3246922 |