public class MutateSwapPipeline extends GPBreedingPipeline
MutateSwapPipeline picks a random tree, then picks randomly from all the swappable nodes in the tree, and swaps two of its subtrees. If its chosen tree has no swappable nodes, it repeats the choose-tree process. If after tries times it has failed to find a tree with swappable nodes, it gives up and simply copies the individual.
"Swapping" means to take a node n, and choose two children nodes of n, x and y, such that x's return type is swap-compatible with y's slot, and y's return type is swap-compatible with x's slot. The subtrees rooted at x and y are swapped.
A "Swappable" node means a node which is capable of swapping given the existing function set. In general to swap a node foo, it must have at least two children whose return types are type-compatible with each other's slots in foo.
This method is very expensive in searching nodes for "swappability". However, if the number of types is 1 (the GP run is typeless) then the type-constraint-checking code is bypassed and the method runs a little faster.
Typical Number of Individuals Produced Per produce(...) call
...as many as the source produces
Number of Sources
1
Parameters
base.tries int >= 1 |
(number of times to try finding valid pairs of nodes) |
base.tree.0 0 < int < (num trees in individuals), if exists |
(tree chosen for mutation; if parameter doesn't exist, tree is picked at random) |
Default Base
gp.breed.mutate-swap
Modifier and Type | Field and Description |
---|---|
static int |
NUM_SOURCES |
static java.lang.String |
P_MUTATESWAP |
static java.lang.String |
P_NUM_TRIES |
P_NODESELECTOR, P_TREE, TREE_UNFIXED
DYNAMIC_SOURCES, likelihood, mybase, P_LIKELIHOOD, P_NUMSOURCES, P_SOURCE, sources, V_SAME
NO_PROBABILITY, P_PROB, probability
Constructor and Description |
---|
MutateSwapPipeline() |
Modifier and Type | Method and Description |
---|---|
Parameter |
defaultBase()
Returns the default base for this prototype.
|
int |
numSources()
Returns the number of sources to this pipeline.
|
int |
produce(int min,
int max,
int start,
int subpopulation,
Individual[] inds,
EvolutionState state,
int thread)
Produces n individuals from the given subpopulation
and puts them into inds[start...start+n-1],
where n = Min(Max(q,min),max), where q is the "typical" number of
individuals the BreedingSource produces in one shot, and returns
n.
|
void |
setup(EvolutionState state,
Parameter base)
Sets up the BreedingPipeline.
|
produces
clone, finishProducing, individualReplaced, maxChildProduction, minChildProduction, preparePipeline, prepareToProduce, reproduce, sourcesAreProperForm, typicalIndsProduced
getProbability, pickRandom, setProbability, setupProbabilities
public static final java.lang.String P_MUTATESWAP
public static final java.lang.String P_NUM_TRIES
public static final int NUM_SOURCES
public Parameter defaultBase()
Prototype
public int numSources()
BreedingPipeline
numSources
in class BreedingPipeline
public void setup(EvolutionState state, Parameter base)
BreedingSource
The most common modification is to normalize it with some other set of probabilities, then set all of them up in increasing summation; this allows the use of the fast static BreedingSource-picking utility method, BreedingSource.pickRandom(...). In order to use this method, for example, if four breeding source probabilities are {0.3, 0.2, 0.1, 0.4}, then they should get normalized and summed by the outside owners as: {0.3, 0.5, 0.6, 1.0}.
setup
in interface Prototype
setup
in interface Setup
setup
in class BreedingPipeline
Prototype.setup(EvolutionState,Parameter)
public int produce(int min, int max, int start, int subpopulation, Individual[] inds, EvolutionState state, int thread)
BreedingSource
produce
in class BreedingSource