A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems

Solving constrained multi-objective optimization problems is a difficult task, it needs to simultaneously optimize multiple conflicting objectives and a number of constraints. This paper first reviews a number of popular constrained multi-objective evolutionary algorithms (CMOEAs) and twenty-three w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 IEEE Congress on Evolutionary Computation (CEC) S. 209 - 216
Hauptverfasser: Zhun Fan, Yi Fang, Wenji Li, Jiewei Lu, Xinye Cai, Caimin Wei
Format: Tagungsbericht
Sprache:Englisch
Japanisch
Veröffentlicht: IEEE 01.06.2017
Schlagworte:
Algorithm design and analysis
Evolutionary computation
Pareto optimization
Sociology
Sorting
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Solving constrained multi-objective optimization problems is a difficult task, it needs to simultaneously optimize multiple conflicting objectives and a number of constraints. This paper first reviews a number of popular constrained multi-objective evolutionary algorithms (CMOEAs) and twenty-three widely used constrained multi-objective optimization problems (CMOPs) (including CF1-10, CTP1-8, BNH, CONSTR, OSY, SRN and TNK problems). Then eight popular CMOEAs with simulated binary crossover (SBX) and differential evolution (DE) operators are selected to test their performance on the twenty-three CMOPs. The eight CMOEAs can be classified into domination-based CMOEAs (including ATM, IDEA, NSGA-II-CDP and SP) and decomposition-based CMOEAs (including CMOEA/D, MOEA/D-CDP, MOEA/D-SR and MOEA/D-IEpsilon). The comprehensive experimental results indicate that IDEA has the best performance in the domination-based CMOEAs and MOEA/D-IEpsilon has the best performance in the decomposition-based CMOEAs. Among the eight CMOEAs, MOEA/D-IEpsilon with both SBX and DE operators has the best performance on the twenty-three test problems.
DOI:10.1109/CEC.2017.7969315