Module org.cicirello.chips_n_salsa
Package org.cicirello.search.operators.permutations

Class WindowLimitedBlockMoveMutation

java.lang.Object
org.cicirello.search.operators.permutations.BlockMoveMutation
org.cicirello.search.operators.permutations.WindowLimitedBlockMoveMutation
All Implemented Interfaces:
Splittable<MutationOperator<Permutation>>, IterableMutationOperator<Permutation>, MutationOperator<Permutation>, UndoableMutationOperator<Permutation>
public final class WindowLimitedBlockMoveMutation extends BlockMoveMutation
This class implements a window-limited version of the BlockMoveMutation mutation operator on permutations. A window-limited mutation operator on permutations is a mutation operator such that there is a window constraint, w, on the random indexes used by the mutation. For a mutation operator like BlockMoveMutation that uses three random indexes (i, j, k), two to define the block and the third for the reinsertion point, these indexes are constrained such that |i-j| ≤ w, |i-k| ≤ w, |j-k| ≤ w. All index triples that satisfy the window constraint are equally likely.

The runtime (worst case and average case) of both the mutate and undo methods is O(min(n,w)), where n is the length of the permutation.

For further discussion of window limited permutation mutation operators see:
V. A. Cicirello, "On the Effects of Window-Limits on the Distance Profiles of Permutation Neighborhood Operators," in Proceedings of the 8th International Conference on Bioinspired Information and Communications Technologies, pages 28–35, December 2014.

  • Constructor Details

    • WindowLimitedBlockMoveMutation

      public WindowLimitedBlockMoveMutation()
      Constructs a WindowLimitedBlockMoveMutation mutation operator with a default window limit of Integer.MAX_VALUE.

    • WindowLimitedBlockMoveMutation

      public WindowLimitedBlockMoveMutation(int windowLimit)
      Constructs a WindowLimitedBlockMoveMutation mutation operator.
      Parameters:
      windowLimit - The window limit, which must be positive.
      Throws:
      IllegalArgumentException - if windowLimit ≤ 0

  • Method Details

    • split

      public WindowLimitedBlockMoveMutation split()
      Description copied from interface: Splittable
      Generates 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 Copyable interface. 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.
      Specified by:
      split in interface IterableMutationOperator<Permutation>
      Specified by:
      split in interface Splittable<MutationOperator<Permutation>>
      Specified by:
      split in interface UndoableMutationOperator<Permutation>
      Overrides:
      split in class BlockMoveMutation
      Returns:
      A functionally identical copy of the object, or a reference to this if it is both safe and efficient for multiple threads to share a single instance of this Splittable object.

    • iterator

      public MutationIterator iterator(Permutation p)
      Description copied from class: BlockMoveMutation
      Creates and returns a MutationIterator that can be used to systematically iterate over all of the direct neighbors (i.e., a single mutation step away) of a candidate solution, as one might do in a hill climber.

      The worst case runtime of the MutationIterator.hasNext() and the MutationIterator.setSavepoint() methods of the MutationIterator created by this method is O(1). The amortized runtime of the MutationIterator.nextMutant() method is O(1). And the worst case runtime of the MutationIterator.rollback() method is O(n), where n is the length of the Permutation.

      Specified by:
      iterator in interface IterableMutationOperator<Permutation>
      Overrides:
      iterator in class BlockMoveMutation
      Parameters:
      p - The candidate solution subject to the mutation. Calling methods of the MutationIterator that is returned changes the state of that candidate solution. See the documentation of those methods for details of how such changes may occur.
      Returns:
      A MutationIterator for iterating over the direct neighbors of a candidate solution.