Uses of Package org.cicirello.search.operators (Chips-n-Salsa - A Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms)

Packages that use org.cicirello.search.operators
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.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 mutation operators for permutations, and other operators required by simulated annealing and other related metaheuristics.
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.problems	Package of classes and interfaces related to representing computational problems, as well as classes implementing a variety of specific computational problems.
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.
org.cicirello.search.ss	This package includes classes and interfaces directly related to implementing stochastic sampling algorithms.

Classes in org.cicirello.search.operators used by org.cicirello.search.hc
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
IterableMutationOperator	Implement the IterableMutationOperator interface to define a mutation operator that enables iterating systematically over the neighbors of a candidate solution, like one would do in a hill climber.

Classes in org.cicirello.search.operators used by org.cicirello.search.operators
Class	Description
HybridMutation	A HybridMutation enables using multiple mutation operators for the search, such that each time the `HybridMutation.mutate(T)` method is called, a randomly chosen mutation operator is applied to the candidate solution.
HybridUndoableMutation	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.
InitializeBySimpleMetaheuristic	This class implements the `Initializer` interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem, that are themselves generated via a metaheuristic.
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
IterableMutationOperator	Implement the IterableMutationOperator interface to define a mutation operator that enables iterating systematically over the neighbors of a candidate solution, like one would do in a hill climber.
MutationIterator	Defines an interface for iterating over all of the mutants (i.e., neighbors) of a candidate solution to a problem.
MutationOperator	Implement the MutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.
WeightedHybridMutation	A WeightedHybridMutation enables using multiple mutation operators for the search, such that each time the `WeightedHybridMutation.mutate(T)` method is called, a randomly chosen mutation operator is applied to the candidate solution.
WeightedHybridUndoableMutation	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.

Classes in org.cicirello.search.operators used by org.cicirello.search.operators.bits
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
IterableMutationOperator	Implement the IterableMutationOperator interface to define a mutation operator that enables iterating systematically over the neighbors of a candidate solution, like one would do in a hill climber.
MutationIterator	Defines an interface for iterating over all of the mutants (i.e., neighbors) of a candidate solution to a problem.
MutationOperator	Implement the MutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.

Classes in org.cicirello.search.operators used by org.cicirello.search.operators.integers
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
MutationOperator	Implement the MutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.

Classes in org.cicirello.search.operators used by org.cicirello.search.operators.permutations
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
IterableMutationOperator	Implement the IterableMutationOperator interface to define a mutation operator that enables iterating systematically over the neighbors of a candidate solution, like one would do in a hill climber.
MutationIterator	Defines an interface for iterating over all of the mutants (i.e., neighbors) of a candidate solution to a problem.
MutationOperator	Implement the MutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.

Classes in org.cicirello.search.operators used by org.cicirello.search.operators.reals
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
MutationOperator	Implement the MutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.

Classes in org.cicirello.search.operators used by org.cicirello.search.problems
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.

Classes in org.cicirello.search.operators used by org.cicirello.search.sa
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.
UndoableMutationOperator	Implement the UndoableMutationOperator interface to implement a mutation operator for use in simulated annealing, and other metaheuristics, that require a way to generate random neighbors of a candidate solution, and which supports an undo method.

Classes in org.cicirello.search.operators used by org.cicirello.search.ss
Class	Description
Initializer	Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.