Uses of Package
org.cicirello.search.concurrent
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 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 operators that create, mutate, etc, integer valued
representations.
This package includes classes that implement local search and evolutionary operators for
permutations, such as mutation operators, crossover operators, and initializers.
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.
Package of classes and interfaces related to representing computational problems, as well as
classes implementing a variety of specific computational problems.
Package of classes and interfaces related to representing and solving scheduling problems, which
includes implementations of constructive heuristics for scheduling problems.
Classes and interfaces related to the Traveling Salesperson Problem (TSP).
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.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThis class enables running multiple copies of a metaheuristic, or multiple metaheuristics, in parallel with multiple threads.This class is used for implementing parallel multistart metaheuristics.This class enables running multiple copies of a metaheuristic, or multiple metaheuristics, in parallel with multiple threads.This class is used for implementing parallel multistart metaheuristics.The Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.This class is used for implementing parallel multistart metaheuristics.This class is used for implementing parallel multistart metaheuristics.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.
-
ClassDescriptionThe Splittable interface provides multithreaded search algorithms with the ability to generate functionally identical copies of operators, and even entire metaheuristics, at the point of spawning new search threads.