Uses of Interface
org.cicirello.search.operators.MutationIterator
Packages that use MutationIterator
Package
Description
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.
This package includes classes that implement operators that create, mutate, etc, BitVectors.
This package includes classes that implement local search and evolutionary operators for
permutations, such as mutation operators, crossover operators, and initializers.
-
Uses of MutationIterator in org.cicirello.search.operators
Methods in org.cicirello.search.operators that return MutationIteratorModifier and TypeMethodDescriptionCreates and returns aMutationIteratorthat 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. -
Uses of MutationIterator in org.cicirello.search.operators.bits
Methods in org.cicirello.search.operators.bits that return MutationIterator -
Uses of MutationIterator in org.cicirello.search.operators.permutations
Methods in org.cicirello.search.operators.permutations that return MutationIteratorModifier and TypeMethodDescriptionAdjacentSwapMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.BlockInterchangeMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.BlockMoveMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.InsertionMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.ReversalMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.RotationMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.SwapMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.TwoChangeMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.WindowLimitedBlockMoveMutation.iterator(Permutation p) WindowLimitedInsertionMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.WindowLimitedReversalMutation.iterator(Permutation p) Creates and returns aMutationIteratorthat 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.WindowLimitedSwapMutation.iterator(Permutation p)