2016
DOI: 10.1109/tevc.2016.2521175
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition-Based Algorithms Using Pareto Adaptive Scalarizing Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
87
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 231 publications
(87 citation statements)
references
References 58 publications
0
87
0
Order By: Relevance
“…Lastly, other advanced evolutionary algorithms, e.g. [27,28,29], can be employed to solve the optimal design of HRES. In another aspect, the problem itself can be formulated as a standard multiobjective problem to benchmark the performance of di erent multi-objective evolutionary algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…Lastly, other advanced evolutionary algorithms, e.g. [27,28,29], can be employed to solve the optimal design of HRES. In another aspect, the problem itself can be formulated as a standard multiobjective problem to benchmark the performance of di erent multi-objective evolutionary algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…Metaheuristics algorithms are effective for both single objectives [57][58][59][60] and multi-objectives [61][62][63][64]. Due to the success of metaheuristics in many numerical and combinatorial optimization problems such as those above, DE is a type of metaheuristics that is easy and powerful.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Amongst the state-of-the-art MOEAs, the MOEA based on decomposition (MOEA/D) [12] has gained great popularity, and thus is adopted. It decomposes an MOP into a set of subproblems by a scalarizing method with evenly distributed direction vectors, and then optimizes these subproblems in a collaborative manner [20,21].…”
Section: Multi-objective Optimization Using Moea/d-lpbimentioning
confidence: 99%
“…The test problems are constructed by performing different shape constrains in the Walking Fish Group (WFG) kit to the standard WFG4 benchmark problem [20,21]. Taking WFG45 as an example, its PF is mixed, combining the concave and the convex.…”
Section: Appendix Amentioning
confidence: 99%