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

A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
58
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 110 publications
(58 citation statements)
references
References 36 publications
0
58
0
Order By: Relevance
“…Algorithm Reference GA DE [38] NSGA-II [12] RNSGA-II [14] NSGA-III [10,26,4] UNSGA-III [43] RNSGA-III [47] MOEAD [52] to 1. This can be achieved by supplying this as a parameter in the initialization method as shown in Section 3.…”
Section: Algorithmsmentioning
confidence: 99%
“…Algorithm Reference GA DE [38] NSGA-II [12] RNSGA-II [14] NSGA-III [10,26,4] UNSGA-III [43] RNSGA-III [47] MOEAD [52] to 1. This can be achieved by supplying this as a parameter in the initialization method as shown in Section 3.…”
Section: Algorithmsmentioning
confidence: 99%
“…There are several genetic algorithms among which we have: Nondominated Sorting Genetic Algorithm (NSGA), NSGA-II, NSGA-III and U-NSGA-III. The U-NSGA-III is developed in 2015 by Seada and Deb [17]. U-NSGA-III begins with a set of N randomly generated population individuals and a set of reference points.…”
Section: The Genetic Algorithm U-nsga-iiimentioning
confidence: 99%
“…The "NSGA-II" algorithm is a very popular MOO implementation [54]. However, the more recent Universal-NSGA-III improves scalability to many objectives, which can otherwise lead to a cumbersomely large number of similar solutions [55], Figure 2E. We provide an opensource implementation of Universal-NSGA-III at https://github.com/marknormanread/unsga3.…”
Section: Single Metrics Alone May Not Fully Distinguish Complex Systemsmentioning
confidence: 99%