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

On the Evolutionary Optimization of Many Conflicting Objectives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

3
212
0
2

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 404 publications
(217 citation statements)
references
References 28 publications
3
212
0
2
Order By: Relevance
“…As discussed in Section 3.2, "real-world" problems are rarely defined by a single performance measure. Instead, they are best solved using multiple performance criteria (referred to as "many-objective" problems (Purshouse and Fleming, 2007)) that capture a broad range of system properties and stakeholder preferences, ultimately requiring that the decision maker choose from a suite of Pareto optimal design possibilities.…”
Section: Current Statusmentioning
confidence: 99%
“…As discussed in Section 3.2, "real-world" problems are rarely defined by a single performance measure. Instead, they are best solved using multiple performance criteria (referred to as "many-objective" problems (Purshouse and Fleming, 2007)) that capture a broad range of system properties and stakeholder preferences, ultimately requiring that the decision maker choose from a suite of Pareto optimal design possibilities.…”
Section: Current Statusmentioning
confidence: 99%
“…Many-objective problems present a number of challenges [10,19] to the EMO community such as the deterioration in search ability of Pareto dominance-based algorithms [6,29] and the increase in computation time of hypervolume-based algorithms [2,3]. For many-objective problems, it has been demonstrated in the literature [10,12] that MOEA/D [27] works well in comparison with Pareto dominance-based and hypervolume-based algorithms in terms of their search ability and computation time.…”
Section: Introductionmentioning
confidence: 99%
“…There is a class of MOPs that are particularly appealing because of their inherent complexity: the so-called many-objective problems [4]. These are problems with a relatively large number of objectives.…”
Section: Introductionmentioning
confidence: 99%