Research into the utility of non--coding segments, or introns, in genetic--based encodings has shown that they expedite the evolution of solutions in domains by protecting building blocks against destructive crossover. We consider a genetic programming system where non--coding segments can be removed, and the resultant chromosomes returned into the population. This parsimonious repair leads to premature convergence, since as we remove the naturally occurring non--coding segments, we strip away their protective backup feature. We then duplicate the coding segments in the repaired chromosomes, and place the modified chromosomes into the population. The duplication method significantly improves the learning rate in the domain we have considered. We also show that this method can be applied to other domains. 1
|
4828
|
Genetic Algorithms
– Goldberg
- 1989
|
|
169
|
Genetic programming: on the programming of computers by natural selection
– Koza
- 1992
|
|
149
|
Strongly typed genetic programming
– Montana
- 1995
|
|
146
|
The Molecular Biology of the Cell
– Alberts, Bray, et al.
- 1989
|
|
141
|
The evolution of evolvability in genetic programming
– Altenberg
- 1994
|
|
115
|
Complexity compression and evolution
– Nordin, Banzhaf
- 1995
|
|
96
|
Genetic programming and emergent intelligence
– Angeline
- 1994
|
|
90
|
A Compiling Genetic Programming System that Directly Manipulates the Machine-Code
– Nordin
- 1994
|
|
80
|
Genetic programming for feature discovery and image discrimination
– Tackett
- 1993
|
|
77
|
Inserting introns improves genetic algorithm success rate: Taking a cue from biology
– Levenick
- 1991
|
|
77
|
Explicitly defined introns and destructive crossover in genetic programming
– Nordin, Francone, et al.
- 1996
|
|
76
|
Coevolving high-level representations
– Angeline, Pollack
- 1994
|
|
59
|
Balancing accuracy and parsimony in genetic programming
– Zhang, Mühlenbein
- 1995
|
|
56
|
Accurate replication in genetic programming
– McPhee, Miller
- 1995
|
|
54
|
A comparative analysis of genetic programming
– O’Reilly, Oppacher
- 1995
|
|
50
|
Messy genetic algorithms revisited: studies in mixed size and scale
– Goldberg, Deb, et al.
- 1990
|
|
46
|
Discovery of subroutines in genetic programming
– Rosca, Ballard
- 1996
|
|
39
|
Type inheritance in strongly typed genetic programming
– Haynes, Schoenefeld, et al.
- 1996
|
|
32
|
Relative building block fitness and the building block hypothesis
– Forrest, Mitchell
- 1993
|
|
30
|
Empirical studies of the genetic algorithm with non-coding segments
– Wu, Lindsay
- 1995
|
|
25
|
Y.(1993), “A Genetic Algorithm for Survivable Network Design
– Davis, Cox, et al.
- 1993
|
|
20
|
Evolutionary Biology. Sinauer Associates
– Futuyma
- 1998
|
|
19
|
A hybrid genetic algorithm for the maximum clique problem
– Bui, Eppley
- 1995
|
|
14
|
Blickle and Lothar Thiele. Genetic programming and redundancy
– Tobias
- 1994
|
|
11
|
Towards automatic discovery of building blocks in genetic programming
– Rosca
- 1995
|
|
11
|
Mining the genetic program
– Tackett
- 1995
|
|
7
|
Clique finding -- A genetic approach
– Murthy, Parthasarthy, et al.
- 1995
|
|
4
|
Genetic algorithm for node partioning problem and applications
– Chandraasekharam, Subhramanian, et al.
- 1993
|
|
4
|
Messy genetic algorithms: Motiation, analysis, and first results
– Goldberg, Deb, et al.
- 1989
|
|
4
|
An Introduction to Discrete Mathematics and its Applications
– Kalmanson
- 1986
|
|
4
|
External concepts reuse in genetic programming
– Seront
- 1995
|
|
3
|
Clique detection via genetic programming
– Haynes, Schoenefeld
- 1995
|
|
2
|
we repair? Genetic algorithms, combinatorial optimization, and feasibilty constraints
– Shall
- 1993
|
|
2
|
Non-coding segments and floating building blocks for the genetic algorithm
– Wu
- 1995
|
|
1
|
NetQ is a question/answer forum for authors of Evolutionary Computation papers
– html
- 1995
|
|
1
|
Studies on the effect of non-- coding segments on the genetic algorithm
– Wu, Lindsay, et al.
- 1994
|
