Class UniformCrossover<T extends IntegerVector>
- Type Parameters:
T- The specific IntegerVector type, such as
Implementation of uniform crossover, but for IntegerVectors. In uniform crossover, instead of a fixed number of cross points, the crossover operator is controlled by a parameter, p, that is the probability that the values at a position are exchanged between the two parents. If the length of the vectors is N, then N independent random decisions are made regarding whether to exchange each position between the parents in forming the children. The expected number of values exchanged between the parents during a single crossover event is thus p*N. The most common value for p=0.5, which leads to each child inheriting on average half of the values from each of the two parents. Uniform crossover originated for crossover of bit vectors within a genetic algorithm, but has been adapted here for vectors of integers.
Method SummaryModifier and TypeMethodDescription
voidPerforms a crossover for an evolutionary algorithm, such that crossover forms two children from two parents.
split()Generates a functionally identical copy of this object, for use in multithreaded implementations of search algorithms.
UniformCrossoverpublic UniformCrossover()Constructs a uniform crossover operator with a probability of exchanging each value of p=0.5.
(double p)Constructs a uniform crossover operator.
p- The per-position probability of exchanging each value between the parents in forming the children. The expected number of values exchanged during a single call to
cross(org.cicirello.search.representations.IntegerVector, org.cicirello.search.representations.IntegerVector)is thus p*N, where N is the length of the vector.
crossPerforms a crossover for an evolutionary algorithm, such that crossover forms two children from two parents. Implementations of this method modify the parameters, transforming the parents into the children.
Behavior is undefined if the IntegerVectors are of different lengths.
splitDescription copied from interface:
SplittableGenerates a functionally identical copy of this object, for use in multithreaded implementations of search algorithms. The state of the object that is returned may or may not be identical to that of the original. Thus, this is a distinct concept from the functionality of the
Copyableinterface. Classes that implement this interface must ensure that the object returned performs the same functionality, and that it does not share any state data that would be either unsafe or inefficient for concurrent access by multiple threads. The split method is allowed to simply return the this reference, provided that it is both safe and efficient for multiple threads to share a single copy of the Splittable object. The intention is to provide a multithreaded search with the capability to provide spawned threads with their own distinct search operators. Such multithreaded algorithms can call the split method for each thread it spawns to generate a functionally identical copy of the operator, but with independent state.