2018
DOI: 10.1109/tsmc.2017.2654301
|View full text |Cite
|
Sign up to set email alerts
|

A New Decomposition-Based NSGA-II for Many-Objective Optimization

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

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 221 publications
(87 citation statements)
references
References 49 publications
0
87
0
Order By: Relevance
“…As shown in Fig. 1, (1-k)-dominance and L-dominance hold the same dominance areas with Pareto dominance in biobjective space, whereas the difference between (1-k)-dominance and Pareto dominance only exists when the number of objectives M ≥ 4, and the difference between L-dominance and Pareto dominance only exists when M ≥ 3, Inspired by decomposition based MOEAs, the fourth category of dominance relations is defined by a set of weight vectors, e.g., the θ-dominance relation [12] and the RP-dominance relation [13]. In θ-dominance, each candidate solution is associated with its nearest weight vector, and a candidate solution x is said to θ-dominate another one y if and only if they are associated with the same weight vector λ, and…”
Section: A Existing Dominance Relationsmentioning
confidence: 99%
See 1 more Smart Citation
“…As shown in Fig. 1, (1-k)-dominance and L-dominance hold the same dominance areas with Pareto dominance in biobjective space, whereas the difference between (1-k)-dominance and Pareto dominance only exists when the number of objectives M ≥ 4, and the difference between L-dominance and Pareto dominance only exists when M ≥ 3, Inspired by decomposition based MOEAs, the fourth category of dominance relations is defined by a set of weight vectors, e.g., the θ-dominance relation [12] and the RP-dominance relation [13]. In θ-dominance, each candidate solution is associated with its nearest weight vector, and a candidate solution x is said to θ-dominate another one y if and only if they are associated with the same weight vector λ, and…”
Section: A Existing Dominance Relationsmentioning
confidence: 99%
“…There exist many techniques for developing new dominance relations in the literature, such as expanding the dominance area [6], [7], gridding the objective space [8], [9], adopting the fuzzy logic [10], [11], and defining the dominance relation by weight vectors [12], [13].…”
mentioning
confidence: 99%
“…One of the best methods in multiobjective optimization is the nondominated sorting genetic algorithm (NSGA-II). 32,33 This algorithm begins by the creation of a random initial population that is sorted by a nondominated sorting procedure. This initial population is the basis for obtaining subsequent offspring populations as follows:…”
Section: Multiobjective Optimization Algorithmmentioning
confidence: 99%
“…The fourth idea enhances the effectiveness of the Pareto dominance by means of a set of uniformly distributed reference vectors as suggested in decomposition-based MOEAs [47,48]. θ -Dominance [48] is a dominance relation belonging to this category, where each solution is associated with its nearest reference vector, and a solution is said to dominate another one if and only if the two solutions are associated with the same reference vector and the former has better convergence and diversity than the latter.…”
Section: Rectifications Of Pareto Dominance For Many-objective Optimimentioning
confidence: 99%