by Richard A. Watson, Gregory S. Hornby, Jordan B. Pollack
In Parallel Problem Solving from Nature - PPSN V
http://www.demo.cs.brandeis.edu/papers/hiff_ppsn.ps.gz
Add To MetaCart
Abstract:
Abstract. The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA test problems with a structure based on buildingblocks. Many of these problems use deceptive fitness functions to model interdependency between the bits within a block. However, very few have any model of interdependency between building-blocks; those that do are not consistent in the type of interaction used intra-block and inter-block. This paper discusses the inadequacies of the various test problems in the literature and clarifies the concept of building-block interdependency. We formulate a principled model of hierarchical interdependency that can be applied through many levels in a consistent manner and introduce Hierarchical If-and-only-if (H-IFF) as a canonical example. We present some empirical results of GAs on H-IFF showing that if population diversity is maintained and linkage is tight then the GA is able to identify and manipulate building-blocks over many levels of assembly, as the Building-Block Hypothesis suggests. 1
Citations
|
1316
|
Genetic Algorithms + Data Structures = Evolution Programs
– Michalewicz
- 1994
|
|
764
|
The Sciences of the Artificial
– Simon
- 1998
|
|
289
|
Origins of Order
– Kauffman
- 1993
|
|
244
|
Messy Genetic Algorithms: Motivation, Analysis and First Results
– Goldberg, Korb, et al.
- 1989
|
|
233
|
An Investigation of Niche and Species Formation in Genetic Function Optimization
– Deb, Goldberg
- 1989
|
|
146
|
The royal road for genetic algorithms: Fitness landscapes and GA performance
– Mitchell, Forrest, et al.
- 1992
|
|
128
|
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
– Jones, Forrest
- 1995
|
|
127
|
Evolutionary Algorithms, Fitness Landscapes and Search
– Jones
- 1995
|
|
126
|
When will a genetic algorithm outperform hill climbing
– Mitchell, Holland, et al.
- 1994
|
|
97
|
Relative building-block fitness and the building-block hypothesis. 2
– Forrest, Mitchell
- 1993
|
|
87
|
The Schema Theorem and Price’s Theorem
– Altenberg
- 1994
|
|
82
|
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
– Forrest, Mitchell
- 1993
|
|
77
|
Rapid, Accurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
– Goldberg, Deb, et al.
- 1993
|
|
77
|
Searching for diverse, cooperative populations with genetic algorithms
– Smith, Forrest, et al.
- 1993
|
|
45
|
D.E.: Sufficient conditions for deceptive and easy binary functions
– Deb, Goldberg
- 1994
|
|
32
|
Genetic Algorithms
– Goldberg
- 1989
|
|
28
|
Adaptation in Natural and Artificial Systems", Ann Arbor
– Holland
- 1975
|
|
16
|
Test driving three 1995 genetic algorithms: new test functions and geometric matching
– Graves, Whitley, et al.
- 1995
|
|
7
|
Royal Road functions, Internet Genetic Algorithm Digest
– Holland
- 1993
|
|
4
|
Royal Road Functions", Internet Genetic Algorithms Digest v7n22
– Holland
- 1993
|
|
4
|
The Schema Theorem and Price’s
– Altenberg
- 1995
|
|
1
|
Genetic Algorithm Difficulty and the Modality of Fitness Landscapes
– Goldberg
- 1994
|
|
1
|
Test Driving Three
– Whitley, Beveridge, et al.
- 1995
|
