When Hillclimbers Beat Genetic Algorithms in Multimodal Optimization
Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Cyfraniad i Gynhadledd › adolygiad gan gymheiriaid
Fersiynau electronig
We show that multistart next ascent hillclimbing compares favourably to crowding-based genetic algorithms when solving instances of the multimodal problem generator. We conjecture that it is unlikely that any practical evolutionary algorithm is capable of solving this type of problem instances faster than the multistart hillclimbing strategy.
Allweddeiriau
| Iaith wreiddiol | Saesneg |
|---|---|
| Teitl | Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation |
| Man cyhoeddi | New York, NY, USA |
| Cyhoeddwr | Association for Computing Machinery |
| Tudalennau | 1421–1422 |
| ISBN (Argraffiad) | 9781450334884 |
| Dynodwyr Gwrthrych Digidol (DOIs) | |
| Statws | Cyhoeddwyd - 2015 |
| Cyhoeddwyd yn allanol | Ie |
Cyfres gyhoeddiadau
| Enw | GECCO Companion '15 |
|---|---|
| Cyhoeddwr | Association for Computing Machinery |