Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm

A decomposition approach decomposes a multiobjective optimization problem into a number of scalar objective optimization subproblems. It plays a key role in decomposition-based multiobjective evolutionary algorithms. However, many widely used decomposition approaches, originally proposed for mathema...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on evolutionary computation Jg. 20; H. 3; S. 475 - 480
Hauptverfasser: Wang, Luping, Zhang, Qingfu, Zhou, Aimin, Gong, Maoguo, Jiao, Licheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.06.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
constraint
Constraints
Convergence
De-composition approach
Decomposition
Evolutionary algorithms
Evolutionary computation
Evolutionary multiobjective optimization
Linear programming
Measurement
Optimization
Scalars
Sociology
Statistics
Strategy
Constraint
evolutionary multiobjective optimization
decomposition approach
ISSN:1089-778X, 1941-0026
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A decomposition approach decomposes a multiobjective optimization problem into a number of scalar objective optimization subproblems. It plays a key role in decomposition-based multiobjective evolutionary algorithms. However, many widely used decomposition approaches, originally proposed for mathematical programming algorithms, may not be very suitable for evolutionary algorithms. To help decomposition-based multiobjective evolutionary algorithms balance the population diversity and convergence in an appropriate manner, this letter proposes to impose some constraints on the subproblems. Experiments have been conducted to demonstrate that our proposed constrained decomposition approach works well on most test instances. We further propose a strategy for adaptively adjusting constraints by using information collected from the search. Experimental results show that it can significantly improve the algorithm performance.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2015.2457616