DMOEA- \varepsilon \text : Decomposition-Based Multiobjective Evolutionary Algorithm With the \varepsilon -Constraint Framework

Decomposition is an efficient and prevailing strategy for solving multiobjective optimization problems (MOPs). Its success has been witnessed by the multiobjective evolutionary algorithm MOEA/D and its variants. In decomposition-based methods, an MOP is decomposed into a number of scalar subproblems...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on evolutionary computation Vol. 21; no. 5; pp. 714 - 730
Main Authors:	Chen, Jie, Li, Juan, Xin, Bin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	decomposition Evolutionary algorithms Evolutionary computation Functions (mathematics) Genetic algorithms Linear programming main objective alternation strategy Matching Mathematical programming Mopping multiobjective optimization Multiple objective analysis Optimization Pareto optimization Sociology solution-to-subproblem matching procedure Strategy subproblem-to-solution matching procedure Upper bound ε-constraint method
ISSN:	1089-778X, 1941-0026
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!