The dynamic NSGA-II starts with four solutions and periodically doubles its population, provably optimizing OneMinMax in O(n log n) evaluations, a factor Theta(n) faster than static NSGA-II.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Speeding Up the NSGA-II via Dynamic Population Sizes
The dynamic NSGA-II starts with four solutions and periodically doubles its population, provably optimizing OneMinMax in O(n log n) evaluations, a factor Theta(n) faster than static NSGA-II.