public class SizeFairCrossoverPipeline extends GPBreedingPipeline
SizeFairCrossover tries tries times to find a tree that has at least one fair size node based on size fair or homologous implementation. If it cannot find a valid tree in tries times, it gives up and simply copies the individual.
This pipeline typically produces up to 2 new individuals (the two newly- swapped individuals) per produce(...) call. If the system only needs a single individual, the pipeline will throw one of the new individuals away. The user can also have the pipeline always throw away the second new individual instead of adding it to the population. In this case, the pipeline will only typically produce 1 new individual per produce(...) call.
Typical Number of Individuals Produced Per produce(...) call
2 * minimum typical number of individuals produced by each source, unless tossSecondParent
is set, in which case it's simply the minimum typical number.
Number of Sources
2
Parameters
base.tries int >= 1 |
(number of times to try finding valid pairs of nodes) |
base.maxdepth int >= 1 |
(maximum valid depth of a crossed-over subtree) |
base.tree.0 0 < int < (num trees in individuals), if exists |
(first tree for the crossover; if parameter doesn't exist, tree is picked at random) |
base.tree.1 0 < int < (num trees in individuals), if exists |
(second tree for the crossover; if parameter doesn't exist, tree is picked at random. This tree must have the same GPTreeConstraints as tree.0, if tree.0 is defined.) |
base.ns.n classname, inherits and != GPNodeSelector, or String same |
(GPNodeSelector for parent n (n is 0 or 1) If, for ns.1 the value is same, then ns.1 a copy of whatever ns.0 is. Note that the default version has no n) |
base.toss bool = true or false (default)/td> | (after crossing over with the first new individual, should its second sibling individual be thrown away instead of adding it to the population?) |
base.homologous bool = true or false (default)/td> | (Is the implementation homologous (as opposed to size-fair)?) |
Default Base
gp.breed.size-fair
Parameter bases
base.ns.n | nodeselectn (n is 0 or 1) |
Modifier and Type | Field and Description |
---|---|
boolean |
homologous |
static int |
INDS_PRODUCED |
static java.lang.String |
KEY_PARENTS |
int |
maxDepth
The deepest tree the pipeline is allowed to form.
|
GPNodeSelector |
nodeselect1
How the pipeline selects a node from individual 1
|
GPNodeSelector |
nodeselect2
How the pipeline selects a node from individual 2
|
static int |
NUM_SOURCES |
int |
numTries
How many times the pipeline attempts to pick nodes until it gives up.
|
static java.lang.String |
P_HOMOLOGOUS |
static java.lang.String |
P_MAXDEPTH |
static java.lang.String |
P_NUM_TRIES |
static java.lang.String |
P_SIZEFAIR |
static java.lang.String |
P_TOSS |
java.util.ArrayList<Individual> |
parents
Temporary holding place for parents
|
boolean |
tossSecondParent
Should the pipeline discard the second parent after crossing over?
|
int |
tree1
Is the first tree fixed? If not, this is -1
|
int |
tree2
Is the second tree fixed? If not, this is -1
|
P_NODESELECTOR, P_TREE, TREE_UNFIXED
DYNAMIC_SOURCES, likelihood, mybase, P_LIKELIHOOD, P_NUMSOURCES, P_SOURCE, sources, V_SAME, V_STUB
NO_PROBABILITY, P_PROB, probability
Constructor and Description |
---|
SizeFairCrossoverPipeline() |
Modifier and Type | Method and Description |
---|---|
java.lang.Object |
clone()
Creates a new individual cloned from a prototype,
and suitable to begin use in its own evolutionary
context.
|
Parameter |
defaultBase()
Returns the default base for this prototype.
|
protected GPNode |
findFairSizeNode(java.util.ArrayList nodeToSubtrees,
java.util.HashMap sizeToNodes,
GPNode parent1SelectedNode,
GPTree tree2,
EvolutionState state,
int thread)
This method finds a node using the logic given in the langdon paper.
|
int |
numSources()
Returns the number of sources to this pipeline.
|
int |
produce(int min,
int max,
int subpopulation,
java.util.ArrayList<Individual> inds,
EvolutionState state,
int thread,
java.util.HashMap<java.lang.String,java.lang.Object> misc)
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.
|
void |
traverseTreeForDepth(GPNode node,
java.util.ArrayList nodeToDepth,
java.util.HashMap sizeToNodes)
Recursively travel the tree so that depth and subtree below are computed
only once and can be reused later.
|
int |
typicalIndsProduced()
Returns 2 * minimum number of typical individuals produced by any
sources, else 1* minimum number if tossSecondParent is true.
|
boolean |
verifyPoints(GPInitializer initializer,
GPNode inner1,
GPNode inner2)
Returns true if inner1 can feasibly be swapped into inner2's position.
|
produces
fillStubs, finishProducing, individualReplaced, maxChildProduction, minChildProduction, preparePipeline, prepareToProduce, sourcesAreProperForm
getProbability, pickRandom, setProbability, setupProbabilities
public static final java.lang.String P_NUM_TRIES
public static final java.lang.String P_MAXDEPTH
public static final java.lang.String P_SIZEFAIR
public static final java.lang.String P_TOSS
public static final java.lang.String P_HOMOLOGOUS
public static final int INDS_PRODUCED
public static final int NUM_SOURCES
public static final java.lang.String KEY_PARENTS
public GPNodeSelector nodeselect1
public GPNodeSelector nodeselect2
public int tree1
public int tree2
public int numTries
public int maxDepth
public boolean tossSecondParent
public java.util.ArrayList<Individual> parents
public boolean homologous
public Parameter defaultBase()
Prototype
public int numSources()
BreedingPipeline
numSources
in class BreedingPipeline
public java.lang.Object clone()
Prototype
Typically this should be a full "deep" clone. However, you may share certain elements with other objects rather than clone hem, depending on the situation:
Implementations.
public Object clone()
{
try
{
return super.clone();
}
catch ((CloneNotSupportedException e)
{ throw new InternalError(); } // never happens
}
public Object clone()
{
try
{
MyObject myobj = (MyObject) (super.clone());
// put your deep-cloning code here...
}
catch ((CloneNotSupportedException e)
{ throw new InternalError(); } // never happens
return myobj;
}
public Object clone()
{
MyObject myobj = (MyObject) (super.clone());
// put your deep-cloning code here...
return myobj;
}
clone
in interface Prototype
clone
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 typicalIndsProduced()
typicalIndsProduced
in class BreedingPipeline
public boolean verifyPoints(GPInitializer initializer, GPNode inner1, GPNode inner2)
public int produce(int min, int max, int subpopulation, java.util.ArrayList<Individual> inds, EvolutionState state, int thread, java.util.HashMap<java.lang.String,java.lang.Object> misc)
BreedingSource
produce
in class BreedingSource
protected GPNode findFairSizeNode(java.util.ArrayList nodeToSubtrees, java.util.HashMap sizeToNodes, GPNode parent1SelectedNode, GPTree tree2, EvolutionState state, int thread)
nodeToSubtrees
- For Tree of Parent2 all precomputed stats about depth,subtrees etcsizeToNodes
- Quick lookup for LinkedList of size to Nodesparent1SelectedNode
- Node selected in parent1tree2
- Tree of parent2state
- Evolution State passed for getting access to Random Object of MersenneTwiserthread
- thread numberpublic void traverseTreeForDepth(GPNode node, java.util.ArrayList nodeToDepth, java.util.HashMap sizeToNodes)
node
- nodeToDepth
-