| Interface | Description |
|---|---|
| IAlgorithm<I,O> |
The algorithms should actually also be interruptible, but since this is often not the case,
we require the cancel method to ensure that the authors of the algorithms provide a mechanism
to stop the algorithm and free the used resources.
|
| IAlgorithmConfig | |
| IAlgorithmFactory<I,O> | |
| IOptimizationAlgorithm<I,O extends ScoredItem<V>,V extends java.lang.Comparable<V>> |
Optimizers usually do not compute their output ad-hoc but, in many iterations, update the currently best known solution.
|
| IOptimizationAlgorithmFactory<I,O extends ScoredItem<V>,V extends java.lang.Comparable<V>> | |
| IRandomAlgorithmConfig | |
| ISolutionCandidateIterator<I,O> |
| Class | Description |
|---|---|
| AAlgorithm<I,O> | |
| AAlgorithmFactory<I,O> | |
| AOptimizer<I,O extends ScoredItem<V>,V extends java.lang.Comparable<V>> |
The AOptimizer represents an algorithm that is meant to optimize for a single best solution.
|
| ASolutionCandidateIterator<I,O> |
A template for algorithms that iterate over solution candidates.
|
| Enum | Description |
|---|---|
| EAlgorithmState |
This enum encapsulates the states an algorithm may take.
|
| Exception | Description |
|---|---|
| AlgorithmExecutionCanceledException | |
| ExceptionInAlgorithmIterationException |