The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
DOI: 10.1109/cec.2003.1299927
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary many-objective optimisation: an exploratory analysis

Abstract: -This inquiry explores the effectiveness of a class of modern evolutionary algorithms, represented by NSGA-11, for solving optimisation tasks with many conflicting objectives. Optimiser behaviour is assessed for a grid of recombination operator configurations. Performance maps are obtained for the dual aims of proximity to, and distribution across, the optimal trade-off surface. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
83
0

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 153 publications
(84 citation statements)
references
References 11 publications
1
83
0
Order By: Relevance
“…The bad performance of early Pareto-based methods like NSGA-II and SPEA2 observed by Hughes [3] and Purshouse and Fleming [2] is confirmed. They show a rapid degradation with increasing number of objectives.…”
Section: Discussionsupporting
confidence: 52%
See 1 more Smart Citation
“…The bad performance of early Pareto-based methods like NSGA-II and SPEA2 observed by Hughes [3] and Purshouse and Fleming [2] is confirmed. They show a rapid degradation with increasing number of objectives.…”
Section: Discussionsupporting
confidence: 52%
“…Few previous studies on many-objective optimization by Purshouse and Fleming [2] and Hughes [3] focus to demonstrate the bad performance of NSGA-II by Deb et al [4]. Hughes observed a simple single-objective restart strategy outperforming NSGA-II on a six-objective function in a two-dimensional decision space.…”
Section: Introductionmentioning
confidence: 99%
“…MOEAs are being used to solve many-objective problems in a rapidly growing body of literature as their population-based search enables the direct approximation of problems' Pareto frontiers in a single optimization run (Purshouse and Fleming 2003, Aguirre et al 2013, Lygoe et al 2013, Morino and Obayashi 2013. For example, while solving a five-objective problem, the MOEAs simultaneously solve the five single-objective problems, ten two-objective problems, ten three-objective problems, and five four-objective problems.…”
Section: Evolutionary Multiobjective Optimizationmentioning
confidence: 99%
“…[30,31,32,33]). According to [32], other important concerns are the so-called Dominance Resistant Solutions (e.g.…”
Section: A Brief Outline and Some Criticisms Of Previous Approachesmentioning
confidence: 99%