Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms

Evolutionary algorithms have been effectively used to solve multiobjective optimization problems with a small number of objectives, two or three in general. However, when problems with many objectives are encountered, nearly all algorithms perform poorly due to loss of selection pressure in fitness...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on evolutionary computation Jg. 18; H. 2; S. 269 - 285
Hauptverfasser: He, Zhenan, Yen, Gary G., Zhang, Jun
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.04.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1089-778X, 1941-0026
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Evolutionary algorithms have been effectively used to solve multiobjective optimization problems with a small number of objectives, two or three in general. However, when problems with many objectives are encountered, nearly all algorithms perform poorly due to loss of selection pressure in fitness evaluation solely based upon the Pareto optimality principle. In this paper, we introduce a new fitness evaluation mechanism to continuously differentiate individuals into different degrees of optimality beyond the classification of the original Pareto dominance. The concept of fuzzy logic is adopted to define a fuzzy Pareto domination relation. As a case study, the fuzzy concept is incorporated into the designs of NSGA-II and SPEA2. Experimental results show that the proposed methods exhibit better performance in both convergence and diversity than the original ones for solving many-objective optimization problems.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2013.2258025