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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on evolutionary computation Ročník 21; číslo 5; s. 714 - 730
Hlavní autoři:	Chen, Jie, Li, Juan, Xin, Bin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!