Crynodeb
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.
Iaith wreiddiol | Saesneg |
---|---|
Teitl | GECCO Companion '15 |
Is-deitl | Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation |
Golygyddion | Sara Silva |
Cyhoeddwr | Association for Computing Machinery |
Tudalennau | 749-750 |
Nifer y tudalennau | 2 |
ISBN (Argraffiad) | 978-1-4503-3488-4 |
Dynodwyr Gwrthrych Digidol (DOIs) | |
Statws | Cyhoeddwyd - 11 Gorff 2015 |
Cyhoeddwyd yn allanol | Ie |
Digwyddiad | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Sbaen Hyd: 11 Gorff 2015 → 15 Gorff 2015 |
Cynhadledd
Cynhadledd | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 |
---|---|
Gwlad/Tiriogaeth | Sbaen |
Dinas | Madrid |
Cyfnod | 11 Gorff 2015 → 15 Gorff 2015 |