When A Genetic Algorithm Outperforms Hill-Climbing
A toy optimisation problem is introduced which consists of a fitness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2004-06.
|
| Subjects: | |
| Online Access: | Get fulltext |