2014
DOI: 10.1109/tmag.2013.2285703
|View full text |Cite
|
Sign up to set email alerts
|

A Two-Level Genetic Algorithm for Large Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…For comparison purposes, the number of generations in the DWTGA, for Hartmann 6 function, was the same used in [4]: ν 1 = 10, ν 2 = 10, and ν 3 = 5, at fine and coarse levels. The values of those parameters to Schwefel and Griewank functions were (50, 20, and 10), respectively.…”
Section: Optimization Procedures At Fine and Coarse Levelsmentioning
confidence: 99%
See 4 more Smart Citations
“…For comparison purposes, the number of generations in the DWTGA, for Hartmann 6 function, was the same used in [4]: ν 1 = 10, ν 2 = 10, and ν 3 = 5, at fine and coarse levels. The values of those parameters to Schwefel and Griewank functions were (50, 20, and 10), respectively.…”
Section: Optimization Procedures At Fine and Coarse Levelsmentioning
confidence: 99%
“…The traditional GA and the two-level approach based on the principal components analysis GA (PCAGA) have been used for comparison. For the Hartmann 6 problem, the fine model used here is the same applied in [4].…”
Section: Optimization Procedures At Fine and Coarse Levelsmentioning
confidence: 99%
See 3 more Smart Citations