Computer Science – Neural and Evolutionary Computing
Scientific paper
2001-04-06
Computer Science
Neural and Evolutionary Computing
8 pages; to appear in GECCO 2001
Scientific paper
It is still unclear how an evolutionary algorithm (EA) searches a fitness landscape, and on what fitness landscapes a particular EA will do well. The validity of the building-block hypothesis, a major tenet of traditional genetic algorithm theory, remains controversial despite its continued use to justify claims about EAs. This paper outlines a research program to begin to answer some of these open questions, by extending the work done in the royal road project. The short-term goal is to find a simple class of functions which the simple genetic algorithm optimizes better than other optimization methods, such as hillclimbers. A dialectical heuristic for searching for such a class is introduced. As an example of using the heuristic, the simple genetic algorithm is compared with a set of hillclimbers on a simple subset of the hyperplane-defined functions, the pothole functions.
No associations
LandOfFree
Potholes on the Royal Road does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Potholes on the Royal Road, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Potholes on the Royal Road will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-201243