- All Implemented Interfaces:
- Direct Known Subclasses:
The runtime (worst case and average case) of the
mutate method is
O(n), where n is the length of the permutation. The worst case runtime occurs when the random
indexes are the two end points. On average, a scramble mutation moves approximately n/3 elements.
Constructor SummaryConstructorDescriptionConstructs a ScrambleMutation mutation operator.
ScrambleMutationpublic ScrambleMutation()Constructs a ScrambleMutation mutation operator.
mutatepublic final void mutate
(Permutation c)Description copied from interface:
MutationOperatorMutates a candidate solution to a problem, by randomly modifying its state. The mutant that is produced is in the local neighborhood of the original candidate solution.
splitpublic ScrambleMutation 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.