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

ar-MOEA: A Novel Preference-Based Dominance Relation for Evolutionary Multiobjective Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
20
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(20 citation statements)
references
References 37 publications
0
20
0
Order By: Relevance
“…The basic idea of the weighted sum strategy is that the weighting coefficients act in a preferential way for the multiobjectives. In other words, through a given set of ω 1 , ω 2 , …, ω m , the optimisation process produces a single point for the problem at the Pareto front [21]. Another point at the Pareto front can be established for a different set of ω i .…”
Section: Simulated Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The basic idea of the weighted sum strategy is that the weighting coefficients act in a preferential way for the multiobjectives. In other words, through a given set of ω 1 , ω 2 , …, ω m , the optimisation process produces a single point for the problem at the Pareto front [21]. Another point at the Pareto front can be established for a different set of ω i .…”
Section: Simulated Resultsmentioning
confidence: 99%
“…Deb et al [22] and Yi et al [21] found evidence in their studies that the solutions to the problem have a combined objective, see (6), and these are the best solutions for the objectives as well, being the best Pareto sets for the original problem, as in (6).…”
Section: Simulated Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…An improved version of the crowding distance has been proposed in [10] and shows to improve NSGA-II performances. The main differences between the various proposed approaches in this category arise in the followings search components: fitness assignment, diversity management, and elitism [18], [32], [36]. • Decomposition-based approaches: most of decomposition based algorithms in solving MOPs operate in the objective space.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, multi-objective evolutionary algorithms (MOEAs) have been presented and shown promising performance in solving different kinds of MOPs [2]- [4]. Based on the selection mechanisms, most of existing MOEAs can be classified into three main categories, i.e., Pareto-based MOEAs [5]- [9], decomposition-based MOEAs [10]- [17], and indicator-based MOEAs [20]- [23].…”
Section: Introductionmentioning
confidence: 99%