| Package | Description |
|---|---|
| ec.gp.breed | |
| ec.gp.koza |
| Modifier and Type | Class and Description |
|---|---|
class |
InternalCrossoverPipeline
InternalCrossoverPipeline picks two subtrees from somewhere within an individual,
and crosses them over.
|
class |
MutateAllNodesPipeline
MutateAllNodesPipeline implements the AllNodes mutation algorithm described
in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98.
|
class |
MutateDemotePipeline
MutateDemotePipeline works very similarly to the DemoteNode algorithm
described in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98, and is also similar to the "insertion" operator found in
Una-May O'Reilly's thesis,
"An Analysis of Genetic Programming".
|
class |
MutateERCPipeline
MutateERCPipeline works very similarly to the "Gaussian" algorithm
described in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98.
|
class |
MutateOneNodePipeline
MutateOneNodesPipeline implements the OneNode mutation algorithm described
in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98.
|
class |
MutatePromotePipeline
MutatePromotePipeline works very similarly to the PromoteNode algorithm
described in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98, and is also similar to the "deletion" operator found in
Una-May O'Reilly's thesis,
"An Analysis of Genetic Programming".
|
class |
MutateSwapPipeline
MutateSwapPipeline works very similarly to the Swap algorithm
described in Kumar Chellapilla,
"A Preliminary Investigation into Evolving Modular Programs without Subtree
Crossover", GP98.
|
class |
RehangPipeline
RehangPipeline picks a nonterminal node other than the root
and "rehangs" it as
a new root.
|
class |
SizeFairCrossoverPipeline
SizeFairCrossover works similarly to one written in the paper
"Size Fair and Homologous Tree Genetic Programming Crossovers" by Langdon (1998).
|
| Modifier and Type | Class and Description |
|---|---|
class |
CrossoverPipeline
CrossoverPipeline is a GPBreedingPipeline which performs a strongly-typed
version of
Koza-style "Subtree Crossover".
|
class |
MutationPipeline
MutationPipeline is a GPBreedingPipeline which
implements a strongly-typed version of the
"Point Mutation" operator as described in Koza I.
|
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.