Uses of Package
org.cicirello.search.problems
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.
Package of classes and interfaces related to representing computational problems, as well as
classes implementing a variety of specific computational problems.
Classes and interfaces related to the Bin Packing.
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.

ClassDescriptionBase interface for all interfaces defining types of problems supported by the library.

ClassDescriptionBase interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionA continuous function with a single suboptimal local minimum, and a single global minimum, and a 0 derivative inflexion point, defined for inputs x in [0.0, 1.0].A continuous function with a large number of local minimums, and a single global minimum, defined for input x in [0.5, 2.5].The IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).This class is an implementation of the Largest Common Subgraph problem, an NPHard combinatorial optimization problem.This class is used to represent edges when specifying instances of the
LargestCommonSubgraph
problem.The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).This class implements a mapping between Permutation problems and BitVector problems, enabling usingBitVector
search operators to solve problems defined over the space ofPermutation
objects.This class implements a mapping between Permutation problems and BitVector problems, where cost values are of type double.This class implements a mapping between Permutation problems and BitVector problems, where cost values are of type int.Base interface for all interfaces defining types of problems supported by the library.This class is an implementation of the Quadratic Assignment Problem (QAP), an NPHard optimization problem. 
ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionBase interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.

ClassDescriptionThe IntegerCostOptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., traveling salesperson, bin packing, etc).The OptimizationProblem interface provides search algorithms with a way to interact with an instance of an optimization problem without the need to know the specifics of the problem (e.g., realvalued function optimization, traveling salesperson, bin packing, etc).Base interface for all interfaces defining types of problems supported by the library.