A Rough-to-Fine Evolutionary Multiobjective Optimization Algorithm

This article presents a rough-to-fine evolutionary multiobjective optimization algorithm based on the decomposition for solving problems in which the solutions are initially far from the Pareto-optimal set. Subsequently, a tree is constructed by a modified k -means algorithm on N uniform weight v...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on cybernetics 2022-12, Vol.52 (12), p.13472-13485
Hauptverfasser:	Gu, Fangqing, Liu, Hai-Lin, Cheung, Yiu-Ming, Zheng, Minyi
Format:	Artikel
Sprache:	eng
Schlagworte:	Complexity Decomposition Empirical analysis evolutionary algorithm Evolutionary algorithms Evolutionary computation incremental multiobjective optimization Multiple objective analysis Optimization Optimization algorithms Pareto optimization Pareto optimum Problem solving Sorting tree-like weight design
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!