The expected runtime of the (1+1) evolutionary algorithm on almost linear functions
This Thesis expands the theoretical research done in the area of evolutionary algorithms. The (1+1)EA is a simple algorithm which allows to gain some insight in the behaviour of these randomized search heuristics. This work shows ways to possible improve on existing bounds. The general good runtime...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://cardinalscholar.bsu.edu/handle/handle/188087 http://liblink.bsu.edu/uhtbin/catkey/1356253 |