Analysis of Recombinative Algorithms on a Non-Separable Building-Block Problem (2000)
Cached
Download Links
| Venue: | IN PRINTING |
| Citations: | 19 - 5 self |
BibTeX
@INPROCEEDINGS{Watson00analysisof,
author = {Richard A. Watson},
title = {Analysis of Recombinative Algorithms on a Non-Separable Building-Block Problem},
booktitle = {IN PRINTING},
year = {2000},
pages = {69--89},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give an upper bound on the expected time for a recombinative algorithm to solve a non-separable building-block problem. The analysis proceeds by proving the existence of a path to the solution and calculating the time for each step on this path. Ordinarily, such a straightforward approach would be defeated because both the existence of a path, and the time for a step, are dependent on the state of the population when using recombination. However, to calculate an upper bound on the expected time it is sufficient to know certain properties, or invariants, of the population rather than its exact state. First we analyze a `recombinative hill-climber' that applies crossover repeatedly to just two strings. This enables us to prove the existence of a path to the solution that is monotonically increasing in fitness when using recombination. In contrast, the interdependent fitness contributions of blocks in this problem produce a search space that has many local optima for a mu...
