Initializer (Chips-n-Salsa - A Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms)

Type Parameters:

T - The type of object used to represent candidate solutions to the problem.

All Superinterfaces:

Splittable<Initializer<T>>

All Known Implementing Classes:

BitVectorInitializer, BoundMax, ForresterEtAl2008, GramacyLee2012, InitializeBySimpleMetaheuristic, IntegerValueInitializer, IntegerVectorInitializer, PermutationInitializer, PermutationToBitVectorProblem, PermutationToBitVectorProblem.DoubleCost, PermutationToBitVectorProblem.IntegerCost, RealValueInitializer, RealVectorInitializer
```
public interface Initializer<T>
extends Splittable<Initializer<T>>
```
Implement the Initializer interface to provide metaheuristics and other search algorithms with a way to generate initial candidate solutions to a problem.

Many such algorithms start with a randomized initial candidate solution, while some start with a heuristic solution. Classes that implement this interface serve that functionality.

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  T createCandidateSolution()
  Creates one candidate solution to a problem.
  - Methods inherited from interface org.cicirello.search.concurrent.Splittable
    split

- Method Detail
  - createCandidateSolution
```
T createCandidateSolution()
```
    Creates one candidate solution to a problem.
    
    Returns:
    
    a candidate solution to a problem instance.