Abstract
Steady-state evolutionary algorithms are often favoured over generational ones due to better scalability in parallel and distributed environments. However, in certain conditions they are able to produce results of better quality as well. We consider several ways to introduce various ``degrees of steadiness'' in the NSGA-II algorithm, some of which have not been known in literature, and show experimentally (on a corpus of 21 test problems) the presence of a general trend: algorithms with more steadiness yield better results.
Original language | English |
---|---|
Title of host publication | GECCO Companion '15 |
Subtitle of host publication | Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation |
Editors | Sara Silva |
Publisher | Association for Computing Machinery |
Pages | 749-750 |
Number of pages | 2 |
ISBN (Print) | 978-1-4503-3488-4 |
DOIs | |
Publication status | Published - 11 Jul 2015 |
Externally published | Yes |
Event | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Spain Duration: 11 Jul 2015 → 15 Jul 2015 |
Conference
Conference | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 |
---|---|
Country/Territory | Spain |
City | Madrid |
Period | 11 Jul 2015 → 15 Jul 2015 |
Keywords
- multi-objective
- nsga-ii
- steady-state