2001
DOI: 10.1007/3-540-44719-9_5
|View full text |Cite
|
Sign up to set email alerts
|

Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
234
0
7

Year Published

2004
2004
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 336 publications
(241 citation statements)
references
References 6 publications
0
234
0
7
Order By: Relevance
“…There are some different Pareto-based multiobjective strategies that could also be applied for the same problem, as can be seen in [6]. Later in this paper, we will evaluate a more recent approach, the NSGA-II algorithm [9,10].…”
Section: Evolutionary Transparent Modeling Of Chaotic Systemsmentioning
confidence: 99%
See 3 more Smart Citations
“…There are some different Pareto-based multiobjective strategies that could also be applied for the same problem, as can be seen in [6]. Later in this paper, we will evaluate a more recent approach, the NSGA-II algorithm [9,10].…”
Section: Evolutionary Transparent Modeling Of Chaotic Systemsmentioning
confidence: 99%
“…Our selection operator is a variation of that used in the NSGA-II algorithm [9,10]. In the first place, the set of nondominated search points is computed by pairwise comparisons of all individuals in X .…”
Section: The Selection Operatormentioning
confidence: 99%
See 2 more Smart Citations
“…We used the multi-objective evolutionary algorithm called NSGA-II [2]. It is based on the constrained domination concept.…”
Section: The Multi-objective Evolutionary Approachmentioning
confidence: 99%