Implementation of single point crossover, a classic crossover operator for BitVectors. In a single point crossover, a random cross point is chosen uniformly along the length of the bit vector parents. Both parents are cut at that point. Each child gets the bits before the cross point from one parent, and the bits after the cross point from the other parent.
Constructor SummaryConstructorDescriptionConstructs a single point crossover operator.
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.
SinglePointCrossoverpublic SinglePointCrossover()Constructs a single point crossover operator.
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.
- Specified by:
c1- A candidate solution subject to the crossover. This method changes the state of c1.
c2- A candidate solution subject to the crossover. This method changes the state of c2.
IllegalArgumentException- if c1.length() is not equal to c2.length()
IllegalArgumentException- if c1.length() is less than 2.
splitpublic SinglePointCrossover split()Description 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.