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

Packages that use UndoableMutationOperator

Package	Description
org.cicirello.search.evo	This package includes classes and interfaces directly related to implementing evolutionary algorithms.
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.integers	This package includes classes that implement operators that create, mutate, etc, integer valued representations.
org.cicirello.search.operators.permutations	This package includes classes that implement local search and evolutionary operators for permutations, such as mutation operators, crossover operators, and initializers.
org.cicirello.search.operators.reals	This package includes classes that implement operators that create, mutate, etc, the the inputs to functions with real-valued input parameters (represented with type double), such as is required to solve function optimization problems using simulated annealing or other metaheuristics.
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.

Uses of UndoableMutationOperator in org.cicirello.search.evo

Constructors in org.cicirello.search.evo with parameters of type UndoableMutationOperator

Modifier	Constructor	Description
	OnePlusOneEvolutionaryAlgorithm(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer)	Creates a OnePlusOneEvolutionaryAlgorithm instance for integer-valued optimization problems.
	OnePlusOneEvolutionaryAlgorithm(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Creates a OnePlusOneEvolutionaryAlgorithm instance for integer-valued optimization problems.
	OnePlusOneEvolutionaryAlgorithm(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer)	Creates a OnePlusOneEvolutionaryAlgorithm instance for real-valued optimization problems.
	OnePlusOneEvolutionaryAlgorithm(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Creates a OnePlusOneEvolutionaryAlgorithm instance for real-valued optimization problems.

Uses of UndoableMutationOperator in org.cicirello.search.operators

Classes in org.cicirello.search.operators that implement UndoableMutationOperator

Modifier and Type	Class	Description
final class	HybridUndoableMutation<T>	A HybridMutation enables using multiple mutation operators for the search, such that each time the HybridUndoableMutation.mutate(T) method is called, a randomly chosen mutation operator is applied to the candidate solution.
final class	WeightedHybridUndoableMutation<T>	A WeightedHybridMutation enables using multiple mutation operators for the search, such that each time the WeightedHybridUndoableMutation.mutate(T) method is called, a randomly chosen mutation operator is applied to the candidate solution.

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

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

Constructor parameters in org.cicirello.search.operators with type arguments of type UndoableMutationOperator

Modifier	Constructor	Description
	HybridUndoableMutation(Collection<? extends UndoableMutationOperator<T>> mutationOps)	Constructs a HybridUndoableMutation from a Collection of MutationOperators.
	WeightedHybridUndoableMutation(Collection<? extends UndoableMutationOperator<T>> mutationOps, int[] weights)	Constructs a WeightedHybridUndoableMutation from a Collection of UndoableMutationOperator.

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

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

Modifier and Type	Class	Description
final class	BitFlipMutation	This class implements Bit Flip Mutation, the mutation operator commonly used in genetic algorithms, but which can also be used with other metaheuristic search algorithms such as simulated annealing to generate random neighbors.
final class	DefiniteBitFlipMutation	DefiniteBitFlipMutation implements a variation of Bit Flip Mutation.

Uses of UndoableMutationOperator in org.cicirello.search.operators.integers

Classes in org.cicirello.search.operators.integers that implement UndoableMutationOperator

Modifier and Type	Class	Description
final class	UndoableRandomValueChangeMutation<T extends IntegerValued>	This mutation operator (supporting the undo operation) is for integer valued representations, and replaces an integer value with a different random integer value from the domain.
class	UndoableUniformMutation<T extends IntegerValued>	This class implements a uniform mutation with support for the undo(T) method.

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

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

Modifier and Type	Class	Description
final class	AdjacentSwapMutation	This class implements an adjacent swap mutation on permutations, where one mutation consists in randomly swapping a pair of adjacent elements.
final 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).
final 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.
final class	CycleAlphaMutation	This class implements the Cycle(α) form of cycle mutation on permutations, where one mutation generates a random permutation cycle.
final class	CycleMutation	This class implements the Cycle(kmax) form of cycle mutation on permutations, where one mutation generates a random permutation cycle.
final 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.
final class	ReversalMutation	This class implements a reversal mutation on permutations, where one mutation consists in reversing the order of a randomly selected subpermutation.
final class	RotationMutation	This class implements a rotation mutation on permutations, where one mutation consists in a random circular rotation of the permutation.
final class	SwapMutation	This class implements a swap mutation on permutations, where one mutation selects two elements uniformly at random and swaps their locations.
final class	ThreeOptMutation	This class implements the classic 3-Opt neighborhood as a mutation operator for permutations.
final class	TwoChangeMutation	This class implements the classic two-change operator as a mutation operator for permutations.
final class	UndoableScrambleMutation	This class implements a scramble mutation on permutations, where one mutation consists in randomizing the order of a randomly selected subpermutation.
final class	UndoableUniformScrambleMutation	This class implements a scramble mutation on permutations, where one mutation consists in randomizing the order of a non-contiguous subset of the permutation elements.
final class	WindowLimitedBlockMoveMutation	This class implements a window-limited version of the BlockMoveMutation mutation operator on permutations.
final class	WindowLimitedInsertionMutation	This class implements a window-limited version of the InsertionMutation mutation operator on permutations.
final class	WindowLimitedReversalMutation	This class implements a window-limited version of the ReversalMutation mutation operator on permutations.
final class	WindowLimitedSwapMutation	This class implements a window-limited version of the SwapMutation mutation operator on permutations.
final class	WindowLimitedUndoableScrambleMutation	This class implements a window-limited version of the ScrambleMutation mutation operator on permutations.

Uses of UndoableMutationOperator in org.cicirello.search.operators.reals

Classes in org.cicirello.search.operators.reals that implement UndoableMutationOperator

Modifier and Type	Class	Description
class	UndoableCauchyMutation<T extends RealValued>	This class implements Cauchy mutation with support for the undo(T) method.
final class	UndoableGaussianMutation<T extends RealValued>	This class implements Gaussian mutation with support for the undo(T) method.
class	UndoableUniformMutation<T extends RealValued>	This class implements a uniform mutation with support for the undo(T) method.

Uses of UndoableMutationOperator in org.cicirello.search.sa

Constructors in org.cicirello.search.sa with parameters of type UndoableMutationOperator

Modifier	Constructor	Description
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021).
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021).
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), and which runs a hill climber as a post-processing step.
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems that runs a hill climber as a post-processing step.
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems that runs a hill climber as a post-processing step.
	SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), and which runs a hill climber as a post-processing step.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer)	Creates a SimulatedAnnealing search instance for real-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021).
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for real-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021).
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for real-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), and which runs a hill climber as a post-processing step.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal)	Creates a SimulatedAnnealing search instance for real-valued optimization problems.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for real-valued optimization problems.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for real-valued optimization problems that runs a hill climber as a post-processing step.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for real-valued optimization problems that runs a hill climber as a post-processing step.
	SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for real-valued optimization problems, with a default annealing schedule of SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), and which runs a hill climber as a post-processing step.