Random Heuristic Search (1999)
| Venue: | Theoretical Computer Science |
| Citations: | 7 - 1 self |
BibTeX
@ARTICLE{Vose99randomheuristic,
author = {Michael D. Vose},
title = {Random Heuristic Search},
journal = {Theoretical Computer Science},
year = {1999},
volume = {229},
pages = {103--142}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
There is a developing theory of growing power which, at its current stage of development (indeed, for a number of years now), speaks to qualitative and quantitative aspects of search strategies. Although it has been specialized and applied to genetic algorithms, it's implications and applicability are far more general. This paper deals with the broad outlines of the theory, introducing basic principles and results rather than analyzing or specializing to particular algorithms. A few specific examples are included for illustrative purposes, but the theory's basic structure, as opposed to applications, remains the focus. Key words: Random Heuristic Search, Modeling Evolutionary Algorithms, Degenerate Royal Road Functions. 1 Introduction Vose [20] introduced a rigorous dynamical system model for the binary representation genetic algorithm with proportional selection, mutation determined by a rate, and one-point crossover, using the simplifying assumption of an infinite population. 1 ...
