2010
DOI: 10.1007/s00180-010-0197-1
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms with shrinking population size

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0
1

Year Published

2013
2013
2023
2023

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 1 publication
0
14
0
1
Order By: Relevance
“…Additionally, we found that neither stagnation nor continued improvement between consecutive generations was well approximated by considering the magnitudes of the average functional values across the population, although this latter approach was successful for determining a stopping criteria in prior work focused on the use of GA for parameter estimation (Akman & Schaefer, ; Akman et al., ). Finally, while for the sake of efficiency, some GA explorations have begun with large populations and adapted population sizes to decrease as the optimal value is approached (Akman & Schaefer, ; Hallam, Akman, & Akman, ), some of our numerical runs suggested advantages to increasing population sizes when a local minimum has been reached, albeit generally for incremental improvement in solutions. We found no clear performance advantages to many of our experiments with more complex evolution algorithms or larger population sizes/higher numbers of generations, and we found repetition of low‐computation runs to be the most impactful in obtaining minimal fitnesses.…”
Section: Methodsmentioning
confidence: 98%
“…Additionally, we found that neither stagnation nor continued improvement between consecutive generations was well approximated by considering the magnitudes of the average functional values across the population, although this latter approach was successful for determining a stopping criteria in prior work focused on the use of GA for parameter estimation (Akman & Schaefer, ; Akman et al., ). Finally, while for the sake of efficiency, some GA explorations have begun with large populations and adapted population sizes to decrease as the optimal value is approached (Akman & Schaefer, ; Hallam, Akman, & Akman, ), some of our numerical runs suggested advantages to increasing population sizes when a local minimum has been reached, albeit generally for incremental improvement in solutions. We found no clear performance advantages to many of our experiments with more complex evolution algorithms or larger population sizes/higher numbers of generations, and we found repetition of low‐computation runs to be the most impactful in obtaining minimal fitnesses.…”
Section: Methodsmentioning
confidence: 98%
“…In their research [9] reduced the size of the population adaptively. The process of evolution begins with a large population size then population size will continue to decrease depending on its best fitness value.…”
Section: Previous Researchmentioning
confidence: 99%
“…Step 2 Modification:shrinking population size Following Hallam et al [14], we implement an adaptive scheme which allows a decrease in populations in relation to the performance of each generation. This allows us to cast a wide net in the LHS sampling scheme for our initial population, but to quickly lower our computational cost by decreasing the population size once we have benefited from the initial sweep.…”
Section: Step 2: Create a Single 'Elite' Individualmentioning
confidence: 99%