Uses of Interface
org.cicirello.search.Metaheuristic
Packages that use Metaheuristic
Package
Description
This package includes classes and interfaces related to implementing metaheuristic search
algorithms in general, rather than specific to a particular metaheuristic.
This package includes multithreaded search implementations, as well as classes and interfaces
related to implementing multithreaded metaheuristics.
This package includes classes and interfaces directly related to implementing evolutionary
algorithms.
This package includes classes and interfaces directly related to implementing hill climbers.
This package includes classes and interfaces related to implementing multistart metaheuristics
(i.e., metaheuristics that periodically restart, and return the best solution across a number of
such restarts).
This package includes classes and interfaces directly related to implementing simulated
annealing.
This package includes classes and interfaces directly related to implementing stochastic sampling
algorithms.
-
Uses of Metaheuristic in org.cicirello.search
Subinterfaces of Metaheuristic in org.cicirello.searchModifier and TypeInterfaceDescriptioninterfaceReoptimizableMetaheuristic<T extends Copyable<T>>This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.interfaceSingleSolutionMetaheuristic<T extends Copyable<T>>This interface defines the required methods for implementations of single-solution metaheuristics, i.e., metaheuristics such as simulated annealing that operate one a single candidate solution (as compared to population-based metaheuristics such as genetic algorithms.Methods in org.cicirello.search that return Metaheuristic -
Uses of Metaheuristic in org.cicirello.search.concurrent
Classes in org.cicirello.search.concurrent that implement MetaheuristicModifier and TypeClassDescriptionclassParallelMetaheuristic<T extends Copyable<T>>This class enables running multiple copies of a metaheuristic, or multiple metaheuristics, in parallel with multiple threads.final classParallelMultistarter<T extends Copyable<T>>This class is used for implementing parallel multistart metaheuristics.classParallelReoptimizableMetaheuristic<T extends Copyable<T>>This class enables running multiple copies of a metaheuristic, or multiple metaheuristics, in parallel with multiple threads.final classParallelReoptimizableMultistarter<T extends Copyable<T>>This class is used for implementing parallel multistart metaheuristics.classTimedParallelMultistarter<T extends Copyable<T>>This class is used for implementing parallel multistart metaheuristics.final classTimedParallelReoptimizableMultistarter<T extends Copyable<T>>This class is used for implementing parallel multistart metaheuristics.Constructors in org.cicirello.search.concurrent with parameters of type MetaheuristicModifierConstructorDescriptionParallelMetaheuristic(Metaheuristic<T> search, int numThreads) Constructs a parallel metaheuristic that executes multiple identical copies of a metaheuristic in parallel across multiple threads.ParallelMultistarter(Metaheuristic<T> search, int runLength, int numThreads) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.ParallelMultistarter(Metaheuristic<T> search, Collection<? extends RestartSchedule> schedules) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.ParallelMultistarter(Metaheuristic<T> search, RestartSchedule r, int numThreads) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.TimedParallelMultistarter(Metaheuristic<T> search, int runLength, int numThreads) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.TimedParallelMultistarter(Metaheuristic<T> search, Collection<? extends RestartSchedule> schedules) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.TimedParallelMultistarter(Metaheuristic<T> search, RestartSchedule r, int numThreads) Constructs a parallel multistart metaheuristic that executes multiple runs of a specified metaheuristic in parallel across multiple threads.Constructor parameters in org.cicirello.search.concurrent with type arguments of type MetaheuristicModifierConstructorDescriptionParallelMetaheuristic(Collection<? extends Metaheuristic<T>> searches) Constructs a parallel metaheuristic that executes multiple metaheuristics in parallel across multiple threads.ParallelMultistarter(Collection<? extends Metaheuristic<T>> searches, int runLength) Constructs a parallel multistart metaheuristic that executes multiple runs of a set of specified metaheuristics in parallel across multiple threads.ParallelMultistarter(Collection<? extends Metaheuristic<T>> searches, Collection<? extends RestartSchedule> schedules) Constructs a parallel multistart metaheuristic that executes multiple runs of a set of specified metaheuristics in parallel across multiple threads.TimedParallelMultistarter(Collection<? extends Metaheuristic<T>> searches, int runLength) Constructs a parallel multistart metaheuristic that executes multiple runs of a set of specified metaheuristics in parallel across multiple threads.TimedParallelMultistarter(Collection<? extends Metaheuristic<T>> searches, Collection<? extends RestartSchedule> schedules) Constructs a parallel multistart metaheuristic that executes multiple runs of a set of specified metaheuristics in parallel across multiple threads. -
Uses of Metaheuristic in org.cicirello.search.evo
Classes in org.cicirello.search.evo that implement MetaheuristicModifier and TypeClassDescriptionclassAdaptiveEvolutionaryAlgorithm<T extends Copyable<T>>This class implements an evolutionary algorithm with adaptive control parameters (i.e., crossover rates and mutation rates that evolve during the search).classAdaptiveMutationOnlyEvolutionaryAlgorithm<T extends Copyable<T>>This class implements an mutation-only evolutionary algorithm with an adaptive mutation rate that evolves during the search.classGenerationalEvolutionaryAlgorithm<T extends Copyable<T>>This class implements an evolutionary algorithm with a generational model, such as is commonly used in genetic algorithms, where a population of children are formed by applying genetic operators to members of the parent population, and where the children replace the parents in the next generation.classThis class implements an evolutionary algorithm (EA) with a generational model, where a population of children are formed by applying genetic operators to members of the parent population, and where the children replace the parents in the next generation.classGenerationalMutationOnlyEvolutionaryAlgorithm<T extends Copyable<T>>This class implements an evolutionary algorithm (EA) with a generational model, such as is commonly used in genetic algorithms, where a population of children are formed by applying mutation to members of the parent population, and where the children replace the parents in the next generation.classThis class is an implementation of a genetic algorithm (GA) with the common bit vector representation of solutions to optimization problems, and the generational model where children replace their parents each generation.final classThis class is an implementation of a mutation-only genetic algorithm (GA) with the common bit vector representation of solutions to optimization problems, and the generational model where children replace their parents each generation.classOnePlusOneEvolutionaryAlgorithm<T extends Copyable<T>>This class implements a (1+1)-EA.final classThis class implements a (1+1)-GA, a special case of a (1+1)-EA, where solutions are represented with a vector of bits.final classThis class is an implementation of the simple genetic algorithm (Simple GA) with the common bit vector representation of solutions to optimization problems, and the generational model where children replace their parents each generation. -
Uses of Metaheuristic in org.cicirello.search.hc
Classes in org.cicirello.search.hc that implement MetaheuristicModifier and TypeClassDescriptionfinal classFirstDescentHillClimber<T extends Copyable<T>>This class implements first descent hill climbing.final classSteepestDescentHillClimber<T extends Copyable<T>>This class implements steepest descent hill climbing. -
Uses of Metaheuristic in org.cicirello.search.restarts
Classes in org.cicirello.search.restarts that implement MetaheuristicModifier and TypeClassDescriptionclassMultistarter<T extends Copyable<T>>This class is used for implementing multistart metaheuristics.final classReoptimizableMultistarter<T extends Copyable<T>>This class is used for implementing multistart metaheuristics, that can be restarted at previously found solutions.Constructors in org.cicirello.search.restarts with parameters of type MetaheuristicModifierConstructorDescriptionMultistarter(Metaheuristic<T> search, int runLength) Constructs a multistart metaheuristic that executes multiple runs of a specified metaheuristic, whose runs are all the same in length.Multistarter(Metaheuristic<T> search, RestartSchedule r) Constructs a multistart metaheuristic that executes multiple runs of a specified metaheuristic, whose run lengths follow a specified schedule. -
Uses of Metaheuristic in org.cicirello.search.sa
Classes in org.cicirello.search.sa that implement MetaheuristicModifier and TypeClassDescriptionfinal classSimulatedAnnealing<T extends Copyable<T>>This class is an implementation of the metaheuristic known as simulated annealing. -
Uses of Metaheuristic in org.cicirello.search.ss
Classes in org.cicirello.search.ss that implement MetaheuristicModifier and TypeClassDescriptionfinal classAcceptanceBandSampling<T extends Copyable<T>>The AcceptanceBandSampling class implements a form of stochastic sampling search that uses a constructive heuristic to guide the random decisions.final classHeuristicBiasedStochasticSampling<T extends Copyable<T>>Heuristic Biased Stochastic Sampling (HBSS) is a form of stochastic sampling search that uses a constructive heuristic to bias the random decisions.final classIterativeSampling<T extends Copyable<T>>Iterative sampling is the simplest possible form of a stochastic sampling search.final classValueBiasedStochasticSampling<T extends Copyable<T>>Value Biased Stochastic Sampling (VBSS) is a form of stochastic sampling search that uses a constructive heuristic to bias the random decisions.