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!
Popis
Shrnutí: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 by using various scalarizing functions. Most decomposition schemes adopt the weighting method to construct scalarizing functions. In this paper, another classical generation method in the field of mathematical programming, that is the e-constraint method, is adopted for the multiobjective optimization. It selects one of the objectives as the main objective and converts other objectives into constraints. We incorporate the e-constraint method into the decomposition strategy and propose a new decomposition-based multiobjective evolutionary algorithm with the e-constraint framework (DMOEA-εC). It decomposes an MOP into a series of scalar constrained optimization subproblems by assigning each subproblem with an upper bound vector. These subproblems are optimized simultaneously by using information from neighboring subproblems. Besides, a main objective alternation strategy, a solution-to-subproblem matching procedure, and a subproblem-to-solution matching procedure are proposed to strike a balance between convergence and diversity. DMOEA-εC is compared with a number of state-of-theart multiobjective evolutionary algorithms. Experimental studies demonstrate that DMOEA-εC outperforms or performs competitively against these algorithms on the majority of 34 continuous benchmark problems, and it also shows obvious advantages in solving multiobjective 0-1 knapsack problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2017.2671462