Uses of Interface
org.cicirello.search.operators.IterableMutationOperator

Packages that use IterableMutationOperator

Package	Description
org.cicirello.search.hc	This package includes classes and interfaces directly related to implementing hill climbers.
org.cicirello.search.operators	This package includes classes and interfaces for defining various operators required by simulated annealing and other metaheuristics, such as mutation operators, along with other related classes and interfaces.
org.cicirello.search.operators.bits	This package includes classes that implement operators that create, mutate, etc, BitVectors.
org.cicirello.search.operators.permutations	This package includes classes that implement mutation operators for permutations, and other operators required by simulated annealing and other related metaheuristics.

Uses of IterableMutationOperator in org.cicirello.search.hc

Constructors in org.cicirello.search.hc with parameters of type IterableMutationOperator

Constructor	Description
FirstDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a first descent hill climber object for integer-valued optimization problem.
FirstDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a first descent hill climber object for integer-valued optimization problem.
FirstDescentHillClimber(OptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a first descent hill climber object for real-valued optimization problem.
FirstDescentHillClimber(OptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a first descent hill climber object for real-valued optimization problem.
SteepestDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a steepest descent hill climber object for integer-valued optimization problem.
SteepestDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a steepest descent hill climber object for integer-valued optimization problem.
SteepestDescentHillClimber(OptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a steepest descent hill climber object for real-valued optimization problem.
SteepestDescentHillClimber(OptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a steepest descent hill climber object for real-valued optimization problem.

Uses of IterableMutationOperator in org.cicirello.search.operators

Methods in org.cicirello.search.operators that return IterableMutationOperator

Modifier and Type	Method	Description
IterableMutationOperator<T>	IterableMutationOperator.split()

Uses of IterableMutationOperator in org.cicirello.search.operators.bits

Classes in org.cicirello.search.operators.bits that implement IterableMutationOperator

Modifier and Type	Class	Description
class	DefiniteBitFlipMutation	DefiniteBitFlipMutation implements a variation of Bit Flip Mutation.

Uses of IterableMutationOperator in org.cicirello.search.operators.permutations

Classes in org.cicirello.search.operators.permutations that implement IterableMutationOperator

Modifier and Type	Class	Description
class	AdjacentSwapMutation	This class implements an adjacent swap mutation on permutations, where one mutation consists in randomly swapping a pair of adjacent elements.
class	BlockInterchangeMutation	This class implements a block interchange mutation on permutations, where one mutation consists in swapping two randomly chosen non-overlapping "blocks" (i.e., subsequences).
class	BlockMoveMutation	This class implements a block move mutation on permutations, where one mutation consists in removing a randomly chosen "block" (i.e., subsequence) and reinserting it at a different randomly chosen index.
class	InsertionMutation	This class implements an insertion mutation on permutations, where one mutation consists in removing a randomly chosen element and reinserting it at a different randomly chosen location.
class	ReversalMutation	This class implements a reversal mutation on permutations, where one mutation consists in reversing the order of a randomly selected subpermutation.
class	SwapMutation	This class implements a swap mutation on permutations, where one mutation selects two elements uniformly at random and swaps their locations.
class	WindowLimitedBlockMoveMutation	This class implements a window-limited version of the BlockMoveMutation mutation operator on permutations.
class	WindowLimitedInsertionMutation	This class implements a window-limited version of the InsertionMutation mutation operator on permutations.
class	WindowLimitedReversalMutation	This class implements a window-limited version of the ReversalMutation mutation operator on permutations.
class	WindowLimitedSwapMutation	This class implements a window-limited version of the SwapMutation mutation operator on permutations.